Chapter

Distributed Computing

Volume 8784 of the series Lecture Notes in Computer Science pp 212-226

Deterministic Leader Election in Multi-hop Beeping Networks

(Extended Abstract)
  • Klaus-Tycho FörsterAffiliated withComputer Engineering and Networks Laboratory, ETH Zurich
  • , Jochen SeidelAffiliated withComputer Engineering and Networks Laboratory, ETH Zurich
  • , Roger WattenhoferAffiliated withComputer Engineering and Networks Laboratory, ETH Zurich

* Final gross prices may vary according to local VAT.

Get Access

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.