liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Power efficient uplink scheduling in SC-FDMA: Bounding global optimality by column generation
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0003-2094-7376
Show others and affiliations
2013 (English)In: 2013 IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD, IEEE , 2013, 119-123 p.Conference paper, Published paper (Refereed)
Abstract [en]

We study resource allocation in cellular systems and consider the problem of finding a power efficient scheduling in an uplink single carrier frequency division multiple access (SC-FDMA) system with localized allocation of subcarriers, that is, the subcarriers allocated to a user equipment have to be consecutive in the frequency domain in each time slot. This problem is discrete and nonconvex, thus the use of suboptimal algorithms has been a common practice. We leverage the power of mathematical programming in order to approach global optimality or a tight bounding interval confining global optimum, to arrive at an effective scheme for gauging the performance of suboptimal algorithms. Toward this end, we first provide a straightforward integer linear programming formulation, and then an alternative and less trivial, so-called column-oriented, formulation. The latter is solved by column generation, which is a solution technique for large-scale optimization problems with certain characteristics. The computational evaluation demonstrates that the column generation method produces very highquality subcarrier allocations that either coincide with the global optimum or enable an extremely sharp bounding interval. Hence the approach serves well for the purpose of benchmarking results for large-scale instances of power efficient SC-FDMA scheduling.

Place, publisher, year, edition, pages
IEEE , 2013. 119-123 p.
Series
International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), ISSN 2378-4865 ; 2013
National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-106237DOI: 10.1109/CAMAD.2013.6708101OAI: oai:DiVA.org:liu-106237DiVA: diva2:714898
Conference
2013 IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)
Available from: 2014-04-29 Created: 2014-04-29 Last updated: 2016-04-22
In thesis
1. On the Integration of Heuristics with Column-Oriented Models for Discrete Optimization
Open this publication in new window or tab >>On the Integration of Heuristics with Column-Oriented Models for Discrete Optimization
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Column-oriented models are today common in the eld of discrete optimization, and there is an increasing interest in using such models as a basis for heuristic solution methods. The common theme of this work is to explore some possibilities to integrate heuristic principles and column-oriented models for discrete optimization problems.

In the rst paper, we consider a resource allocation problem for cellular systems. We propose a strong column-oriented formulation and a corresponding column generation method, as well as an enhanced column generation scheme for this problem. The enhanced scheme is composed of a stabilization technique, an approximate column generation principle, and, for nding integer solutions, a heuristic that is embedded in the column generation scheme.

The second paper provides a new and strong convexied formulation of the xed charge transportation problem. This formulation is obtained by integrating the concepts of Lagrangian decomposition and column generation. It is shown both theoretically and practically that this integration yields a formulation which is stronger than three other convexied formulations of the problem.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. 23 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1764
National Category
Mathematics Transport Systems and Logistics
Identifiers
urn:nbn:se:liu:diva-127175 (URN)978-91-7685-769-4 (ISBN)
Public defence
2016-05-31, ACAS, A-huset, Campus Valla, Linköping, 13:15 (English)
Opponent
Supervisors
Available from: 2016-04-22 Created: 2016-04-15 Last updated: 2016-04-22Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Zhao, HongmeiLei, LeiYuan, DiLarsson, TorbjörnRönnberg, Elina

Search in DiVA

By author/editor
Zhao, HongmeiLei, LeiYuan, DiLarsson, TorbjörnRönnberg, Elina
By organisation
Optimization The Institute of TechnologyCommunications and Transport Systems
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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