Deterministic Leader Election in Multi-hop Beeping Networks

Deterministic Leader Election in Multi-hop Beeping Networks

Abstract

We study deterministic leader election in multi-hop radio networks in the beeping model. More specifically, we address explicit leader election: One node is elected as the leader, the other nodes know its identifier, and the algorithm terminates at some point with the network being quiescent. No initial knowledge of the network is assumed, i.e., nodes know neither the size of the network nor their degree, they only have a unique identifier. Our main contribution is a deterministic explicit leader election algorithm in the synchronous beeping model with a run time of O(D logn) rounds. This is achieved by carefully combining a fast local election algorithm with two new techniques for synchronization and communication in radio networks.

Grafik Top
Authors
  • Foerster, Klaus-Tycho
  • Seidel, Jochen
  • Wattenhofer, Roger
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
28th International Symposium on Distributed Computing (DISC 2014)
Divisions
Communication Technologies
Subjects
Theoretische Informatik
Rechnerperipherie, Datenkommunikationshardware
Event Location
Austin, USA
Event Type
Conference
Event Dates
12-15 Oct 2014
Date
October 2014
Export
Grafik Top