引入d2d通信的蜂窝网上行资源分配算法uplink-电子与信息学报.pdfVIP

第 36 卷第 12 期 电 子 与 信 息 学 报 Vol.36No.12 2014 年 12 月 Journal of Electronics Information Technology Dec. 2014 引入D2D 通信的蜂窝网上行资源分配算法 程永生* 朱 江 林孝康 (清华大学电子工程系 北京 100084) 摘 要：该文研究了引入 Device-to-Device (D2D)通信的蜂窝网系统中的上行资源分配问题。首先将该问题建模为 一个简洁的二值整数规划问题。然而整数规划仍是 NP 难问题。该文利用 Canonical 对偶理论，得到其对偶形式。 该对偶问题是一个连续域内的凸问题。证明了在特定的条件下，可以通过求解对偶问题得到原问题的最优解，且对 偶间隙为零。提出了一个基于 Barrier 方法的算法来求解对偶问题。仿真结果表明，该文的算法优于现有算法，且 性能接近最优。 关键词：D2D 通信；资源分配；整数规划；Canonical 对偶 中图分类号： TN929.5 文献标识码： A 文章编号：1009-5896(2014)12-2822-06 DOI: 10.3724/SP.J.1146.2014.00056 Uplink Resource Allocation in Device-to-Device Enabled Cellular Networks Cheng Yong-sheng Zhu Jiang Lin Xiao-kang (Department of Electronic Engineering, Tsinghua University, Beijing 100084, China) Abstract: 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. Key words: Device-to-Device (D2D) communication; Resource allocation; Integer programming; Canonical duality 1 引言 复用。引入了 D2D 通信后，资源分配将与 LTE 系 在传统蜂窝网络中，通信数据都需要经过蜂窝