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

Research

Associated organisational units

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

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

Links

Text available via DOI:

Keywords

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems. / Letchford, Adam; Ni, Qiang; Zhong, Zhaoyu.
In: Journal of Heuristics, Vol. 26, No. 1, 01.02.2020, p. 21-32.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Letchford, A, Ni, Q & Zhong, Z 2020, 'A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems', Journal of Heuristics, vol. 26, no. 1, pp. 21-32. https://doi.org/10.1007/s10732-019-09422-z

APA

Letchford, A., Ni, Q., & Zhong, Z. (2020). A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems. Journal of Heuristics, 26(1), 21-32. https://doi.org/10.1007/s10732-019-09422-z

Vancouver

Letchford A, Ni Q, Zhong Z. A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems. Journal of Heuristics. 2020 Feb 1;26(1):21-32. Epub 2019 Jul 22. doi: 10.1007/s10732-019-09422-z

Author

Letchford, Adam ; Ni, Qiang ; Zhong, Zhaoyu. / A heuristic for fair dynamic resource allocation in over-loaded OFDMA systems. In: Journal of Heuristics. 2020 ; Vol. 26, No. 1. pp. 21-32.

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 = "2020",
month = feb,
day = "1",
doi = "10.1007/s10732-019-09422-z",
language = "English",
volume = "26",
pages = "21--32",
journal = "Journal of Heuristics",
issn = "1381-1231",
publisher = "Springer Netherlands",
number = "1",

}

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 - 2020/2/1

Y1 - 2020/2/1

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

VL - 26

SP - 21

EP - 32

JO - Journal of Heuristics

JF - Journal of Heuristics

SN - 1381-1231

IS - 1

ER -