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
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
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
On Computing Ad-hoc Selective Families
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Z-MAC: a hybrid MAC for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 6th ACM conference on Embedded network sensor systems
Brief announcement: hardness of broadcasting in wireless networks with unreliable communication
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed cooperative MAC for multihop wireless networks
IEEE Communications Magazine
A MAC protocol for multi-packet ad-hoc wireless network utilizing multi-antenna
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Decomposing broadcast algorithms using abstract MAC layers
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Structuring unreliable radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
MAC design for analog network coding
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
MAC Essentials for Wireless Sensor Networks
IEEE Communications Surveys & Tutorials
Bounds on contention management in radio 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 |
The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied wireless network models: the classical model, in which links are reliable and collisions consistent, and the more recent dual graph model, which introduces unreliable edges. Our results prove that the Decay strategy, commonly used for local broadcast in the classical setting, is optimal. They also establish a separation between the two models, proving that the dual graph setting is strictly harder than the classical setting, with respect to this primitive.