Noisy beeping networks
From MaRDI portal
Publication:2105415
DOI10.1016/j.ic.2022.104925OpenAlexW4281651169MaRDI QIDQ2105415
Yagel Ashkenazi, Ran Gelles, Amir Leshem
Publication date: 8 December 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104925
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
- An optimal bit complexity randomized distributed MIS algorithm
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
- A lower bound for radio broadcast
- Design patterns in beeping algorithms: examples, emulation, and analysis
- Byzantine fireflies
- Leader election using loneliness detection
- Making asynchronous distributed computations robust to noise
- Reliable communication over highly connected noisy networks
- Global synchronization and consensus using beeps in a fault-prone multiple access channel
- Leader election in multi-hop radio networks
- Counting in one-hop beeping networks
- Beeping a maximal independent set
- A coding theorem for distributed computation
- Efficient Coding for Interactive Communication
- Interactive Coding for Multiparty Protocols
- A Biological Solution to a Fundamental Distributed Computing Problem
- Multiple Communication in Multihop Radio Networks
- Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
- Polynomial Codes Over Certain Finite Fields
- Finding parity in a simple broadcast network
- Deploying Wireless Networks with Beeps
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- The Adversarial Noise Threshold for Distributed Protocols
- Naming a Channel with Beeps
- Coding for Interactive Communication: A Survey
- Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions
- Multiparty Interactive Communication with Private Channels
- Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks
- Interactive coding over the noisy broadcast channel
- Fundamentals of Wireless Communication
- Broadcasting in Noisy Radio Networks
- Broadcasting algorithms in radio networks with unknown topology
- Class of constructive asymptotically good algebraic codes
- Near Optimal Leader Election in Multi-Hop Radio Networks
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Noisy Beeps
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Noisy beeping networks
