NCOM: network coding based overlay multicast in wireless networks

被引:0
作者
Tan Le
Xing Chen
Yong Liu
机构
[1] Polytechnic Institute of New York University,Department of Electrical and Computer Engineering
来源
Wireless Networks | 2015年 / 21卷
关键词
Opportunistic routing; Multicast; Network coding ; Cross layer scheduling;
D O I
暂无
中图分类号
学科分类号
摘要
The capacities of wireless networks are increasingly challenged by the traffic stresses generated by data-intensive applications. Multicast is a bandwidth-efficient solution to simultaneously disseminate data to multiple receivers. In this paper, we present NCOM, a network coding based overlay multicast design, that integrates network coding (NC), opportunistic routing (OR), and cross-layer link scheduling to achieve high efficiency and reliability in multi-hop wireless multicast. In NCOM, the source and receivers are connected by an overlay Steiner tree optimized for the minimum OR distance between nodes. With NC, coded packets are opportunistically transmitted along overlay links. The transmissions of adjacent nodes in the overlay multicast are coordinated by a novel multicast acknowledgement scheme and cross-layer MAC scheduling. We implement NCOM in OPNET by customizing the IEEE 802.11b modules. Through OPNET simulations, we demonstrate that NCOM can achieve a higher throughput and lower source transmission redundancy than the existing NC and OR based wireless multicast designs. NCOM can be easily deployed for efficient and reliable multicast in multi-hop wireless networks.
引用
收藏
页码:187 / 199
页数:12
相关论文
共 13 条
[1]  
Ahlswede R(2000)Network information flow IEEE Transactions on Information Theory 46 1204-1216
[2]  
Cai N(2004)Simultaneous routing and resource allocation via dual decomposition IEEE Transactions on Communications 52 1136-1144
[3]  
Li S-YR(2006)Joint congestion control, routing, and mac for stability and fairness in wireless networks IEEE Journal on Selected Areas in Communications 24 1514-1524
[4]  
Yeung RW(2010)On distributed scheduling in wireless networks exploiting broadcast and network coding IEEE Transactions on Communications 58 1223-1234
[5]  
Xiao L(2000)A minimum spanning tree algorithm with inverse-ackermann type complexity Journal of the ACM (JACM) 47 1028-1047
[6]  
Johansson M(undefined)undefined undefined undefined undefined-undefined
[7]  
Boyd S(undefined)undefined undefined undefined undefined-undefined
[8]  
Eryilmaz A(undefined)undefined undefined undefined undefined-undefined
[9]  
Srikant R(undefined)undefined undefined undefined undefined-undefined
[10]  
Cui T(undefined)undefined undefined undefined undefined-undefined