D2D通信蜂窝网络中的比例公平与加权和速率最大化

针对终端直通（D2D）通信系统中用户的公平性问题，首先对现有的比例公平原则进行扩展，推导出一个与加权和速率有关的优化问题，然后提出了一个最大带权匹配比例公平（KMPF）资源分配算法对其进行优化。该算法通过功率控制最大化用户的加权和速率，并由最大带权匹配（KM）算法按照系统总的加权和速率最大原则为D2D用户分配可以复用的蜂窝用户资源。最后由仿真结果可得，该算法在使得系统公平指数相对于贪婪资源分配算法高出0.4的同时保证系统吞吐量达到其水平的95%以上，而相对于公平性较好的随机资源分配算法，该方案得到的系统吞吐量提高了约50%，说明该算法能在兼顾系统吞吐量的同时解决系统公平性问题。

Proportional fairness and maximum weighted sum-rate in D2D communications underlaying cellular networks

In order to solve the problem of user's fairness in D2D (Device-to-Device) communication system, firstly, the existing proportional fairness principle was extended to derive an optimization problem relating to weighted sum-rate, and then a KMPF (Kuhn-Munkras Proportional Fair) resource allocation algorithm was proposed to optimize it. The algorithm maximized the user's weighted sum-rate through power control, and allocated the cellular user's resources that could be reused for the D2D users according to maximization of the total weighted sum-rate by Kuhn-Munkras (KM) algorithm. Simulation results show that the fairness index of the proposed algorithm is 0.4 higher than that of the greedy resource allocation algorithm and the throughput of the system is over 95% of its level, and the throughput of proposed algorithm is about 50% higher than that of the random resource allocation algorithms. It is shown that the algorithm can solve the problem of user's fairness while considering the system throughput.