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
Radio Resource Optimization for OFDM-based Broadband Cellular Systems
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan.
2014 (Engelska)Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

The rapid growth of users’ traffic demand in broadband wireless communication systems requires high-speed data transmission and intelligent resource allocation approaches. The Third Generation Partnership Project-Long Term Evolution (3GPPLTE) has standardized multiple access (MA) schemes for 4G cellular networks. Two advanced schemes, orthogonal frequency division multiple access (OFDMA) and single carrier frequency division multiple access (SC-FDMA), have been adopted for downlink and uplink, respectively.

Optimization-based approaches play a crucial role in network operation and resource management. The optimization problems considered in this thesis are addressed in four research papers. For the single cell scenario, the optimization problems of joint power and channel allocation in OFDMA and consecutive-channel assignment in SCFDMA are investigated in Papers I, II, and III. For the OFDM-based multi-cell scenario, an energy minimization problem is addressed in Paper IV.

In the thesis, theoretical analysis, algorithm development, and numerical studies are carried out. Mathematical optimization is applied as the main approach to facilitate the problem solving. In Paper I, we evaluate the performance gain and loss for various  allocation policies in the OFDMA system. In Papers II and III, resource allocation algorithms are proposed to obtain competitive and high-quality solutions for consecutive-channel allocation problems in the SC-FDMA system. The theoretical analysis and the proposed algorithm in Paper IV provide optimal solution for energy minimization.

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University Electronic Press, 2014. , s. 20
Serie
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1649
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
URN: urn:nbn:se:liu:diva-105500ISBN: 978-91-7519-374-8 (tryckt)OAI: oai:DiVA.org:liu-105500DiVA, id: diva2:707733
Presentation
2014-04-10, K3, Kåkenhus, Campus Norrköping, Linköpings universitet, Norrköping, 10:15 (Engelska)
Opponent
Handledare
Tillgänglig från: 2014-03-25 Skapad: 2014-03-25 Senast uppdaterad: 2014-03-25Bibliografiskt granskad
Delarbeten
1. Performance analysis of chunk-based resource allocation in wireless OFDMA systems
Öppna denna publikation i ny flik eller fönster >>Performance analysis of chunk-based resource allocation in wireless OFDMA systems
2012 (Engelska)Ingår i: Proceedings from the 17th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), September 17-19, 2012, Barcelona, Spain, IEEE , 2012, s. 90-94Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

In typical resource allocation for Orthogonal Frequency Division Multiple Access (OFDMA), assigning subcarriers to the more favorable users provides beneficial diversity and increased system performance. It is however relevant to consider OFDMA resource allocation with a subcarrier adjacency restriction, grouping a number of adjacent subcarriers into a chunk, both for physical design simplicity and for complexity mitigation. In this paper, we classify different resource allocation policies for chunk-based allocation. We investigate how to optimally allocate resources by using discrete rates and discrete power levels. This is enabled by developing binary integer optimization models to obtain the optimal solution for this comparative study. We present numerical results to evaluate the performance of different resource allocation policies under different parameters and scenarios.

Ort, förlag, år, upplaga, sidor
IEEE, 2012
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
urn:nbn:se:liu:diva-105496 (URN)10.1109/CAMAD.2012.6335386 (DOI)978-1-4673-3123-4 (ISBN)978-1-4673-3124-1 (ISBN)
Konferens
17th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), September 17-19, 2012, Barcelona, Spain
Tillgänglig från: 2014-03-25 Skapad: 2014-03-25 Senast uppdaterad: 2014-03-25Bibliografiskt granskad
2. Improved Resource Allocation Algorithm Based on Partial Solution Estimation for SC-FDMA Systems
Öppna denna publikation i ny flik eller fönster >>Improved Resource Allocation Algorithm Based on Partial Solution Estimation for SC-FDMA Systems
2013 (Engelska)Ingår i: Proceedings from the 78th IEEE Vehicular Technology Conference (VTC Fall), September 2-5, Las Vegas, USA, IEEE , 2013, s. 1-5Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Single carrier frequency division multiple access (SC-FDMA) has been adopted as the standard multiple access scheme for 3GPP LTE uplink. In comparison to orthogonal frequency division multiple access (OFDMA), the subcarriers assigned to each user are required to be consecutive in SC-FDMA localized scheme, which imposes more difficulties on resource allocation problem. Subject to this constraint, various optimization objectives, such as utility maximization and power minimization, have been studied for SC-FDMA resource allocation. In this paper, we focus on developing a general algorithm framework with near-optimal performance and polynomial-time complexity to maximize the total utility for SC-FDMA systems. The proposed algorithm is based on low-complexity estimation for the partial solution space. Compared with existing algorithms, simulation results show that our algorithm improves the system utility significantly and has less deviation to global optimum. In addition, the proposed algorithm framework allows a flexible trade-off between computational effort and solution performance by varying the complexity of estimation approaches.

