TY - GEN
T1 - A second-order cone deflation approach to joint multiuser downlink beamforming and admission control
AU - Matskani, E.
AU - Sidiropoulos, N. D.
AU - Luo, Z. Q.
AU - Tassiulas, L.
PY - 2007
Y1 - 2007
N2 - Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network operator's perspective (e.g., UMTS, 802.16e). When there are many co-channel users and/or the service constraints are stringent, the problem becomes infeasible and some form of admission control is necessary. We advocate a cross-layer approach to joint multiuser transmit beamforming and admission control, aiming to maximize the number of users that can be served at their desired QoS. The problem is NP-hard; we propose and motivate a deflation approach based on second-order cone relaxation. For a moderate number of users, we benchmark the proposed algorithm against the optimal enumeration-based solution and a simpler approach, using both simulated and measured channel data. Our results indicate that the proposed algorithm yields consistently close to optimal performance at an affordable complexity cost.
AB - Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network operator's perspective (e.g., UMTS, 802.16e). When there are many co-channel users and/or the service constraints are stringent, the problem becomes infeasible and some form of admission control is necessary. We advocate a cross-layer approach to joint multiuser transmit beamforming and admission control, aiming to maximize the number of users that can be served at their desired QoS. The problem is NP-hard; we propose and motivate a deflation approach based on second-order cone relaxation. For a moderate number of users, we benchmark the proposed algorithm against the optimal enumeration-based solution and a simpler approach, using both simulated and measured channel data. Our results indicate that the proposed algorithm yields consistently close to optimal performance at an affordable complexity cost.
UR - http://www.scopus.com/inward/record.url?scp=48049116896&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=48049116896&partnerID=8YFLogxK
U2 - 10.1109/spawc.2007.4401289
DO - 10.1109/spawc.2007.4401289
M3 - Conference contribution
AN - SCOPUS:48049116896
SN - 1424409551
SN - 9781424409556
T3 - IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC
BT - SPAWC 2007 - 8th IEEE Workshop on Signal Advances in Wireless Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 8th IEEE Signal Processing Advances in Wireless Communications, SPAWC 2007
Y2 - 17 June 2007 through 20 June 2007
ER -