Admission Control Algorithms for QoS-Constrained Multicell MISO Downlink Systems

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on wireless communications Ročník 17; číslo 3; s. 1982 - 1999
Hlavní autoři: Shashika Manosha, K. B., Joshi, Satya Krishna, Codreanu, Marian, Rajatheva, Nandana, Latva-aho, Matti
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.03.2018
Témata:
Admission control
alternating direction method of multipliers (ADMM)
distributed algorithm
Distributed algorithms
fairness
Heuristic algorithms
Interference
Lyapunov drift
Optimization
Signal to noise ratio
stochastic optimization
Wireless communication
ℓ₀ minimization
ISSN:1536-1276
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 l 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 l 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.
ISSN:1536-1276
DOI:10.1109/TWC.2017.2787641