Leader election algorithms for mobile ad hoc networks

Navneet Malpani, Jennifer L. Welch, Nitin Vaidya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 algorithms 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.

Original languageEnglish (US)
Title of host publicationProceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications
PublisherAssociation for Computing Machinery
Pages96-103
Number of pages8
ISBN (Print)1581133014, 9781581133011
DOIs
StatePublished - 2000
Externally publishedYes
EventProceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications - Boston, MA, United States
Duration: Aug 11 2000Aug 11 2000

Publication series

NameProceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications

Other

OtherProceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications
Country/TerritoryUnited States
CityBoston, MA
Period8/11/008/11/00

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Leader election algorithms for mobile ad hoc networks'. Together they form a unique fingerprint.

Cite this