Dağdeviren, OrhanErciyeş, Kayhan03.04. Department of Computer Engineering03. Faculty of Engineering01. Izmir Institute of Technology2016-11-012016-11-012008Dağdeviren, O., and Erciyeş, K. (2008). A hierarchical leader election protocol for mobile ad hoc networks. Lecture Notes in Computer Science, 5101 LNCS(PART 1), 509-518. doi:10.1007/978-3-540-69384-0_5697835406938330302-97431611-3349http://doi.org/10.1007/978-3-540-69384-0_56http://hdl.handle.net/11147/23628th International Conference on Computational Science, ICCS 2008; Krakow; Poland; 23 June 2008 through 25 June 2008Leader 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.eninfo:eu-repo/semantics/openAccessAd hoc networksChang Roberts algorithmLeader electionTelecommunication networksWireless networksConference Object2-s2.0-4774911926410.1007/978-3-540-69384-0_56Top10%