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

Authors:
Fabian Kuhn;Nancy Lynch;Calvin Newport
Affiliations:
MIT, Cambridge, MA, USA;MIT, Cambridge, MA, USA;MIT, Cambridge, MA, USA
Venue:
Proceedings of the 28th ACM symposium on Principles of distributed computing
Year:
2009

Citing 3
Cited 4

Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Experimental evaluation of wireless simulation assumptions

MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Ad hoc networks beyond unit disk graphs

Wireless Networks

Broadcasting in unreliable radio networks

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Structuring unreliable radio networks

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Bounds on contention management in radio networks

DISC'12 Proceedings of the 26th international conference on Distributed Computing
The cost of radio network broadcast for different models of unreliable links

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

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.