An Efficient User Removal Algorithm for Limited-Power Interference Channels

In this paper, the problem of maximizing the number of active users satisfying a required quality of service (QoS) in n-user interference channels is investigated. This problem is known as an NP-complete problem. We introduce an efficient suboptimal algorithm, relying on the results for the boundary of the rate region we derived in [1]. The algorithm is developed for different sorts of constraints on the transmit powers, including constraint on the power of the individual transmitters and constraint on the total power of the transmitters. Simulation results show that the performance of the proposed algorithm is very close to the optimum solution, and outperforms alternative algorithms.