黄玉蕾, 唐睿, 罗晓霞, 刘笃仁, 焦纯. LTE-A蜂窝网络下设备直通中的联合信道分配和功率控制方案[J]. 信息与控制, 2017, 46(2): 231-237, 256. DOI: 10.13976/j.cnki.xk.2017.0231
引用本文: 黄玉蕾, 唐睿, 罗晓霞, 刘笃仁, 焦纯. LTE-A蜂窝网络下设备直通中的联合信道分配和功率控制方案[J]. 信息与控制, 2017, 46(2): 231-237, 256. DOI: 10.13976/j.cnki.xk.2017.0231
HUANG Yulei, TANG Rui, LUO Xiaoxia, LIU Duren, JIAO Chun. Joint Channel Assignment and Power Control Scheme for D2D Communication Underlying LTE-A Cellular Networks[J]. INFORMATION AND CONTROL, 2017, 46(2): 231-237, 256. DOI: 10.13976/j.cnki.xk.2017.0231
Citation: HUANG Yulei, TANG Rui, LUO Xiaoxia, LIU Duren, JIAO Chun. Joint Channel Assignment and Power Control Scheme for D2D Communication Underlying LTE-A Cellular Networks[J]. INFORMATION AND CONTROL, 2017, 46(2): 231-237, 256. DOI: 10.13976/j.cnki.xk.2017.0231

LTE-A蜂窝网络下设备直通中的联合信道分配和功率控制方案

Joint Channel Assignment and Power Control Scheme for D2D Communication Underlying LTE-A Cellular Networks

  • 摘要: 针对在LTE-A(long-term evolution-advanced)上行蜂窝链路与设备直通(device-to-device,D2D)链路间的同频干扰问题,联合功率控制和信道分配最大化系统频带利用率,同时保证已有蜂窝链路的服务质量需求.此外模型中假设单条D2D链路容许复用多条连续的信道资源.考虑到原问题的复杂性,将其分解为功率控制和信道分配两部分:其中,功率控制部分可借助凸优化分析,而在上述最优解的基础上,信道分配部分等价于经典的集合划分问题,一般意义下为NP-hard(non-deterministic polynomial-time hard)难题,继而设计了一种多项式时间复杂度的贪婪算法来实现性能与复杂度之间的折中.仿真结果表明,所提联合资源优化方案优于单一资源优化方案以及单D2D链路仅能复用单信道的联合资源优化方案,而且其性能接近由分支界限法得到的全局最优解.

     

    Abstract: To cope with co-channel interference between existing long-term evolution-advanced (LTE-A) uplink cellular links and device-to-device (D2D) links, power control and channel assignment are jointly considered to optimize spectral efficiency under the quality-of-service requirement of prioritized cellular links. Each D2D link can reuse multiple continuous channels. Given the complexity of the original problem, we decompose it into two sub-problems:power control and channel assignment. The design of power control can be analyzed via convex optimization, and on the basis of the above optimum, the design of channel assignment is the classic set partitioning problem, which is generally an NP-hard problem. Thus, a greedy algorithm with polynomial-time complexity is proposed to achieve a balance between performance and complexity. Simulation results show that the proposed joint resource allocation scheme outperforms those with a single resource variable and also those where multi-channel reuse is not enabled. Moreover, the performance of the proposed scheme is close to the global optimum derived by the branch-and-bound method.

     

/

返回文章
返回