Ort, förlag, år, upplaga, sidor
IEEE, 2013
Serie
Vehicular Technology Conference, ISSN 1090-3038 ; 78
Nyckelord
SC-FDMA; Algorithm; Resource Allocation; Binary Integer Programming; Partial Solution; Estimation
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
urn:nbn:se:liu:diva-105049 (URN)10.1109/VTCFall.2013.6692229 (DOI)000330585400207 ()978-1-4673-6187-3 (Article) (ISBN)978-1-4673-6185-9 (ISBN)
Konferens
78th IEEE Vehicular Technology Conference (VTC Fall), September 2-5, Las Vegas, USA
Tillgänglig från: 2014-03-06 Skapad: 2014-03-06 Senast uppdaterad: 2015-03-18Bibliografiskt granskad
3. A Unified Graph Labeling Algorithm for Consecutive-Block Channel Allocation in SC-FDMA
Öppna denna publikation i ny flik eller fönster >>A Unified Graph Labeling Algorithm for Consecutive-Block Channel Allocation in SC-FDMA
2013 (Engelska)Ingår i: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 12, nr 11, s. 5767-5779Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Optimal channel allocation is a key performance engineering aspect in single-carrier frequency-division multiple access (SC-FDMA). In SC-FDMA with localized channel assignment, the channels of each user must form a consecutive block. Subject to this constraint, various performance objectives, such as maximum utility, minimum power, and minimum number of channels, have been studied. We present a unified graph labeling algorithm for these problems, based on the structural insight that SC-FDMA channel allocation can be modeled as finding an optimal path in an acyclic graph. By this insight, our algorithm applies the concept of labeling and label domination that represent non-trivial extensions of finding a shortest or longest path. The key parameter in trading performance versus computation is the number of labels kept per node. Increasing the number ultimately enables global optimality. The algorithms approach is further justified by its global optimality guarantee with strong polynomial-time complexity for two specific scenarios, where the input is user-invariant and channel-invariant, respectively. For the general case, we provide numerical results demonstrating the algorithms ability of attaining near-optimal solutions.

Ort, förlag, år, upplaga, sidor
Institute of Electrical and Electronics Engineers (IEEE), 2013
Nyckelord
Algorithm, channel allocation, optimization, single carrier frequency division multiple access
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
urn:nbn:se:liu:diva-102855 (URN)10.1109/TWC.2013.092313.130092 (DOI)000328058400034 ()
Anmärkning

R)||A*STAR, Singapore||Linkoping-Lund Excellence Center in Information Technology (ELLIIT), Sweden||

Tillgänglig från: 2014-01-07 Skapad: 2014-01-02 Senast uppdaterad: 2017-12-06
4. Optimal Energy Minimization inLoad-Coupled Wireless Networks: Computation and Properties
Öppna denna publikation i ny flik eller fönster >>Optimal Energy Minimization inLoad-Coupled Wireless Networks: Computation and Properties
2014 (Engelska)Konferensbidrag, Publicerat paper (Övrigt vetenskapligt)
Abstract [en]

We consider the problem of sum transmission energy minimization in a cellular network where base stations interfere with one another. Each base station has to serve a target amount of data to its set of users, by varying its power and load, where the latter refers to the average level of channel resource usage in the cell. We employ the signal-tointerference-and-noise-ratio (SINR) load-coupled model that takes into account the load of each cell. We show analytically that operating at full load is optimal to minimize sum energy. Moreover, we provide an iterative power adjustment algorithm for all base stations to achieve full load. Numerical results are obtained that corroborate the analysis and illustrate the advantage of our solution compared to the conventional solution where uniform power is used for all base stations.

Nyckelord
Energy minimization, load balancing, load coupling, Perron-Frobenius theorem.
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
urn:nbn:se:liu:diva-105497 (URN)
Konferens
The 2014 IEEE International Conference on Communications (ICC), June 10-14, Sydney, Australia
Tillgänglig från: 2014-03-25 Skapad: 2014-03-25 Senast uppdaterad: 2014-03-25Bibliografiskt granskad

Open Access i DiVA

omslag(72 kB)73 nedladdningar
Filinformation
Filnamn COVER01.pdfFilstorlek 72 kBChecksumma SHA-512
34f4987bbe486829bdbdab2a4c2c5faddaaabbda00f5f206aa651e6d9e7c03fd34da897e649138b42c443a3977c9e919d0a382dc4c9166341043cbd87cb9c63d
Typ coverMimetyp application/pdf

Personposter BETA

Lei, Lei

Sök vidare i DiVA

Av författaren/redaktören
Lei, Lei
Av organisationen
Kommunikations- och transportsystemTekniska högskolan
Teknik och teknologier

Sök vidare utanför DiVA

GoogleGoogle Scholar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 1024 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