Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Accurate optimization models for interference constrained bandwith allocation in cellular networks
INFORM GmbH, Risk & Fraud Division, Aachen, Germany.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. Department of Science and Technology, Linköping University, Norrköping, Sweden. (Optimisation)
Lehrstuhl II für Mathematik, RWTH Aachen University, Aachen, Germany.
Institute for Theoretical Information Technology, RWTH Aachen University, Aachen, Germany.
2019 (English)In: Computers & Operations Research, ISSN 0305-0548, E-ISSN 1873-765X, Vol. 101, p. 1-12Article in journal (Refereed) Published
Abstract [en]

In cellular networks, the signal-to-interference-plus-noise ratio (SINR) is a key metric for link availability and quality. For network planning purposes, a straightforward modeling unfortunately yields numerically difficult optimization models. Further, given a required data rate of a link, its bandwidth consumption depends nonlinearly on the SINR.

In this paper, we develop two novel approaches to jointly model SINR-based link availability and bandwidth requirements accurately. The first approach is a set-wise formulation from a user’s point of view, while the second one exploits discrete channel quality indicators. We compare these formulations with three known approximate approaches numerically, revealing the clear outperformance of our approaches in terms of exactness. Moreover, since the exact models comprise an exponential number of either variables or constraints, we discuss their pros and cons in a further computational study and develop a more efficient algorithm dealing implicitly with the involved constraints.

Place, publisher, year, edition, pages
2019. Vol. 101, p. 1-12
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-367379DOI: 10.1016/j.cor.2018.08.011ISI: 000449311100001OAI: oai:DiVA.org:uu-367379DiVA, id: diva2:1267158
Funder
German Research Foundation (DFG), KO2311/3-1German Research Foundation (DFG), SCHM2643/5-1EU, Horizon 2020, 645705Available from: 2018-08-22 Created: 2018-11-30 Last updated: 2019-12-06Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Yuan, Di
By organisation
Computing Science
In the same journal
Computers & Operations Research
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 117 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf