A Faster Distributed Radio Broadcast Primitive

DOI10.1145/2933057.2933121MaRDI QIDQ5361958zbMATH OpenOpenAlexFDO

Authors 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

\(d\)-hop broadcast problembroadcastdecayradio networks

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1962806
• Faster Deterministic Broadcasting in Ad Hoc Radio Networks
• Faster deterministic communication in radio networks
• Faster deterministic communication in radio networks
• Faster broadcasting in unknown radio networks
• Distributed broadcast in radio networks of unknown topology.
• Distributed broadcast in unknown radio networks
• Time-efficient randomized multiple-message broadcast in radio networks
• Fast broadcasting and gossiping in radio networks
• Distributed multi-broadcast in unknown radio networks

Cited in

(6)

• Deterministic communication in radio networks
• Deterministic blind radio networks
• 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
• Brief announcement: Low-distortion clustering in bounded growth graphs

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

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