TY - JOUR
T1 - Sample Approximation-Based Deflation Approaches for Chance SINR-Constrained Joint Power and Admission Control
AU - Liu, Ya Feng
AU - Hong, Mingyi
AU - Song, Enbin
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/7
Y1 - 2016/7
N2 - Consider the joint power and admission control (JPAC) problem for a multiuser single-input single-output (SISO) interference channel. Most existing works on JPAC assume the perfect instantaneous channel state information (CSI). In this paper, we consider the JPAC problem with the imperfect CSI, i.e., we assume that only the channel distribution information (CDI) is available. We formulate the JPAC problem into a chance (probabilistic)-constrained program, where each link's SINR outage probability is enforced to be less than or equal to a specified tolerance. To circumvent the computational difficulty of the chance SINR constraints, we propose to use the sample (scenario) approximation scheme to convert them into finitely many simple linear constraints. Furthermore, we reformulate the sample approximation of the chance SINR-constrained JPAC problem as a composite group sparse minimization problem and then approximate it by a second-order cone program (SOCP). The solution of the SOCP approximation can be used to check the simultaneous supportability of all links in the network and to guide an iterative link removal procedure (the deflation approach). We exploit the special structure of the SOCP approximation and custom-design an efficient algorithm for solving it. Finally, we illustrate the effectiveness and efficiency of the proposed sample approximation-based deflation approaches by simulations.
AB - Consider the joint power and admission control (JPAC) problem for a multiuser single-input single-output (SISO) interference channel. Most existing works on JPAC assume the perfect instantaneous channel state information (CSI). In this paper, we consider the JPAC problem with the imperfect CSI, i.e., we assume that only the channel distribution information (CDI) is available. We formulate the JPAC problem into a chance (probabilistic)-constrained program, where each link's SINR outage probability is enforced to be less than or equal to a specified tolerance. To circumvent the computational difficulty of the chance SINR constraints, we propose to use the sample (scenario) approximation scheme to convert them into finitely many simple linear constraints. Furthermore, we reformulate the sample approximation of the chance SINR-constrained JPAC problem as a composite group sparse minimization problem and then approximate it by a second-order cone program (SOCP). The solution of the SOCP approximation can be used to check the simultaneous supportability of all links in the network and to guide an iterative link removal procedure (the deflation approach). We exploit the special structure of the SOCP approximation and custom-design an efficient algorithm for solving it. Finally, we illustrate the effectiveness and efficiency of the proposed sample approximation-based deflation approaches by simulations.
KW - Chance SINR constraint
KW - group sparse
KW - power and admission control
KW - sample approximation
UR - http://www.scopus.com/inward/record.url?scp=84978884042&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84978884042&partnerID=8YFLogxK
U2 - 10.1109/TWC.2016.2542240
DO - 10.1109/TWC.2016.2542240
M3 - Article
AN - SCOPUS:84978884042
SN - 1536-1276
VL - 15
SP - 4535
EP - 4547
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 7
M1 - 7434069
ER -