A Faster Distributed Radio Broadcast Primitive

DOI10.1145/2933057.2933121zbMath1373.68048OpenAlexW2501645718MaRDI QIDQ5361958

Bernhard Haeupler, David Wajc

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933057.2933121

zbMATH Keywords

decaybroadcastradio networks\(d\)-hop broadcast problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (5)

Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs ⋮ Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization ⋮ Deterministic Communication in Radio Networks ⋮ Unnamed Item

This page was built for publication: A Faster Distributed Radio Broadcast Primitive