Communicating with Beeps

The \emph{beep model} is a very weak communications model in which devices in a network can communicate only via beeps and silence. As a result of its weak assumptions, it has broad applicability to many different implementations of communications networks. This comes at the cost of a restrictive environment for algorithm design. Despite being only recently introduced, the beep model has received considerable attention, in part due to its relationship with other communication models such as that of ad-hoc radio networks. However, there has been no definitive published result for several fundamental tasks in the model. We aim to rectify this with our paper. We present algorithms and lower bounds for a variety of fundamental global communications tasks in the model.

[1]  Andrzej Pelc,et al.  Asynchronous Broadcasting with Bivalent Beeps , 2016, SIROCCO.

[2]  Roger Wattenhofer,et al.  Deterministic Leader Election in Multi-hop Beeping Networks - (Extended Abstract) , 2014, DISC.

[3]  Noga Alon,et al.  Beeping a Maximal Independent Set , 2011, DISC.

[4]  Marek Klonowski,et al.  Approximating the Size of a Radio Network in Beeping Model , 2016, SIROCCO.

[5]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.

[6]  Majid Khabbazian,et al.  Randomized broadcast in radio networks with collision detection , 2013, PODC '13.

[7]  Andrzej Pelc,et al.  Deterministic Broadcasting and Gossiping with Beeps , 2015, ArXiv.

[8]  Noga Alon,et al.  Beeping a maximal independent set , 2011, Distributed Computing.

[9]  Calvin C. Newport,et al.  The Computational Power of Beeps , 2015, DISC.

[10]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  Jiguo Yu,et al.  Minimum connected dominating set construction in wireless networks under the beeping model , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[12]  David Peleg,et al.  Time-Efficient Broadcasting in Radio Networks: A Review , 2007, ICDCIT.

[13]  Fabian Kuhn,et al.  Deploying Wireless Networks with Beeps , 2010, DISC.

[14]  Bogdan S. Chlebus,et al.  Naming a Channel with Beeps , 2016, Fundam. Informaticae.

[15]  Bernhard Haeupler,et al.  Near Optimal Leader Election in Multi-Hop Radio Networks , 2012, SODA.

[16]  Andrzej Pelc,et al.  Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC , 2016, ALGOSENSORS.