TY - GEN
T1 - Joint interference and user association optimization in cellular wireless networks
AU - Kim, Changkyu
AU - Ford, Russell
AU - Rangan, Sundeep
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2015/4/24
Y1 - 2015/4/24
N2 - In cellular wireless networks, user association refers to the problem of assigning mobile users to base station cells - a critical, but challenging, problem in many emerging small cell and heterogeneous networks. This paper considers a general class of utility maximization problems for joint optimization of mobile user associations and bandwidth and power allocations. The formulation can incorporate a large class of network topologies, interference models, SNR-to-rate mappings and network constraints. In addition, the model can applied in carrier aggregation scenarios where mobiles can be served by multiple cells simultaneously. While the problem is non-convex, our main contribution shows that the optimization admits a separable dual decomposition. This property enables fast computation of upper bounds on the utility as well as an efficient, distributed implementation for approximate local optimization via augmented Lagrangian techniques. Simulations are presented in heterogeneous networks with mixtures of macro and picocells. We demonstrate significant value of the proposed methods in scenarios with variable backhaul capacity in the femtocell links and in cases where the user density is sufficiently low that lightly-used cells can reduce power.
AB - In cellular wireless networks, user association refers to the problem of assigning mobile users to base station cells - a critical, but challenging, problem in many emerging small cell and heterogeneous networks. This paper considers a general class of utility maximization problems for joint optimization of mobile user associations and bandwidth and power allocations. The formulation can incorporate a large class of network topologies, interference models, SNR-to-rate mappings and network constraints. In addition, the model can applied in carrier aggregation scenarios where mobiles can be served by multiple cells simultaneously. While the problem is non-convex, our main contribution shows that the optimization admits a separable dual decomposition. This property enables fast computation of upper bounds on the utility as well as an efficient, distributed implementation for approximate local optimization via augmented Lagrangian techniques. Simulations are presented in heterogeneous networks with mixtures of macro and picocells. We demonstrate significant value of the proposed methods in scenarios with variable backhaul capacity in the femtocell links and in cases where the user density is sufficiently low that lightly-used cells can reduce power.
UR - http://www.scopus.com/inward/record.url?scp=84940487811&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84940487811&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2014.7094497
DO - 10.1109/ACSSC.2014.7094497
M3 - Conference contribution
AN - SCOPUS:84940487811
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 511
EP - 515
BT - Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers
A2 - Matthews, Michael B.
PB - IEEE Computer Society
T2 - 48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Y2 - 2 November 2014 through 5 November 2014
ER -