EFFICIENT SECURE CLUSTERING PROTOCOL FOR MOBILE AD-HOC NETWORK

Abstract

A Mobile ad hoc Network is an autonomous network comprised of free roaming nodes which communicate wireless by radio transmission. MANETs are already ubiquitous and their range of use will spread in the near future. In this thesis proposed an efficient dynamic clustering protocol for MANET. In our dynamic clustering protocol have five state interactions. These are un-clustered state, orphan state, election state, cluster node state, and cluster head state. Also, we develop key distribution method for the distribution of symmetric keys in MANETs. Our dynamic clustering protocol is designed to verify the protocol and have an estimate of the cost to gather the density information. We did the analysis from our dynamic clustering protocol different perspectives, in terms of time, clustering, and network packets. For evaluating in terms of time, time spent as part of cluster was measured. From clustering perspective, number of clusters, and number of nodes per cluster were measured. To estimate the network performance, number of protocol packets, and application packets transmitted were measured. And simulate the key distribution process to built authentication. Our results show the effectiveness and more efficient comparatively with previous work.

Keywords- MANET, Clustering, Election Techniques, Distribution Key management