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

Uplink Resource Allocation in Device-to-Device Enabled Cellular Networks

作　　者：程永生[1] 朱江[1] 林孝康[1] 

机构地区：[1]清华大学电子工程系,北京100084

出　　处：《电子与信息学报》2014年第12期2822-2827,共6页Journal of Electronics & Information Technology

基　　金：清华-高通CDMA无线通信研究计划(20073000463)资助课题

摘　　要：该文研究了引入Device-to-Device(D2D)通信的蜂窝网系统中的上行资源分配问题。首先将该问题建模为一个简洁的二值整数规划问题。然而整数规划仍是NP难问题。该文利用Canonical对偶理论,得到其对偶形式。该对偶问题是一个连续域内的凸问题。证明了在特定的条件下,可以通过求解对偶问题得到原问题的最优解,且对偶间隙为零。提出了一个基于Barrier方法的算法来求解对偶问题。仿真结果表明,该文的算法优于现有算法,且性能接近最优。Uplink resource allocation in Device-to-Device （D2D） enabled cellular systems is studied. The sum-rate maximization problem is transformed into a concise Binary Integer Programming （BIP） problem, which is NP-hard Then based on the Canonical duality theory, a dual problem is obtained. The dual problem is a convex problem in a continuous domain. Under appropriate conditions, the dual method attains the global optimal solution of the primal problem with zero duality gap. An algorithm based on the Barrier method is proposed to solve the dual problem. Simulation results show that the proposed algorithm performs close to optimal and outperforms the existing algorithm.

关 键 词：D2D通信 资源分配 整数规划 Canonical对偶 

分 类 号：TN929.5[电子电信—通信与信息系统]