Leader Election is an important problem in mobile ad hoc networks and in distributed computing systems. In this study, we propose a hierarchical, cluster based protocol to elect a leader in a mobile ad hoc network. The initial phase of the protocol employs a clustering algorithm to group nodes of the network after which a leader for a cluster(clusterhead) is elected. The second phase is performed by forming a connected ring of these leaders using the Ring Formation Algorithm. Finally, Chang Roberts Leader Election Algorithm for rings is employed in the final phase to elect the super-leader among the clusterheads. We provide performance results of this protocol for various mobility parameters and analyze its time and message complexities. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Dagdeviren, O., & Erciyes, K. (2008). A hierarchical leader election protocol for mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5101 LNCS, pp. 509–518). https://doi.org/10.1007/978-3-540-69384-0_56
Mendeley helps you to discover research relevant for your work.