Noisy Beeps

Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations


We study the effect of noise on the n-party beeping model. In this model, in every round, each party may decide to either 'beep' or not. All parties hear a beep if and only if at least one party beeps. The beeping model is becoming increasingly popular, as it offers a very simple abstraction of wireless networks and is very well suited for studying biological phenomena. Still, the noise resilience of the beeping model is yet to be understood. Our main result is a lower bound, showing that making protocols in the beeping model resilient to noise may have a large performance overhead. Specifically, we give a protocol that works over the (noiseless) beeping model, and prove that any scheme that simulates this protocol over the beeping model with correlated stochastic noise will blow up the number of rounds by an Ω(log n) multiplicative factor. We complement this result by a matching upper bound, constructing a noise-resilient simulation scheme with O(log n) overhead for any noiseless beeping protocol.

Original languageEnglish
Title of host publicationPODC 2020 - Proceedings of the 39th Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Number of pages10
ISBN (Electronic)9781450375825
StatePublished - 31 Jul 2020
Event39th Symposium on Principles of Distributed Computing, PODC 2020 - Virtual, Online, Italy
Duration: 3 Aug 20207 Aug 2020

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing


Conference39th Symposium on Principles of Distributed Computing, PODC 2020
CityVirtual, Online


  • beeping models
  • communication complexity
  • distributed systems
  • error-correcting codes
  • interactive coding
  • lower bounds

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Noisy Beeps'. Together they form a unique fingerprint.

Cite this