移动中继协助下终端直通中的 模式选择和资源分配方案
Two Mode Selection and Resource Allocation Schedules for Device-to-Device Communication with Mobile Relay Assistance

针对移动中继(MR)协助下终端直通(D2D)链路与传统蜂窝链路之间的同频干扰问题,在MR是、否可被多条D2D链路复用的条件下,分别提出了2种联合模式选择和资源分配减小系统干扰的方案。在MR可被多条D2D链路复用的方案(方案1)中,通过干扰模型构建的优化问题等价于二分图中的最大匹配问题,继而可以借助匈牙利算法在多项式时间内得到最优解;在MR不可被多条D2D链路复用方案(方案2)中,通过干扰模型构建的优化问题等价于三维匹配问题,一般意义下属于NP？？hard难题,因此设计了一种具有多项式复杂度的方案。仿真结果表明,方案1可得到理论最优解,其D2D链路总中断概率比贪婪方案降低了29？？94％;方案2的D2D链路总中断概率比贪婪方案降低了23？？67％,相比于最优值,仅仅损失了8.16％的性能,有效地实现了性能与复杂度之间的折中。
The joint allocation of transmission mode and resource is considered, and two mechanisms are proposed to address the problem of the severe mutual interference between mobile relay (MR) assisted device？？to？？device (D2D) communication and the existing cellular communication whether each MR can be reused by multiple D2D links. The problem model of interference is reduced into a bipartite matching problem in mechanism 1 when each MR can be reused by multiple D2D links, and the optimal solution of the problem is obtained in polynomial？？time by using Hungary algorithm. The problem model of interference turns out to be a three？？dimensional matching problem in mechanism 2 when each MR cannot be reused by multiple D2D links. The problem generally is NP？？hard, and a heuristic algorithm is proposed to get its approximate optimum in polynomial？？time. The results show that the proposed mechanism 1 maintains the optimal performance and outweighs the greedy scheme by 29？？94%, and mechanism 2 achieves a 23.67% gain compared with the greedy scheme, and that a comparison with the optimal algorithm shows the proposed schemes attain polynomial？？time complexity with only 8.16% performance loss