Home > Research > Publications & Outputs > A heuristic for fair dynamic resource allocatio...

Electronic data

  • ofdma-dynamic

    Rights statement: The final publication is available at Springer via http://dx.doi.org/10.1007/s10732-019-09422-z

    Accepted author manuscript, 270 KB, PDF document

    Embargo ends: 22/07/20

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems

Research output: Contribution to journalJournal article

E-pub ahead of print
<mark>Journal publication date</mark>22/07/2019
<mark>Journal</mark>Journal of Heuristics
Number of pages12
Publication statusE-pub ahead of print
Early online date22/07/19
Original languageEnglish

Abstract

OFDMA is a popular coding scheme for mobile wireless communications. In OFDMA, one must allocate the available resources (bandwidth and power) dynamically, as user requests arrive and depart in a stochastic manner. Several exact and heuristic methods exist to do this, but they all perform poorly in the “over-loaded” case, in which the user demand is close to or exceeds the system capacity. To address this case, we present a dynamic local search heuristic. A particular feature of our heuristic is that it takes fairness into consideration. Simulations on realistic data show that our heuristic is fast enough to be used in real-time, and consistently delivers allocations of good quality.

Bibliographic note

The final publication is available at Springer via http://dx.doi.org/10.1007/s10732-019-09422-z