Leader election algorithms for mobile ad hoc networks

By N. Malpani, J. Welch, Nitin H. Vaidya. DIALM '00, 2000

357 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/7c417c26ace5ef14eb39df148837e8dcffbd18b7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Distributed computation in dynamic networks (2010, background): “Another assumption, studied for example in [26, 28, 35], requires topology changes to be infrequent and spread out over time, so that the system has enough time to recover from a change before the next one occurs.”
Online outlier detection in sensor data using non-parametric models (2006, background): “When a leader node fails, we simply have to elect a new node [33] to act as the leader for the particular cell in the hierarchical grid.”
Optimal Distributed Online Prediction (2011, methodology): “It can be solved using leader election algorithms such as Gallager et al. (1983) and Malpani et al. (2000).”
Robust Distributed Online Prediction (2010, methodology): “[6] proposed a leader election algorithm for ad-hoc networks.”