Hyppää sisältöön
    • FI
    • ENG
  • FI
  • /
  • EN
OuluREPO – Oulun yliopiston julkaisuarkisto / University of Oulu repository
Näytä viite 
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

Admission control algorithms for QoS-constrained multicell MISO downlink systems

Manosha, K. B. Shashika; Joshi, Satya Krishna; Codreanu, Marian; Rajatheva, Nandana; Latva-aho, Matti (2017-12-29)

 
Avaa tiedosto
nbnfi-fe2018073033135.pdf (1.561Mt)
nbnfi-fe2018073033135_meta.xml (36.58Kt)
nbnfi-fe2018073033135_solr.xml (33.61Kt)
Lataukset: 

URL:
https://doi.org/10.1109/TWC.2017.2787641

Manosha, K. B. Shashika
Joshi, Satya Krishna
Codreanu, Marian
Rajatheva, Nandana
Latva-aho, Matti
Institute of Electrical and Electronics Engineers
29.12.2017

K. B. Shashika Manosha, S. K. Joshi, M. Codreanu, N. Rajatheva and M. Latva-aho, "Admission Control Algorithms for QoS-Constrained Multicell MISO Downlink Systems," in IEEE Transactions on Wireless Communications, vol. 17, no. 3, pp. 1982-1999, March 2018. doi: 10.1109/TWC.2017.2787641

https://rightsstatements.org/vocab/InC/1.0/
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/TWC.2017.2787641
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2018073033135
Tiivistelmä

Abstract

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

Kokoelmat
  • Avoin saatavuus [37744]
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen
 

Selaa kokoelmaa

NimekkeetTekijätJulkaisuajatAsiasanatUusimmatSivukartta

Omat tiedot

Kirjaudu sisäänRekisteröidy
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen