Leader election algorithms for mobile ad hoc networks

Citations Over TimeTop 10% of 2000 papers

Abstract

We present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected component of the topology graph has exactly one leader. The algorithms are based on a routing algorithm called TORA [5], which in turn is based on an algorithm by Gafni and Bertsekas [3]. The algorithm require nodes to communicate with only their current neighbors, making it well suited to the ad hoc environment. The first algorithm is for a single topology change and is provided with a proof of correctness. The second algorithm tolerates multiple concurrent topology changes.

Related Papers

• → Realize 1-hop node localization based on OLSR protocol in Ad Hoc networks(2012)2 cited
• → Managing mobile ad hoc networks(2004)1 cited
• → The performance of blacklisting in ad hoc networks with unidirectional links(2011)
• → Light Ad Hoc Network: A Solution to Hidden Terminal Problem(2020)