.png){kind=icon}
返回
Low-Complexity Scheduling for Delay Minimization in D2D Communications Using Network Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2021.3069941.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this letter, we consider the decoding delay minimizing problem for delivering a frame of packets to a set of user-devices (UDs) using instantly decodable network coding (IDNC). In the considered device-to-device (D2D) network, UDs have limited coverage zones that represent clusters and can speed up the delivery of the requested packets of other UDs by sending IDNC packets. The decoding delay minimization problem is a joint optimization problem of selecting the transmitting UDs and their coding decisions. In this work, we propose a low complexity, yet optimal, solution to the decoding delay minimization problem using graph pruning method. Our proposed innovative method introduces a sequential pruning algorithm that judiciously generates clusters that are certainly contributing to the network while simultaneously designing a new multi-layer IDNC graph. We also prove that the optimal solution to the problem can be achieved by the generated clusters by our proposed algorithm. Numerical results reveal that the proposed solution significantly reduces the computational complexity compared to the existing method with similar decoding delay performance.
Keyword:
Delays
Decoding
Device-to-device communication
Minimization
Optimization
Complexity theory
Clustering algorithms
Device-to-device networks
clustering
IDNC graph
maximum weight clique
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Decoding-Delay-Controlled Completion Time Reduction in Instantly Decodable Network Coding即时可解码网络编码中解码延迟控制的完成时间减少
OAAI
OAAI分享收藏Coalition Formation Game for Cooperative Content Delivery in Network Coding Assisted D2D Communications.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏 没有更多内容
没有更多内容