Noisy beeping networks

DOI10.1016/J.IC.2022.104925MaRDI QIDQ2105415zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

fault-tolerant distributed computingcomputation with noisebeeping networks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Brief Announcement: Noisy Beeping Networks
• Design patterns in beeping algorithms
• Communicating with beeps
• Design patterns in beeping algorithms: examples, emulation, and analysis
• Counting in one-hop beeping networks

Cites work

• scientific article; zbMATH DE number 3133919 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A biological solution to a fundamental distributed computing problem
• A coding theorem for distributed computation
• A lower bound for radio broadcast
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• An optimal bit complexity randomized distributed MIS algorithm
• Beeping a deterministic time-optimal leader election
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in noisy radio networks
• Broadcasting in undirected ad hoc radio networks
• Byzantine fireflies
• Class of constructive asymptotically good algebraic codes
• Coding for interactive communication: a survey
• Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
• Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks
• Counting in one-hop beeping networks
• Deploying wireless networks with beeps
• Design patterns in beeping algorithms: examples, emulation, and analysis
• Efficient Coding for Interactive Communication
• Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions
• Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
• Erasure correction for noisy radio networks
• Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
• Finding parity in a simple broadcast network
• Fundamentals of Wireless Communication
• Global synchronization and consensus using beeps in a fault-prone multiple access channel
• Interactive coding for multiparty protocols
• Interactive coding over the noisy broadcast channel
• Leader election in multi-hop radio networks
• Leader election using loneliness detection
• Making asynchronous distributed computations robust to noise
• Multiparty Interactive Communication with Private Channels
• Multiple Communication in Multihop Radio Networks
• Naming a channel with beeps
• Near optimal leader election in multi-hop radio networks
• Noisy Beeps
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• Polynomial Codes Over Certain Finite Fields
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Reliable communication over highly connected noisy networks
• The adversarial noise threshold for distributed protocols

This page was built for publication: Noisy beeping networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105415)