中国邮电高校学报(英文) ›› 2011, Vol. 18 ›› Issue (6): 59-67.doi: 10.1016/S1005-8885(10)60123-9

• Networks • 上一篇    下一篇

Efficient wireless multicast retransmission using network coding

曹震1,唐碧华2,刘元安1,谢刚2, LIU Fang, DENG Pan-liang   

  1. School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • 收稿日期:2011-04-15 修回日期:2011-07-22 出版日期:2011-12-31 发布日期:2011-12-30
  • 通讯作者: 曹震 E-mail:caozhen@bupt.edu.cn
  • 基金资助:

    This work was 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), and the Important National Science and Technology Specific Projects (2010ZX03007-003-04, 2010ZX03005-001-03).

Efficient wireless multicast retransmission using network coding

  1. School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2011-04-15 Revised:2011-07-22 Online:2011-12-31 Published:2011-12-30
  • Contact: cao zhen E-mail:caozhen@bupt.edu.cn
  • Supported by:

    This work was 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), and the Important National Science and Technology Specific Projects (2010ZX03007-003-04, 2010ZX03005-001-03).

摘要:

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 of retransmissions, thus improving transmission efficiency.

关键词:

reliable multicast, network coding (NC), retransmission, improved Vandermonde matrix

Abstract:

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 of retransmissions, thus improving transmission efficiency.

Key words:

reliable multicast, network coding (NC), retransmission, improved Vandermonde matrix