个人信息Personal Information
教授
博士生导师
硕士生导师
性别:男
毕业院校:天津大学
学位:博士
所在单位:信息与通信工程学院
学科:通信与信息系统. 信号与信息处理
办公地点:大连理工大学创新园大厦B510
联系方式:电子邮箱:whyu@dlut.edu.cn 办公电话:0411-84707675 移动电话:13842827170
电子邮箱:whyu@dlut.edu.cn
Instantly Decodable Network Coding for Multiple Unicast Retransmissions in Wireless Point-to-Multipoint Networks
点击次数:
论文类型:期刊论文
发表时间:2016-08-01
发表刊物:IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
收录刊物:SCIE、EI、Scopus
卷号:65
期号:8
页面范围:6232-6243
ISSN号:0018-9545
关键字:Completion delay; instantly decodable network coding (IDNC); intersession network coding (IRNC); packet retransmission; point-to-multipoint (PMP) networks
摘要:Instantly decodable network coding (IDNC) reduces the completion delay of packet retransmission for multicast services in wireless point-to-multipoint (PMP) networks. Compared with multicast services, multiple unicast services may be more common in PMP networks. Reducing completion delay using IDNC for multiple unicast services is still an open problem. According to the construction features of IDNC, we find that if some unicast retransmissions are combined as a retransmission group, IDNC benefits from network coding (NC) considerably, which increases retransmission efficiency. Based on this observation, we study the total completion delay of all these unicast transmissions with intersession NC. In this paper, we provide an intersession insight into the IDNC method. Specifically, we propose a framework that contains 1) a general solution to this minimum completion delay (MCD) problem, which is modeled as a bin-packing problem, and 2) a lower bound of completion delay for the MCD solution. Additionally, we provide a high-efficiency greedy algorithm to solve the MCD problem with low computational complexity. Simulation results demonstrate that the proposed method saves almost 43% retransmissions in PMP networks and makes 87.5% retransmission packets benefit from the NC transmission.