PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A lower bound for radio broadcast
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Coping with communication gray zones in IEEE 802.11b based ad hoc networks
WOWMOM '02 Proceedings of the 5th ACM international workshop on Wireless mobile multimedia
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Implementation experience with MANET routing protocols
ACM SIGCOMM Computer Communication Review
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
A high-throughput path metric for multi-hop wireless routing
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
Theoretical Computer Science - Foundations of software science and computation structures
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Time-Efficient Broadcasting in Radio Networks
DISC '07 Proceedings of the 21st international symposium on Distributed Computing
Centralized Communication in Radio Networks with Strong Interference
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
Efficient broadcasting in known topology radio networks with long-range interference
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: hardness of broadcasting in wireless networks with unreliable communication
Proceedings of the 28th ACM symposium on Principles of distributed computing
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The capacity of wireless networks
IEEE Transactions on Information Theory
Trusted computing for fault-prone wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Dynamic networks: models and algorithms
ACM SIGACT News
Structuring unreliable radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Lower bounds on information dissemination in dynamic networks
DISC'12 Proceedings of the 26th international conference on 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
Hi-index | 0.00 |
Practitioners agree that unreliable links, which sometimes deliver messages and sometime do not, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set of links and assume that these links are reliable. This gap between theory and practice motivates us to investigate how unreliable links affect theoretical bounds on broadcast in radio networks. To that end we consider a model that includes two types of links: reliable links, which always deliver messages, and unreliable links, which sometimes fail to deliver messages. We assume that the reliable links induce a connected graph, and that unreliable links are controlled by a worst-case adversary. In the new model we show an Ω(n log n) lower bound on deterministic broadcast in undirected graphs, even when all processes are initially awake and have collision detection, and an Ω(n) lower bound on randomized broadcast in undirected networks of constant diameter. This separates the new model from the classical, reliable model. On the positive side, we give two algorithms that tolerate unreliability: an O(n3/2 √log n)-time deterministic algorithm and a randomized algorithm which terminates in O(n log2 n) rounds with high probability.