Interference Graph-Based Resource Allocation (InGRA) for D2D Communications Underlaying Cellular Networks

Interference Graph-Based Resource Allocation (InGRA) for D2D Communications Underlaying Cellular Networks
复制标题

DOI:
10.1109/tvt.2014.2356198
复制
发表时间:
2015-08
影响因子:
6.8
通讯作者:
Rongqing Zhang;Xiang Cheng;Liuqing Yang;B. Jiao
Rongqing Zhang;Xiang Cheng;Liuqing Yang;B. Jiao
中科院分区:
计算机科学2区
文献类型:
--
作者:
Rongqing Zhang;Xiang Cheng;Liuqing Yang;B. Jiao

文献摘要

被引文献

相似文献

作为蜂窝网络基础的设备到设备(D2D)通信最近被认为是增强蜂窝网络的资源利用和彼此邻近的设备之间的本地用户吞吐量的有前景的手段。在本文中,我们研究联合资源块分配和发射功率分配问题,以优化网络性能在这样的情况下。具体而言,我们建模不同的D2D和蜂窝通信链路之间的干扰关系作为一种新的干扰图具有独特的属性,并提出了相应的联合资源分配方案,可以有效地导致在基站的一个接近最优的解决方案,具有较低的计算复杂度。仿真结果证实,与显着降低的复杂性,我们提出的方案实现了网络吞吐量,接近通过穷举搜索获得的最佳资源共享方案对应的一个。
Device-to-device (D2D) communications underlaying cellular networks have been recently considered as a promising means to enhance resource utilization of the cellular network and local user throughput among devices in proximity to each other. In this paper, we investigate the joint resource block assignment and transmit power allocation problem to optimize the network performance in such a scenario. Specifically, we model the interference relationships among different D2D and cellular communication links as a novel interference graph with unique attributes and propose a corresponding joint resource-allocation scheme that can effectively lead to a near-optimal solution at the base station, with low computational complexity. Simulation results confirm that, with markedly reduced complexity, our proposed scheme achieves a network throughput that approaches the one corresponding to the optimal resource-sharing scheme obtained via exhaustive search.