基于二分图的D2D通信资源复用分配算法

为了提升D2D（Device to Device）通信资源复用分配的频谱效率，本文以最大化系统吞吐率为目标建立资源复用模型。同时面对高复杂度的组合优化求解过程，提出一种分布式的资源分配迭代算法，该算法使用二分图建立D2D用户与RB（Resource Block）资源的关系模型。每轮资源分配中，D2D用户根据所在RB资源上的动态干扰环境，自治的竞争RB资源，基站则根据吞吐率增益选举最优的D2D用户分配，避免多对一的RB竞争冲突。仿真实验表明，二分图算法在降低算法复杂度的同时，拥有较优的吞吐率性能优势。

Resource allocation algorithm in D2D cellular network based on bipartite graph

In order to improve the spectral efficiency of D2D (Device to Device) communication resource allocation, this paper deduced a resource sharing model with the objective to maximize the throughput of the system. Then a distributed resource allocation algorithm was proposed to handle the solution process for the high complexity of mode. In this algorithm, we use bipartite graph model to establish the relations between RB (Resource Block) and D2D users. D2D users choose RB competing goals independently according to the dynamic interference environment, while the base station executing a optimal election among D2D multiplexed users based on throughput gain, so as to avoid RB selection conflict. Simulation results show that the bipartite graph algorithm has a optimum throughput performance advantages, also effectively alleviate the high complexity of the calculation