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

D2D通信中的QoS-Aware联合模式选择和信道分配

QoS-Aware Joint Mode Selection and Channel Assignment for D2D Communications

Rui Wang, Jun Zhang, S. H. Song, K. B. Letaief

摘要:

蜂窝网络的底层设备到设备(D2D)通信被认为是提高5G网络中频谱效率的关键技术。对于这样的D2D系统,模式选择和资源分配已经被广泛用于管理干扰。然而,先前的工作允许最多一个D2D链路接入相同的信道,而模式选择和资源分配通常是分开设计的。在本文中,我们共同优化模式选择和信道分配在蜂窝网络与底层D2D通信,其中多个D2D链路可以共享相同的信道。同时,在信号与干扰加噪声比(SINR)方面,蜂窝和D2D链路两者的QoS要求得到保证。我们首先提出了一个最佳的动态规划(DP)算法,它提供了一个更低的计算复杂度相比,穷举搜索,并作为性能基准。然后提出了一种基于二分图的贪心算法,以达到多项式时间的复杂度。仿真结果将证明在密集D2D网络中允许每个信道被多个D2D链路访问的优点,以及所提出的算法的有效性。

英文摘要:

Underlaying device-to-device (D2D) communications to a cellular network is considered as a key technique to improve spectral efficiency in 5G networks. For such D2D systems, mode selection and resource allocation have been widely utilized for managing interference. However, previous works allowed at most one D2D link to access the same channel, while mode selection and resource allocation are typically separately designed. In this paper, we jointly optimize the mode selection and channel assignment in a cellular network with underlaying D2D communications, where multiple D2D links may share the same channel. Meanwhile, the QoS requirements for both cellular and D2D links are guaranteed, in terms of Signal-to-Interference-plus-Noise Ratio (SINR). We first propose an optimal dynamic programming (DP) algorithm, which provides a much lower computation complexity compared to exhaustive search and serves as the performance bench mark. A bipartite graph based greedy algorithm is then proposed to achieve a polynomial time complexity. Simulation results will demonstrate the advantage of allowing each channel to be accessed by multiple D2D links in dense D2D networks, as well as, the effectiveness of the proposed algorithms.

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

↑