R-Code: Network coding-based reliable broadcast in wireless mesh networks

被引:21
作者
Yang, Zhenyu [1 ]
Li, Ming [1 ]
Lou, Wenjing [1 ]
机构
[1] Worcester Polytech Inst, Dept ECE, Worcester, MA 01609 USA
基金
美国国家科学基金会;
关键词
Wireless mesh networks; Network coding; Reliable broadcast;
D O I
10.1016/j.adhoc.2010.09.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:788 / 798
页数:11
相关论文
共 24 条
[1]  
[Anonymous], SIGCOMM COMPUT COMMU
[2]  
[Anonymous], INFOCOM 2008 APR
[3]  
[Anonymous], CCACK EFFICIENT NETW
[4]  
[Anonymous], 1 INT WORKSH INF THE
[5]  
[Anonymous], CONEXT
[6]  
[Anonymous], MOBICOM 03
[7]  
[Anonymous], MOBICOM 05
[8]  
[Anonymous], GLOBECOM 09
[9]  
[Anonymous], ACM SIGCOMM
[10]  
[Anonymous], IEEE T INFORM THEORY