Exactly optimal deterministic radio broadcasting with collision detection

DOI10.1007/978-3-031-09993-9_13OpenAlexW4285176329MaRDI QIDQ2097351

Koko Nanahji

Publication date: 11 November 2022

Full work available at URL: https://arxiv.org/abs/2202.06375

zbMATH Keywords

collision detectionencodingbroadcastradio networkdistributedbeep model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Uses Software

• OEIS

Cites Work

• Randomized broadcast in radio networks with collision detection
• A lower bound for radio broadcast
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Distributed broadcast in radio networks of unknown topology.
• Optimal deterministic broadcasting in known topology radio networks
• Asynchronous Broadcasting with Bivalent Beeps
• Fast broadcasting and gossiping in radio networks
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Deterministic Communication in Radio Networks
• Deterministic broadcasting in ad hoc radio networks
• The Energy Complexity of Broadcast
• Broadcasting algorithms in radio networks with unknown topology
• Near Optimal Leader Election in Multi-Hop Radio Networks
• Broadcasting in undirected ad hoc radio networks

This page was built for publication: Exactly optimal deterministic radio broadcasting with collision detection