基于投影次梯度和网络流优化的优化分布式小区间干扰协调(ICIC)方案
Optimized Distributed Inter-cell Interference Coordination (ICIC) Scheme using Projected Subgradient and Network Flow Optimization
摘要:
在本文中,我们解决多小区资源调度的问题,其目标是通过小区间干扰协调(ICIC)最大化加权和速率。消隐方法用于减轻小区间干扰,其中资源以预定发射功率使用或根本不使用,即,空白该问题是一个强NP难问题,这意味着它不仅难以在多项式时间内求解,而且很难找到一个保证最优性间隙的近似算法。在这项工作中,我们确定了一个多项式时间算法可以构建解决这个问题的理论保证的特殊情况。特别是,我们定义了一个占主导地位的干扰环境,其中对于每个用户,从每个干扰器的接收功率显着大于从所有其他较弱的干扰器的总接收功率。我们表明,强NP难问题可以紧紧放松到一个线性规划问题在一个占主导地位的干扰环境。因此,我们提出了一个多项式时间的分布式算法,是基于原始分解,投影次梯度,和网络流优化方法。仿真结果表明,与基线方案相比,该方案在总吞吐量、小区边缘吞吐量和中断概率方面都有更高的增益。
英文摘要:
In this paper, we tackle the problem of multi-cell resource scheduling, where the objective is to maximize the weighted sum-rate through inter-cell interference coordination (ICIC). The blanking method is used to mitigate the inter-cell interference, where a resource is either used with a predetermined transmit power or not used at all, i.e., blanked. This problem is known to be strongly NP-hard, which means that it is not only hard to solve in polynomial time, but it is also hard to find an approximation algorithm with guaranteed optimality gap. In this work, we identify special scenarios where a polynomial-time algorithm can be constructed to solve this problem with theoretical guarantees. In particular, we define a dominant interference environment, in which for each user the received power from each interferer is significantly greater than the aggregate received power from all other weaker interferers. We show that the strongly NP-hard problem can be tightly relaxed to a linear programming problem in a dominant interference environment. Consequently, we propose a polynomial-time distributed algorithm that is based on the primal-decomposition, the projected-subgradient, and the network flow optimization methods. In comparison with baseline schemes, simulation results show that the proposed scheme achieves higher gains in aggregate throughput, cell-edge throughput, and outage probability.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。