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

Authors:
Hyun Chul Chung;Peter Robinson;Jennifer L. Welch
Affiliations:
Texas A&M University, Department of Computer Science & Engineering, College Station TX;Technische Universität Wien, Embedded Computing Systems Group, Vienna, Austria;Texas A&M University, Department of Computer Science & Engineering, College Station TX
Venue:
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Year:
2010

Citing 1
Cited 1

Regional consecutive leader election in mobile ad-hoc networks

Proceedings of the 6th International Workshop on Foundations of Mobile Computing

Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-FIFO) dynamic networks

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paperwe introduce the regional consecutive leader election (RCLE) problem, which extends the classic leader election problem to the continuously-changing environment ofmobile 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.