Asynchronous leader election in mobile ad hoc networks

With the proliferation of portable computing platforms and small wireless devices, the classical dilemma of leader election in mobile ad hoc networks has received attention from the research community in recent years. The problem aims to elect a unique leader among mobile nodes regardless of their p...

Full description

Saved in:
Bibliographic Details
Main Authors: Masum, S.M., Ali, A.A., Bhuiyan, M.T.-yI
Format: Conference Proceeding
Language:English
Subjects:
Ad hoc networks
Computer crashes
Intelligent networks
Mobile ad hoc networks
Mobile communication
Network topology
Nominations and elections
Partitioning algorithms
Protocols
Wireless sensor networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the proliferation of portable computing platforms and small wireless devices, the classical dilemma of leader election in mobile ad hoc networks has received attention from the research community in recent years. The problem aims to elect a unique leader among mobile nodes regardless of their physical locations. But, existing distributed leader election algorithms do not cope with highly spontaneous nature of mobile ad hoc networks. This paper presents a consensus-based leader election algorithm that finds a local extrema among the nodes participating in leader election. The algorithm is highly adaptive with ad hoc networks in the sense that it can tolerate intermittent failures, such as link failures, sudden crash or recovery of mobile nodes, network partitions, and merging of connected network components associated with ad hoc networks. The paper also presents proofs of correctness to exhibit the fairness of this algorithm.
ISSN:1550-445X
2332-5658
DOI:10.1109/AINA.2006.106