arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.11606cs.NI
收藏

通过联合D2D和蜂窝通信的分组完成时间最小化:统一的网络编码方法

Packet Completion Time Minimization via Joint D2D and Cellular Communication: A Unified Network Coding Approach

Juwendo Denis, Hulya Seferoglu

摘要:

本文解决了通过即时可解码网络编码(IDNC)的帮助下,间歇连接的D2 D链路的一个共同的内容发送到多个蜂窝用户的问题。特别感兴趣的是广播实时应用,例如视频点播,其中由于蜂窝链路上的分组擦除,蜂窝用户可能部分地接收到公共内容。具体来说,我们调查的问题,数据包完成时间,定义为传输时隙的数量,必须提供一个共同的内容给所有用户。借鉴图论,我们开发了一个最佳的数据包完成时间策略,通过构建一个两层的IDNC冲突图。较高层图允许我们确定可以通过蜂窝链路发送的所有可行的分组组合,而较低层图使我们能够找到所有可行的网络编码分组并识别可以生成并经由间歇连接的D2 D链路发送这些分组的用户集合。通过结合高层和低层的IDNC冲突图,我们证明,找到最佳的IDNC数据包,以最小化数据包完成时间的问题是等价于找到最大的独立集的两层IDNC冲突图,这是已知的NP-难问题。我们设计了一个方案,调用Bron-Kerbosch算法来找到最优策略。为了避免达到全局最优所需的高计算复杂性,我们建立了一个多项式时间可解的低复杂性启发式算法来找到一个有效的次优解。我们所提出的计划的有效性进行了验证,通过大量的数值结果表明,与现有的方法相比,性能大幅改善。

英文摘要:

This paper tackles the problem of transmitting a common content to a number of cellular users by means of instantly decodable network coding (IDNC) with the help of intermittently connected D2D links. Of particular interest are broadcasting real-time applications such as video-on-demand, where common contents may be partially received by cellular users due to packet erasures over cellular links. Specifically, we investigate the problem of packet completion time, defined as the number of transmission slots necessary to deliver a common content to all users. Drawing on graph theory, we develop an optimal packet completion time strategy by constructing a two-layer IDNC conflict graph. The higher-layer graph permits us to determine all feasible packet combinations that can be transmitted over the cellular link, while the lower-layer graph enables us to find all feasible network coded packets and identify the set of users that can generate and transmit these packets via intermittently connected D2D links. By combining the higher-layer and the lower-layer IDNC conflict graphs, we demonstrate that finding the optimal IDNC packets to minimize the packet completion time problem is equivalent to finding the maximum independent set of the two-layer IDNC conflict graph, which is known to be an NP-hard problem. We design a scheme that invokes the Bron-Kerbosch algorithm to find the optimal policy. To circumvent the high computational complexity required to reach the global optimum, we establish a polynomial-time solvable low-complexity heuristic to find an efficient sub-optimal solution. The effectiveness of our proposed scheme is verified through extensive numerical results which indicate substantial performance improvement in comparison with existing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