Paper Info
Title
Joint Base Station Association and Power Allocation for uplink sum-rate maximization
Abstract
In this paper, the problem of sum-rate maximization with Quality of Service (QoS) for a multi-cell multi-user uplink is addressed. The problem is formulated as a Mixed Integer Nonlinear Programming (MINLP) problem with non-convex feasible region and hence is difficult to solve. A primal-dual infeasible-interior-point method (IIPM) is applied to jointly optimize resources. With this method, simultaneously optimizing the Base Station Association (BSA) and Power Allocation (PA) is possible. Further to reduce the size, the problem is decomposed into two subproblems. The NP-hard Integer Programming (IP) BSA subproblem from the decomposition is solved by two different methods. One method uses the IIPM and other uses a Semidefinite Programming formulation. The PA subproblem is solved iteratively by IIPM. Simulation results converge to the optimum obtained by an existing exhaustive search. Apart from the sum-rate objective, the IIPM is applicable to broad class of utility functions and objectives and it also eliminates the requirement of an initial primal feasible point to begin the algorithm.
Year
DOI
Venue
2013
10.1109/SPAWC.2013.6612001
Signal Processing Advances in Wireless Communications
Keywords
Field
DocType
computational complexity,integer programming,multiuser channels,nonlinear programming,optimisation,quality of service,radio links,radio spectrum management,resource allocation,BSA,IIPM,MINLP,NP-hard integer programming,QoS,base station association,mixed integer nonlinear programming,multicell multiuser uplink,power allocation,primal-dual infeasible-interior-point method,quality of service,semidefinite programming formulation,uplink sum-rate maximization,utility functions,Base station association,mixed integer nonlinear program,power allocation,primal-dual infeasible-interior-point method
Mathematical optimization,Brute-force search,Computer science,Nonlinear programming,Feasible region,Integer programming,Resource allocation,Maximization,Semidefinite programming,Computational complexity theory
Conference
ISSN
Citations 
PageRank 
1948-3244
10
0.68
References 
Authors
13
3
Name
Order
Citations
PageRank
Krishna Chitti1142.18
Quan Kuang2252.97
Joachim Speidel3162.71