An Ω(D log(N/D)) lower bound for broadcast in radio networks

DOI10.1145/164051.164059zbMath1373.68241OpenAlexW2002448548MaRDI QIDQ5365159

Yishay Mansour, Eyal Kushilevitz

Publication date: 29 September 2017

Published in: Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Related Items (5)

Upper and lower bounds for deterministic broadcast in powerline communication networks ⋮ Randomized broadcast in radio networks with collision detection ⋮ Lower bounds for the broadcast problem in mobile radio networks ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Bounded-contention coding for the additive network model

This page was built for publication: An Ω(D log(N/D)) lower bound for broadcast in radio networks