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

Standard

A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems. / Letchford, Adam; Ni, Qiang; Zhong, Zhaoyu.

In: Journal of Heuristics, 22.07.2019.

Research output: Contribution to journalJournal article

Harvard

APA

Vancouver

Author

Bibtex

@article{35ffd32ee6544d2c876adccfeb7d4d25,
title = "A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems",
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.",
keywords = "mobile wireless communications, stochastic dsynamic optimisation, local search",
author = "Adam Letchford and Qiang Ni and Zhaoyu Zhong",
note = "The final publication is available at Springer via http://dx.doi.org/10.1007/s10732-019-09422-z",
year = "2019",
month = "7",
day = "22",
doi = "10.1007/s10732-019-09422-z",
language = "English",
journal = "Journal of Heuristics",
issn = "1381-1231",
publisher = "Springer Netherlands",

}

RIS

TY - JOUR

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

AU - Letchford, Adam

AU - Ni, Qiang

AU - Zhong, Zhaoyu

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

PY - 2019/7/22

Y1 - 2019/7/22

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

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

KW - mobile wireless communications

KW - stochastic dsynamic optimisation

KW - local search

U2 - 10.1007/s10732-019-09422-z

DO - 10.1007/s10732-019-09422-z

M3 - Journal article

JO - Journal of Heuristics

JF - Journal of Heuristics

SN - 1381-1231

ER -