移动中继协助下终端直通中面向能效的联合中继选择和资源分配方案

发布时间：2019-01-27 14:22

【摘要】：在移动中继协助下的终端直通(Device-to-Device,D2D)中,由于频带复用,D2D链路与已有蜂窝链路会产生同频干扰。另外,考虑到终端设备功率受限,该文提出一种联合功率控制、信道分配和移动中继选择方案最大化D2D链路总能量效率。原问题为分数规划问题,可转化为通过Dinkelbach算法求解的参数规划问题,此外,上述参数规划问题可进一步分解为功率控制子问题和联合优化信道分配与移动中继选择子问题。其中,功率控制子问题属于DC(Difference-of-Concave)规划问题,其一般意义下为NP-hard难题,可借助序列凸优化方法得到有效的近似解,基于上述结果,联合优化信道分配与移动中继选择子问题可转化为二分图中的最大匹配问题,继而借助匈牙利算法在多项式时间内求得最优解。通过仿真,验证了该方案在优化能量效率的效果。
[Abstract]:In mobile relay assisted terminal through (Device-to-Device,D2D), due to band multiplexing, the D2D link will have the same frequency interference with the existing cellular link. In addition, considering the limited power of terminal equipment, this paper proposes a joint power control, channel allocation and mobile relay selection scheme to maximize D2D link total energy efficiency. The original problem is a fractional programming problem, which can be transformed into a parameter planning problem solved by Dinkelbach algorithm. In addition, the above parameter planning problem can be further decomposed into a power control subproblem and a joint optimization channel assignment and mobile relay selection problem. Among them, the power control subproblem belongs to DC (Difference-of-Concave) programming problem, which is a NP-hard problem in general sense, and can obtain an effective approximate solution by means of sequential convex optimization method. The joint optimization of channel assignment and mobile relay selector problem can be transformed into the maximum matching problem in bipartite graphs, and then the optimal solution is obtained in polynomial time with the help of Hungarian algorithm. Simulation results show that the proposed scheme is effective in optimizing energy efficiency.
【作者单位】：西安交通大学电子与信息工程学院;西安交通大学软件学院;
【基金】：国家自然科学基金(61372092,61531013) 国家863计划(2014AA01A707) 江苏省自然科学基金(BK20141214) 教育部中国移动科研基金(MCM20150102)~~
【分类号】：TN929.5

【相似文献】