引入D2D通信的蜂窝网上行资源分配算法

发布时间：2018-07-05 01:51

本文选题：DD通信 + 资源分配　；参考：《电子与信息学报》2014年12期

【摘要】：该文研究了引入Device-to-Device(D2D)通信的蜂窝网系统中的上行资源分配问题。首先将该问题建模为一个简洁的二值整数规划问题。然而整数规划仍是NP难问题。该文利用Canonical对偶理论,得到其对偶形式。该对偶问题是一个连续域内的凸问题。证明了在特定的条件下,可以通过求解对偶问题得到原问题的最优解,且对偶间隙为零。提出了一个基于Barrier方法的算法来求解对偶问题。仿真结果表明,该文的算法优于现有算法,且性能接近最优。
[Abstract]:In this paper, the problem of uplink resource allocation in cellular networks with Device-to-Device (D2D) communication is studied. Firstly, the problem is modeled as a concise binary integer programming problem. However, integer programming is still a NP-hard problem. In this paper, the duality form of Canonical is obtained by using Canonical duality theory. The dual problem is a convex problem in a continuous domain. It is proved that under certain conditions, the optimal solution of the original problem can be obtained by solving the duality problem, and the duality gap is zero. An algorithm based on Barrier method is proposed to solve dual problems. Simulation results show that the proposed algorithm is superior to the existing algorithms and the performance is close to optimal.
【作者单位】：清华大学电子工程系;
【基金】：清华-高通CDMA无线通信研究计划(20073000463)资助课题
【分类号】：TN929.5

【共引文献】