The cost of radio network broadcast for different models of unreliable links

DOI10.1145/2484239.2484259zbMath1323.68013OpenAlexW2127629521MaRDI QIDQ5176113

Mohsen Ghaffari, Calvin Newport, Nancy A. Lynch

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

broadcastradio networkdual graphunreliability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (7)

Upper and lower bounds for deterministic broadcast in powerline communication networks ⋮ Some lower bounds in dynamic networks with oblivious adversaries ⋮ Broadcasting in an Unreliable SINR Model. ⋮ Unnamed Item ⋮ Smoothed analysis of dynamic networks ⋮ The cost of global broadcast in dynamic radio networks ⋮ On simple back-off in unreliable radio networks

This page was built for publication: The cost of radio network broadcast for different models of unreliable links