Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication
Name
Lynch_Hardness of Broadcasting.pdf
Size
129.92 KB
Format
Adobe PDF
Checksum (MD5)
a5567d661b3b1e5b2dc344a5bb37d69b
Author(s)
Newport, Calvin Charles
Kuhn, Fabian
Lynch, Nancy A.
Date Issued
2009
Journal
Proceedings of the 28th ACM Symposium on Principles of Distributed Computing
Publisher
Association for Computing Machinery
Citation
Kuhn, Fabian, Nancy Lynch, and Calvin Newport. “Brief announcement: hardness of broadcasting in wireless networks with unreliable communication.” Proceedings of the 28th ACM symposium on Principles of distributed computing. Calgary, AB, Canada: ACM, 2009. 330-331.
Version
Author's final manuscript
Abstract
We prove two broadcast lower bounds for a wireless network model that includes unreliable links. For deterministic algorithms, we show n − 1 rounds are required, where n is the number of processes. For randomized algorithms, ε(n − 1) rounds are required for success probability ε. In both cases, the bounds are proved for a network in which constant-time broadcast is possible.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1145/1582716.1582794
