Opportunistic network coding based cooperative retransmissions in D2D communications

详细信息    查看全文

• 作者：Yan Yan^aAuthor Vitae ; Baoxian Zhang^aAuthor Vitae ; Cheng Li^b ; ^{licheng@mun.ca}Author Vitae
• 关键词：Network coding ; D2D ; Cooperative communications
• 刊名：Computer Networks
• 出版年：2017
• 出版时间：11 February 2017
• 年：2017
• 卷：113
• 期：Complete
• 页码：72-83
• 全文大小：1794 K
• 卷排序：113

文摘

Device-to-Device (D2D) communications can improve the performance of the next generation cellular networks by facilitating the transmission of cellular traffic without additional infrastructure. In D2D communications, cooperative retransmission can be employed to assist the recovery of lost packets at proximity devices by sending coded packets. However, most existing work did not consider the issue of how the transmissions among neighbor devices can be well scheduled to support efficient network coding based retransmissions. Decoupling transmission scheduling from coding decision making can lead to inefficient D2D packet retransmissions and thus reduced overall network performance. In this paper, we study how to use opportunistic network coding based transmission scheduling to assist the cooperative packet recovery in D2D environment. For this purpose, we first formulate the problem of jointly optimization of transmitting device selection and also their coding patterns as minimum latency scheduling problem, which is known to be NP-hard. We further present a low complexity centralized algorithm and a distributed mechanism that does not require synchronization (either global or local) among devices. We derive the complexity of the proposed algorithms. Simulation results show that the performance of centralized algorithm is very close to the theoretical lower bounds and the distributed mechanism can achieve high performance in accelerating packet recovery.