Log-based receiver-reliable multicast for distributed interactive simulation
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Scoped hybrid automatic repeat reQuest with forward error correction (SHARQFEC)
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Parity-based loss recovery for reliable multicast transmission
IEEE/ACM Transactions on Networking (TON)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Mitigating congestion in wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Network coding: an instant primer
ACM SIGCOMM Computer Communication Review
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
R-code: network coding based reliable broadcast in wireless mesh networks with unreliable links
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Codecast: a network-coding-based ad hoc multicast protocol
IEEE Wireless Communications
Hi-index | 0.00 |
Broadcast is an important communication primitive in wireless mesh networks (WMNs). Applications like network-wide software updates require reliable broadcast to ensure that every node in the network receives the information completely and correctly. With underlying unreliable wireless links, a key challenge in implementing reliable broadcast in WMNs is to achieve 100% information reception rate at every node with high communication efficiency and low latency. Recently, network coding has emerged as a promising coding scheme in terms of communication efficiency especially for one to many communication patterns. In this paper, we put forward R-Code, a network coding-based reliable broadcast protocol. We introduce a guardian-ward relationship between neighboring nodes that effectively distributes the responsibility of reliable information delivery - from the global responsibility of the source to the localized responsibilities of guardians to their corresponding wards. We use a link quality-based minimum spanning tree as a backbone to guide the selection of guardians adaptively and the transmission of coded packets accordingly. Opportunistic overhearing is also utilized to improve the performance of the protocol. Extensive simulation results show that R-Code achieves 100% packet delivery ratio (PDR), while enjoying significantly less transmission overhead and shorter broadcast latency, compared with a state-of-the-art reliable broadcast protocol, AdapCode.