liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Power efficient uplink scheduling in SC-FDMA: Bounding global optimality by column generation
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan.
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan.
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.ORCID-id: 0000-0003-2094-7376
Visa övriga samt affilieringar
2013 (Engelska)Ingår i: 2013 IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD, IEEE , 2013, s. 119-123Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
IEEE , 2013. s. 119-123
Serie
International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), ISSN 2378-4865 ; 2013
Nationell ämneskategori
Matematik
Identifikatorer
URN: urn:nbn:se:liu:diva-106237DOI: 10.1109/CAMAD.2013.6708101OAI: oai:DiVA.org:liu-106237DiVA, id: diva2:714898
Konferens
2013 IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)
Tillgänglig från: 2014-04-29 Skapad: 2014-04-29 Senast uppdaterad: 2018-06-25
Ingår i avhandling
1. On the Integration of Heuristics with Column-Oriented Models for Discrete Optimization
Öppna denna publikation i ny flik eller fönster >>On the Integration of Heuristics with Column-Oriented Models for Discrete Optimization
2016 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
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.

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University Electronic Press, 2016. s. 23
Serie
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1764
Nationell ämneskategori
Matematik Transportteknik och logistik
Identifikatorer
urn:nbn:se:liu:diva-127175 (URN)978-91-7685-769-4 (ISBN)
Disputation
2016-05-31, ACAS, A-huset, Campus Valla, Linköping, 13:15 (Engelska)
Opponent
Handledare
Tillgänglig från: 2016-04-22 Skapad: 2016-04-15 Senast uppdaterad: 2018-06-25Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

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

Sök vidare i DiVA

Av författaren/redaktören
Zhao, HongmeiLei, LeiYuan, DiLarsson, TorbjörnRönnberg, Elina
Av organisationen
OptimeringsläraTekniska högskolanKommunikations- och transportsystem
Matematik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 244 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf