Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Fundamentals of wireless communication
Fundamentals of wireless communication
Cell outage management in LTE networks
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
An axiomatic theory of fairness in network resource allocation
INFOCOM'10 Proceedings of the 29th conference on Information communications
Asymptotically fair transmission scheduling over fading channels
IEEE Transactions on Wireless Communications
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
Self-organizing relays in LTE networks: queuing analysis and algorithms
Proceedings of the 7th International Conference on Network and Services Management
| Hi-index | 0.01 |
This paper investigates packet scheduling in the context of Self-Optimizing Networks, and demonstrates how to improve coverage dynamically by adjusting the scheduling strategy. We focus on @a-fair schedulers, and we provide methods for calculating the scheduling gain, including several closed form formulas. Scheduling gain is analyzed for different fading models, with a particular focus on the frequency-selective channel. We then propose a coverage-capacity self-optimization algorithm based on @a-fair schedulers. A use case illustrates the implementation of the algorithm and simulation results show that important coverage gains are achieved at the expense of very little computing power.