Brief announcement: Regional consecutive leader election in mobile ad-hoc networks

Hyun Chul Chung, Peter Robinson, Jennifer L. Welch

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

1 Scopus citations


In this paper we introduce the regional consecutive leader election (RCLE) problem, which extends the classic leader election problem to the continuously-changing environment of mobile ad-hoc networks. We assume that mobile nodes can fail by crashing, and might enter or exit the region of interest at any time. We require the existence of certain paths which ensures a bound on the time for propagation of information within the region. We present and prove correct an algorithm that solves RCLE for a fixed region in 2 or 3-dimensional space. Our algorithm does not rely on the knowledge of the total number of nodes in the system nor on a common startup time. Additionally, we introduce a condition on mobility that is sufficient to ensure the existence of the paths required by our RCLE algorithm.

Original languageEnglish (US)
Title of host publicationAlgorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Revised Selected Papers
PublisherSpringer Verlag
Number of pages3
ISBN (Print)3642169872, 9783642169878
StatePublished - 2010
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6451 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Brief announcement: Regional consecutive leader election in mobile ad-hoc networks'. Together they form a unique fingerprint.

Cite this