Joint power and admission control via linear programming deflation

Ya Feng Liu, Yu Hong Dai, Zhi Quan Luo

Research output: Contribution to journalArticlepeer-review

53 Scopus citations


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 l 0-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.

Original languageEnglish (US)
Article number6392990
Pages (from-to)1327-1338
Number of pages12
JournalIEEE Transactions on Signal Processing
Issue number6
StatePublished - 2013


  • Admission control
  • convex approximation
  • link removal
  • power control
  • sparse optimization


Dive into the research topics of 'Joint power and admission control via linear programming deflation'. Together they form a unique fingerprint.

Cite this