TY - GEN
T1 - Uplink user admission under sum and per-user power constraints using convex relaxation
AU - Zhao, Jian
AU - Quek, Tony Q.S.
AU - Lei, Zhongding
PY - 2013
Y1 - 2013
N2 - We address uplink user admission control problems in multiuser wireless systems with multiple single-antenna users and a multi-antenna receiver. Our aim is to select the maximum number of users that can simultaneously satisfy the given quality of service (QoS) and power constraints from a large number of candidates in the system. Both sum and per-user transmit power constraints are considered. By utilizing uplink-downlink duality, we formulate the uplink user admission problems into sparsity-maximization problems, which are NP-hard. Inspired by compressive sensing techniques, we propose novel methods to tackle them by first using convex relaxation and then applying fast iterative methods on the convex-relaxed solutions. Simulations show that the proposed algorithms achieve excellent performance. The numbers of admitted users are close to the optimum ones obtained by exhaustive search when the QoS requirement is medium or low. Compared to a greedy algorithm, the proposed methods can admit up to 24% more users in the simulations.
AB - We address uplink user admission control problems in multiuser wireless systems with multiple single-antenna users and a multi-antenna receiver. Our aim is to select the maximum number of users that can simultaneously satisfy the given quality of service (QoS) and power constraints from a large number of candidates in the system. Both sum and per-user transmit power constraints are considered. By utilizing uplink-downlink duality, we formulate the uplink user admission problems into sparsity-maximization problems, which are NP-hard. Inspired by compressive sensing techniques, we propose novel methods to tackle them by first using convex relaxation and then applying fast iterative methods on the convex-relaxed solutions. Simulations show that the proposed algorithms achieve excellent performance. The numbers of admitted users are close to the optimum ones obtained by exhaustive search when the QoS requirement is medium or low. Compared to a greedy algorithm, the proposed methods can admit up to 24% more users in the simulations.
UR - http://www.scopus.com/inward/record.url?scp=84904089428&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904089428&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2013.6831673
DO - 10.1109/GLOCOM.2013.6831673
M3 - Conference contribution
AN - SCOPUS:84904089428
SN - 9781479913534
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 3849
EP - 3854
BT - 2013 IEEE Global Communications Conference, GLOBECOM 2013
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2013 IEEE Global Communications Conference, GLOBECOM 2013
Y2 - 9 December 2013 through 13 December 2013
ER -