Scheduling gain for frequency-selective Rayleigh-fading channels with application to self-organizing packet scheduling

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01576189
Contributor : Richard Combes <>
Submitted on : Tuesday, August 22, 2017 - 3:11:20 PM
Last modification on : Saturday, March 23, 2019 - 1:22:31 AM

Identifiers

Collections

Citation

Richard Combes, Zwi Altman, Eitan Altman. Scheduling gain for frequency-selective Rayleigh-fading channels with application to self-organizing packet scheduling. Performance Evaluation, Elsevier, 2011, 68 (8), pp.690 - 709. ⟨10.1016/j.peva.2011.01.009⟩. ⟨hal-01576189⟩

Share

Metrics

Record views

125