Optimal joint base station assignment and power allocation in a cellular network

Ruoyu Sun, Mingyi Hong, Zhi-Quan Luo

Abstract: We consider the problem of maximizing the minimum rate by joint BS assignment and power allocation in a cellular network. First, we show that the max-min fairness problem with fixed power vector can be solved in polynomial time. Second, we show that the joint design problem with the constraints that the SINR of each user is at least 0 dB is polynomial time solvable. The key is to transform the subproblem of BS assignment to a maximum weighted matching problem with weights {log(g <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ij</sub> )}, where g <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ij</sub> is the channel gain. Third, our transformation motivates a two-stage efficient distributed algorithm for joint BS assignment and power control. Simulation results show that the proposed algorithm outperforms other existing algorithms in terms of the minimum achieved rate.