Traditional studies on Instantly Decodable Network Coding (IDNC) focus on optimizing IDNC metrics, i.e., completion time or decoding delay, in broadcast scenarios in which all user-devices (UDs) want the same files. The problem of joint optimization over two interdependent parameters, i.e., transmitting user-devices (UDs) and IDNC was traditionally tackled by finding the set of feasible cooperation between UDs. This, however, requires high computational complexity, which is not feasible. This work, instead, develops low complexity, yet optimal, solution to the problem using graph theory in practical multicast scenarios where UDs are interested in different subsets of files. Specifically, the proposed method studies the condition for generating important UDs’ feasible cooperation that can minimize the IDNC metric under investigation while considering the effect of unwanted files on the performance of IDNC schemes for multicast sessions. Numerical results show that the proposed method outperforms the benchmark method in terms of completion time and decoding delay with significant reduction in the computational complexity.

中文翻译：

---

使用网络编码的 D2D 辅助 F-RAN 的低复杂度组播调度


关于即时可解码网络编码 (IDNC) 的传统研究重点是在所有用户设备 (UD) 都需要相同文件的广播场景中优化 IDNC 指标，即完成时间或解码延迟。两个相互依赖的参数（即传输用户设备（UD）和 IDNC）的联合优化问题传统上是通过寻找 UD 之间的可行合作集来解决的。然而，这需要较高的计算复杂度，这是不可行的。相反，这项工作在 UD 对不同文件子集感兴趣的实际多播场景中使用图论开发了低复杂性但最佳的问题解决方案。具体来说，所提出的方法研究了生成重要UD的可行合作的条件，该合作可以最小化正在研究的IDNC度量，同时考虑不需要的文件对多播会话的IDNC方案的性能的影响。数值结果表明，该方法在完成时间和解码延迟方面优于基准方法，并且计算复杂度显着降低。