A green cellular network with maximum user number based on joint base station assignment and power allocation

In this paper, the traditional power minimization problem under some QoS constraints in a SISO cellular network is considered. However, the research is distinguished by two points. (1) The association relationship between base stations (BS) and users is no longer known and fixed. (2) When the QoS constraints are not satisfied, instead of simply claiming the problem is infeasible, the network tries to serve as many users as possible. To achieve this goal, a two-stage algorithm is proposed in this paper, which manages the network via joint BS assignment and power allocation. In the first stage, based on the identified polynomial time solvable BS assignment model, the BS assignment problem is solved by the auction algorithm. Then the power allocation is determined easily in the second stage. Moreover, if the candidate solution does not satisfy the QoS constraints, these constraints are relaxed by introducing an auxiliary sparse vector. Then, after performing the sparse optimization, the network can serve as many users as possible. Numerical examples demonstrate that compared with many conventional algorithms in this field, the proposed one achieves better performance in terms of power consumption and active user number.