Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Fundamentals of wireless communication
Fundamentals of wireless communication
Semi-dynamic simulator for large-scale heterogeneous wireless networks
International Journal of Mobile Network Design and Innovation
The asymptotic capacity of multiple-antenna Rayleigh-fading channels
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Self-organizing networks (SON) is currently seen as a key lever to improve network performance and simplify its management. This paper considers α-fair schedulers in an Orthogonal Frequency-Division Multiple Access (OFDMA) network. The convergence of the α-fair scheduler is analyzed. Closed-form formulas are given for certain cases to calculate the scheduling gain, as well as a Monte-Carlo method, for a MIMO channel. A capacity-coverage algorithm based on the α-fair schedulers using observable Key Performance Indicators (KPIs) is proposed. The algorithm is implemented in a large scale network simulator. It is shown that notable coverage gains are achieved at the expense of very small capacity losses.