计算机工程2019，Vol.45Issue(2)：26-31,6.DOI:10.19678/j.issn.1000-3428.0051100
基于图着色的密集D2D网络资源分配算法
Resource Allocation Algorithm for Dense D2D Network Based on Graph Coloring
摘要
Abstract
The cellular Device-to-Device (D2D) network can greatly improve the spectral efficiency of networks by the upstream links multiplexing between D2D users and cellular users. However, when the number of D2D users is greater than the number of cellular users, in D2D dense deployment scenario, traditional resource multiplexing algorithm cannot meet the spectrum resources demand of D2D users. Aiming at this problem, a spectrum resource allocation algorithm based on graph coloring theory for D2D network interference coordination is proposed to realize multiple multiplexing of channel resources among multiple D2D user pairs, thereby improving network load capacity and improving network throughput. On the basis of this, an improved resource allocation algorithm is proposed to improve the fairness of D2D users. Simulation results show that the algorithm can reduce the"hungery"probability of D2D users for obtaining channel resources the spatial multiplexing ratio and the network throughput.关键词
蜂窝设备到设备网络/干扰协调/资源分配/图论着色/吞吐量/接入率Key words
cellular Device-to-Device (D2D) network/interference coordination/resource allocation/graph coloring/throughput/access rate分类
信息技术与安全科学引用本文复制引用
孙彦赞,范卫蓉,张舜卿,王涛,吴雅婷..基于图着色的密集D2D网络资源分配算法[J].计算机工程,2019,45(2):26-31,6.基金项目
国家自然科学基金 (61501289, 61701293, 61420106011, 61671011). （61501289, 61701293, 61420106011, 61671011）
