Title :
Joint Downlink Base Station Association and Power Control for Max-Min Fairness: Computation and Complexity
Author :
Ruoyu Sun ; Mingyi Hong ; Zhi-Quan Luo
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA
Abstract :
In a heterogeneous network (HetNet) with a large number of low power base stations (BSs), proper user-BS association and power control is crucial to achieving desirable system performance. In this paper, we systematically study the joint BS association and power allocation problem for a downlink cellular network under the max-min fairness criterion. First, we show that this problem is NP-hard. Second, we show that the upper bound of the optimal value can be easily computed, and propose a two-stage algorithm to find a high-quality suboptimal solution. Simulation results show that the proposed algorithm is near-optimal in the high-SNR regime. Third, we show that the problem under some additional mild assumptions can be solved to global optima in polynomial time by a semi-distributed algorithm. This result is based on a transformation of the original problem to an assignment problem with gains log(gij), where {gij} are the channel gains.
Keywords :
cellular radio; communication complexity; minimax techniques; polynomials; power control; telecommunication control; wireless channels; BS; HetNet; NP-hard problem; assignment problem; computational complexity; downlink base station association; downlink cellular network; heterogeneous network; high-SNR regime; high-quality suboptimal solution; max-min fairness criterion; polynomial time; power allocation problem; power control; semidistributed algorithm; two-stage algorithm; Downlink; Interference; Joints; Power control; Resource management; Uplink; Upper bound; Base station association; distributed algorithm; downlink interference channel; polynomial time solvable; power control;
Journal_Title :
Selected Areas in Communications, IEEE Journal on
DOI :
10.1109/JSAC.2015.2416982