LAUSR

The problem of admission control in a multicell downlink multiple-input single-output system is considered. The objective is to maximize the number of admitted users subject to the signal-to-interference-plus-noise ratio constraint for each admitted user and a transmit power constraint at each base station. We cast the admission control problem as an $\ell _{0}$ minimization problem. This problem is known to be combinatorial NP-hard. Hence, we have to rely on suboptimal algorithms to solve it. We first approximate the $\ell _{0}$ minimization problem via a non-combinatorial one. Then, we propose centralized and distributed algorithms to solve the non-combinatorial problem. To develop the centralized algorithm, we use the sequential convex programming method. The distributed algorithm is derived by using the alternating direction method of multipliers in conjunction with sequential convex programming. We show numerically that the proposed admission control algorithms achieve a near-to-optimal performance. Next, we extend the admission control problem to provide fairness, where a long term fairness among the users is guaranteed. We focus on proportional and max–min fairness and propose dynamic control algorithms via Lyapunov optimization. It is shown numerically that the proposed fair admission control algorithms guarantee fairness among the users.