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
Energy-Efficient Resource Allocation in OFDMA Systems
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
2013 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In this thesis, a resource allocation problem in OFDMA is studied for the energy efficiency of wireless network. The objective is to minimize the total energy consumption which includes transmission energy consumption, and circuit energy consumption at both transmitter and receiver with required per user’s rate constraint. For problem solution, a heuristic algorithm with low computational complexity and suboptimal solution is proposed, developed in two steps with an increasing order of complexity. Besides, a bounding scheme based on model linearization of formulated nonlinear system model is also proposed to give lower and upper bounds for both small- and large-scale OFDMA network for further algorithm performance evaluation, while the implemented exhaustive search is only capable to provide the optimal solution for small-scale instance for algorithm performance evaluation. Numerical results show that the proposal heuristic algorithm can achieve near-optimal performance with applicable computational complexity even for large-scale networks, and that the bounds from the bounding scheme are very tight for both small- and large-scale OFDMA networks.

Place, publisher, year, edition, pages
2013. , 35 p.
Keyword [en]
Keywords ‒ OFDMA, resource allocation, energy efficiency, circuit energy consumption at transmitter and receiver, heuristic search, integer linear programming, upper and lower bounds
National Category
Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:liu:diva-98683ISRN: LiU-ITN-TEK-A-13/037--SEOAI: oai:DiVA.org:liu-98683DiVA: diva2:655286
Subject / course
Transportation Systems Engineering
Uppsok
Technology
Supervisors
Examiners
Available from: 2013-10-10 Created: 2013-10-10 Last updated: 2013-10-10Bibliographically approved

Open Access in DiVA

fulltext(701 kB)207 downloads
File information
File name FULLTEXT01.pdfFile size 701 kBChecksum SHA-512
0330dd5d46a837e7481ba9fea17f4b496cc97e18c571eef2b9a476285294b2ea3009cacf1d434882eeed6ad83f1af8d6bbf0c2d8018da7e7db01d22bba16360b
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Chen, Ting
By organisation
Communications and Transport SystemsThe Institute of Technology
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 207 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 171 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