Low-Complexity Scheduling for Delay Minimization in D2D Communications Using Network Coding | IEEE Journals & Magazine | IEEE Xplore

Low-Complexity Scheduling for Delay Minimization in D2D Communications Using Network Coding


Abstract:

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 codin...Show More

Abstract:

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.
Published in: IEEE Communications Letters ( Volume: 25, Issue: 7, July 2021)
Page(s): 2430 - 2434
Date of Publication: 31 March 2021

ISSN Information:

Funding Agency:


References

References is not available for this document.