An exact algorithm for a resource allocation problem in mobile wireless communications
We consider a challenging resource allocation problem arising in mobile wireless communications. The goal is to allocate the available channels and power in a so-called OFDMA system , in order to maximise the transmission rate, subject to quality of service constraints. Standard MINLP software strug...
Saved in:
Published in | Computational optimization and applications Vol. 68; no. 2; pp. 193 - 208 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.11.2017
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We consider a challenging resource allocation problem arising in mobile wireless communications. The goal is to allocate the available channels and power in a so-called
OFDMA system
, in order to maximise the transmission rate, subject to quality of service constraints. Standard MINLP software struggled to solve even small instances of this problem. Using outer approximation, perspective cuts and several implementation “tricks”, we are able to solve realistic instances in about one minute. A novel ingredient of our algorithm is what we call
pre-emptive cut generation
: the generation of cutting planes that are not violated in the current iteration, but are likely to be violated in subsequent iterations. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 0926-6003 1573-2894 |
DOI: | 10.1007/s10589-017-9914-9 |