Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chung, H.C., Robinson, P., Welch, J.L.: Regional consecutive leader election in mobile ad-hoc networks. Technical Report 12/2010, Vienna University of Technology, Embedded Computing Systems Group (E182/2), Treitlstr. 1-3, 1040 Vienna, Austria (2010)
Chung, H.C., Robinson, P., Welch, J.L.: Regional consecutive leader election in mobile ad-hoc networks. In: Proc. 6th International Workshop on Foundations of Mobile Computing (DIALM-POMC 2010) (to appear in September 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chung, H.C., Robinson, P., Welch, J.L. (2010). Brief Announcement: Regional Consecutive Leader Election in Mobile Ad-Hoc Networks. In: Scheideler, C. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2010. Lecture Notes in Computer Science, vol 6451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16988-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-16988-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16987-8
Online ISBN: 978-3-642-16988-5
eBook Packages: Computer ScienceComputer Science (R0)