Communicating with beeps
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(16)- Design patterns in beeping algorithms: examples, emulation, and analysis
- The computational power of beeps
- Byzantine fireflies
- Noisy beeping networks
- Fast size approximation of a radio network in beeping model
- Optimal multi-broadcast with beeps using group testing
- Leader election in multi-hop radio networks
- Counting in one-hop beeping networks
- Asynchronous broadcasting with bivalent beeps
- Approximating the size of a radio network in beeping model
- Design patterns in beeping algorithms
- scientific article; zbMATH DE number 5353792 (Why is no real title available?)
- Naming a channel with beeps
- Beeping a deterministic time-optimal leader election
- Brief Announcement: Noisy Beeping Networks
- Generalising the maximum independent set algorithm via Boolean networks
This page was built for publication: Communicating with beeps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363821)
