A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks
Loading...
Files
Date
2008
Authors
Dağdeviren, Orhan
Erciyeş, Kayhan
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
Open Access Color
BRONZE
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
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.
Description
8th International Conference on Computational Science, ICCS 2008; Krakow; Poland; 23 June 2008 through 25 June 2008
Keywords
Ad hoc networks, Chang Roberts algorithm, Leader election, Telecommunication networks, Wireless networks, Ad hoc networks, Leader election, leader election, mobile ad hoc networks, Telecommunication networks, Chang Roberts algorithm, Wireless networks
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
Dağ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_56
WoS Q
N/A
Scopus Q
Q3

OpenCitations Citation Count
10
Source
Lecture Notes in Computer Science
Volume
5101 LNCS
Issue
PART 1
Start Page
509
End Page
518
PlumX Metrics
Citations
CrossRef : 3
Scopus : 20
Captures
Mendeley Readers : 11
SCOPUS™ Citations
20
checked on Apr 27, 2026
Web of Science™ Citations
12
checked on Apr 27, 2026
Page Views
742
checked on Apr 27, 2026
Downloads
340
checked on Apr 27, 2026
Google Scholar™


