Uplink user admission under sum and per-user power constraints using convex relaxation

Jian Zhao, Tony Q.S. Quek, Zhongding Lei

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2013 IEEE Global Communications Conference, GLOBECOM 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3849-3854
Number of pages6
ISBN (Print)9781479913534
DOIs
Publication statusPublished - 2013
Event2013 IEEE Global Communications Conference, GLOBECOM 2013 - Atlanta, GA, United States
Duration: 2013 Dec 92013 Dec 13

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other2013 IEEE Global Communications Conference, GLOBECOM 2013
CountryUnited States
CityAtlanta, GA
Period13-12-0913-12-13

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Uplink user admission under sum and per-user power constraints using convex relaxation'. Together they form a unique fingerprint.

Cite this