期刊文献+

Efficient wireless multicast retransmission using network coding 被引量:2

Efficient wireless multicast retransmission using network coding
原文传递
导出
摘要 In wireless multicast, network coding has recently attracted attentions as a substantial improvement to packet retransmission schemes. However, the problem of finding the optimal network code which minimizes the retransmissions is hard to solve or approximate. This paper presents two schemes to reduce the number of retransmissions for reliable multicast efficiently. One is retransmission using network coding based on improved Vandermonde matrix (VRNC), the other is retransmission using network coding based on adaptive improved Vandermonde matrix (AVRNC). Using VRNC scheme the sender selects the packets all receivers have lost and encodes them with improved Vandermonde matrix; when receivers receive enough encoded retransmission packets, all the lost packets can be recovered. With AVRNC scheme, the sender can obtain the recovery information from all the receivers after sending out per retransmission packet, and then the improved Vandermonde matrix can be updated, thus reducing the complexity of encoding and decoding. Our proposed schemes can achieve the theoretical lower bound assuming retransmission packets lossless, and approach the theoretical lower bound considering retransmission packets loss. Simulation results show that the proposed algorithms can efficiently reduce the number ofretransmissions, thus improving transmission efficiency. In wireless multicast, network coding has recently attracted attentions as a substantial improvement to packet retransmission schemes. However, the problem of finding the optimal network code which minimizes the retransmissions is hard to solve or approximate. This paper presents two schemes to reduce the number of retransmissions for reliable multicast efficiently. One is retransmission using network coding based on improved Vandermonde matrix (VRNC), the other is retransmission using network coding based on adaptive improved Vandermonde matrix (AVRNC). Using VRNC scheme the sender selects the packets all receivers have lost and encodes them with improved Vandermonde matrix; when receivers receive enough encoded retransmission packets, all the lost packets can be recovered. With AVRNC scheme, the sender can obtain the recovery information from all the receivers after sending out per retransmission packet, and then the improved Vandermonde matrix can be updated, thus reducing the complexity of encoding and decoding. Our proposed schemes can achieve the theoretical lower bound assuming retransmission packets lossless, and approach the theoretical lower bound considering retransmission packets loss. Simulation results show that the proposed algorithms can efficiently reduce the number ofretransmissions, thus improving transmission efficiency.
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2011年第6期59-67,88,共10页 中国邮电高校学报(英文版)
基金 supported by the Canada-China Scientific and Technological Cooperation (2010DFA11320) the Fundamental Research Funds for the Central Universities (G470209, 2009RC0308) the National Natural Science Foundation of China (60802033, 60873190) the Important National Science and Technology Specific Projects (2010ZX03007-003-04, 2010ZX03005-001-03)
关键词 reliable multicast network coding (NC) RETRANSMISSION improved Vandermonde matrix reliable multicast, network coding (NC), retransmission, improved Vandermonde matrix
  • 相关文献

参考文献13

  • 1Nguyen D, Tran T, Nguyen T, et al. Wireless broadcasting using network coding. IEEE Transactions on Vehicular Technology, 2009, 58(2): 914-925.
  • 2Tran T, Nguyen T, Bose B. A joint network-channel coding technique for single-hop wireless networks. Proceedings of the 4th Workshop on Network Coding, Theory, and Applications (NetCod'08), Jan 3-4, 2008, Hong Kong, China. Los Alamitos, CA, USA: IEEE Computer Society 2008: 6p.
  • 3Dong Q, Wu J, Hu W, et al. Practical network coding in wireless networks. Proceedings of the 13th Annual International Conference on Mobile Computing and Networking (MobiCom'07), Sep 9-14, 2007, Montr6al, Canada. New York, NY, USA: ACM, 2007:306-309.
  • 4Langberg M, Sprintson A. On the hardness of approximating the network coding capacity. Proceedings of the IEEE International Symposium on Information Theory (ISIT'08), Jul 6-11, 2008, Toronto, Canada. Piscataway, NJ, USA: IEEE, 2008:315-319.
  • 5Ho T, Medard M, Koetter R, et al. A random linear network coding approach to multicast. IEEE Transactions on Information Theory, 2006, 52(10): 4413-4430.
  • 6Jin J, Li B, Kong T. Is random network coding helpful in WIMAX?. Proceedings of the 27th IEEE International Conference on Computer Communications (1NFOCOM'08), Apr 13-18, 2008, Phoenix, AZ, USA. Piscataway, NJ, USA: IEEE, 2008:2162-2170.
  • 7Wu H, Zheng J. Network coding based multicast retransmission for mobile communication networks. Proceedings of the 12th Intemational Conference on Communication Technology (ICCT'10), Nov 11-14, 2010, Nanjing, China. Piscataway, NJ, USA: IEEE, 2011 : 235-238.
  • 8Li Z Q, Luo Q L, Featherstone W. N-in-1 retransmission with network coding. IEEE Transactions on Wireless Communications, 2010, 9(9): 2689-2694.
  • 9Zhan C, Xu Y L, Wang J P, et al. Reliable multicast in wireless networks using network coding. Proceedings of the 6th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS'09), Oct 9-15, 2009, Macao, China. Piscataway, N J, USA: IEEE, 2009:506-515.
  • 10Xiao X, Yang L M, Wang W P, et al. A broadcasting retransmission approach based on random linear network coding. Proceedings of the 9th International Conference for Yong Computer Scientists (ICYCS'08), Nov 18-21, 2008, Zhangjiajie, China. Los Alamitos, CA, USA: IEEE Computer Society, 2008:457-461.

同被引文献10

  • 1CHACHULSKI S, JENNINGS M, KATrI S, et al. Trading structure for randomness in wireless opportunistic routing[ J ]. Computer Communication Review, 2007, 37 (4) :169-180.
  • 2SHAH MANSOURI H, PAKRAVAN M R. Network cod- ing based reliable broadcasting in wireless ad-hoe net- works [ C ]//IEEE. 15th IEEE International Conference on Networks. Adelaide, IEEE Press : 2007 : 525-530.
  • 3AHLSWEDE R, CAI N, LI S Y R, et al. Network infor- mation flow [ J ]. IEEE Transactions on Information Theo- ry, 2000, 46(4): 1204-1216.
  • 4KOETrER R, MEDARD M. An algebraic approach to net- work coding [ J ]. IEEE Transactions on Networking, 2003, 11(5) : 782-795.
  • 5BENFATI'OUM Y, MARTIN S, AGHA K A. QoS for re- al-time reliable muhicasting in wireless multi-hop net- works using a Generation-Based Network Coding [ J ]. Computer Networks, 2013, 57(6): 1488-1502.
  • 6TANG D, LU X, LI J. Multicast routing algorithm based on network coding [ M ]. Berlin Heidelberg: Springer, 2013 : 348-357.
  • 7CHI K, JIANG X, ZHU Y, et al. Block-level packet re- covery with network coding for wireless reliable multieast [J]. Computer Networks, 2013, 57(4) : 910-923.
  • 8ROYER E M. Muhicast operation cff the Ad-hoc On-De- mand Distance Vector Routing Protocol [ C ]//ACM. Pro- ceedings of the Annual International Conference on Mo- bile Computing and Networking. Seattle: ACM Press, 1999:207- 218.
  • 9卢冀,肖嵩,吴成柯.一种基于机会式网络编码的高效广播重传方法[J].电子与信息学报,2011,33(4):858-863. 被引量:10
  • 10文瑞涵,冯钢.基于网络编码的多跳无线网络可靠组播[J].电子与信息学报,2012,34(11):2721-2727. 被引量:4

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部