Joint Power and Admission Control via Linear Programming Deflation
Joint Power and Admission Control via Linear Programming Deflation
复制标题
DOI：
10.1109/tsp.2012.2236319
复制
发表时间：
2013-03
影响因子：
5.4
通讯作者：
Ya-Feng Liu;Yu-Hong Dai;Z. Luo
中科院分区：
文献类型：
--
作者：
Ya-Feng Liu;Yu-Hong Dai;Z. Luo
我们考虑了由多个干扰链路组成的无线网络的联合功率和准入控制问题。目标是在使用最小的总传输功率的同时，以其指定的信号干扰噪声比（SINR）目标支持最大数量的链路。在这项工作中，我们首先将这个NP-困难问题转化为稀疏l0-最小化问题，然后将其放松为线性规划。此外，我们推导出两个易于检查的必要条件，使网络中的所有链路同时支持其目标SINR水平，并使用它们来迭代地去除强干扰链路（通缩）。最大支持链接数的上限也给出了。数值模拟结果表明，所提出的方法与现有的方法相比，在支持的链路数，总的传输功率，和执行时间。
We consider the joint power and admission control problem for a wireless network consisting of multiple interfering links. The goal is to support a maximum number of links at their specified signal to interference plus noise ratio (SINR) targets while using a minimum total transmission power. In this work, we first reformulate this NP-hard problem as a sparse l0-minimization problem and then relax it to a linear program. Furthermore, we derive two easy-to-check necessary conditions for all links in the network to be simultaneously supported at their target SINR levels, and use them to iteratively remove strong interfering links (deflation). An upper bound on the maximum number of supported links is also given. Numerical simulations show that the proposed approach compares favorably with the existing approaches in terms of the number of supported links, the total transmission power, and the execution time.