A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
SIAM Journal on Computing
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Measurement-based models of delivery and interference in static wireless networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
An analysis of unreliability and asymmetry in low-power wireless links
ACM Transactions on Sensor Networks (TOSN)
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
High-throughput, reliable multicast without "crying babies" in wireless mesh networks
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Codecast: a network-coding-based ad hoc multicast protocol
IEEE Wireless Communications
Hi-index | 0.00 |
Broadcast is an important primitive in wireless mesh networks (WMNs). Applications like network-wide software update require reliable reception of the content with low-latency and high scalability (i.e., utilizing little bandwidth resource). In reality, the link layer broadcast transmission in WMNs is unreliable, which makes these goals hard to be attained at the same time. In this paper, we consider one-to-all broadcast scenarios and put forward R-Code, a reliable and efficient broadcast protocol based on intra-flow network coding. The key idea is to construct a minimum spanning tree as a backbone whose link weight is the expected number of transmissions on that link. The broadcast overhead and delay are simultaneously reduced by enabling the non-leaf nodes in the tree to move to the next batch of file segments as early as possible, while ensuring their downstream nodes reliably receive and correctly decode all the packets in the current batch. Opportunistic overhearing is utilized to further reduce the number of transmissions. Extensive simulation results show that our scheme always achieves 100% packet delivery ratio (PDR), while enjoying less broadcast overhead and much shorter delay than AdapCode, 14% and 50%, respectively.