Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication

Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication

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...

Full description

Bibliographic Details
Main Authors: Newport, Calvin Charles (Contributor), Kuhn, Fabian (Contributor), Lynch, Nancy Ann (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery, 2010-01-28T15:26:37Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items