Deterministic Leader Election in Multi-hop Beeping Networks

(Extended Abstract)
  • Klaus-Tycho Förster
  • Jochen Seidel
  • Roger Wattenhofer
Conference paper

DOI: 10.1007/978-3-662-45174-8_15

Volume 8784 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Förster KT., Seidel J., Wattenhofer R. (2014) Deterministic Leader Election in Multi-hop Beeping Networks. In: Kuhn F. (eds) Distributed Computing. DISC 2014. Lecture Notes in Computer Science, vol 8784. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Klaus-Tycho Förster
    • 1
  • Jochen Seidel
    • 1
  • Roger Wattenhofer
    • 1
  1. 1.Computer Engineering and Networks LaboratoryETH ZurichZurichSwitzerland