Proceedings Article10.1109/GLOCOM.2009.5426175
R-Code: Network Coding Based Reliable Broadcast in Wireless Mesh Networks with Unreliable Links
Zhenyu Yang,Ming Li,Wenjing Lou +2 more
- 30 Nov 2009
- pp 2168-2173
TL;DR: This paper considers one-to-all broadcast scenarios and puts forward R-Code, a reliable and efficient broadcast protocol based on intra-flow network coding that always achieves 100% packet delivery ratio (PDR), while enjoying less broadcast overhead and much shorter delay than AdapCode, 14% and 50%, respectively.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Survey of Network Coding and Its Applications
TL;DR: This survey summarizes the state-of-the-art research on network coding, mainly focusing on its applications to computer networking, and provides a taxonomy of network coding research, i.e., the network coding design problem and network coding applications.
85
A survey on network coding
TL;DR: This article presents a detailed investigation and comparison of current state-of-the-art protocols and algorithms for Network Coding in Cognitive Radio Networks (CRNs) and discusses five illustrative examples of network coding.
71
Network Coding Techniques for Wireless and Sensor Networks
Pouya Ostovari,Jie Wu,Abdallah Khreishah +2 more
- 01 Jan 2014
TL;DR: This chapter surveys the recent works on network coding in both general wireless networks and wireless sensor networks and presents various network coding techniques, their assumptions, applications, as well as an overview of the proposed methods.
GITAR: Generic extension for Internet-of-Things ARchitectures enabling dynamic updates of network and application modules
Peter Ruckebusch,Eli De Poorter,Carolina Fortuna,Ingrid Moerman +3 more
- 01 Jan 2016
TL;DR: GITAR is proposed, a generic extension for Internet-of-Things architectures that enables dynamic application and network level upgrades in an efficient way and can reuse existing Contiki network protocols for dynamic updates without requiring modifications to the code.
57
R-Code: Network coding-based reliable broadcast in wireless mesh networks
Zhenyu Yang,Ming Li,Wenjing Lou +2 more
- 01 Jul 2011
TL;DR: A guardian-ward relationship between neighboring nodes is introduced 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.
43
References
The broadcast storm problem in a mobile ad hoc network
Sze-Yao Ni,Yu-Chee Tseng,Yuh-Shyan Chen,Jang-Ping Sheu +3 more
- 01 Aug 1999
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
A high-throughput path metric for multi-hop wireless routing
Douglas S. J. De Couto,Daniel Aguayo,John Bicket,Robert Morris +3 more
- 14 Sep 2003
TL;DR: Measurements taken from a 29-node 802.11b test-bed demonstrate the poor performance of minimum hop-count, illustrate the causes of that poor performance, and confirm that ETX improves performance.
Understanding packet delivery performance in dense wireless sensor networks
Jerry Zhao,Ramesh Govindan +1 more
- 05 Nov 2003
TL;DR: This paper reports on a systematic medium-scale measurement of packet delivery in three different environments: an indoor office building, a habitat with moderate foliage, and an open parking lot, which has interesting implications for the design and evaluation of routing and medium-access protocols for sensor networks.
Comparison of broadcasting techniques for mobile ad hoc networks
Brad Williams,Tracy Camp +1 more
- 09 Jun 2002
TL;DR: This paper classifies existing broadcasting schemes into categories and simulating a subset of each, thus supplying a condensed but comprehensive side by side comparison, and proposes and implements protocol extensions using adaptive responses to network conditions that performs well in the comparative study.
1.4K
On the construction of energy-efficient broadcast and multicast trees in wireless networks
Jeffrey E. Wieselthier,Gam D. Nguyen,Anthony Ephremides +2 more
- 26 Mar 2000
TL;DR: This work develops the broadcast incremental power algorithm, and adapt it to multicast operation as well, and demonstrates that this algorithm provides better performance than algorithms that have been developed for the link-based, wired environment.
Related Papers (5)
Song Yean Cho,Cedric Adjih +1 more
- 01 Jan 2008
Salim El Rouayheb,Alex Sprintson,Parastoo Sadeghi +2 more
- 08 Jul 2010
Song Yean Cho,Cedric Adjih +1 more
- 25 Jun 2008