Noisy beeping networks

DOI10.1016/J.IC.2022.104925OpenAlexW4281651169MaRDI QIDQ2105415FDOQ2105415

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

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

zbMATH Keywords

fault-tolerant distributed computingcomputation with noisebeeping networks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

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)