Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Scheduling and link adaptation in the downlink of OFDM based Cellular networks
KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
2005 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Resource allocation and link adaptation are of major importance in radio communication systems.  In this paper, we study them for the downlink of OFDM based cellular networks, using a transmission bandwidth of 20MHz.Concerning the resource allocation problem, we consider the performance of the Round Robin algorithm, the Maximum C/I algorithm and the Proportional Fair algorithm.  Furthermore, we propose an iterative algorithm that can be viewed as an enhancement to the Maximum C/I algorithm.  Upon that, we try to reallocate resources in order to provide fairness among the users.  We develop a cost function that shows us the cost of an allocation scheme for all users, while we try within the iterative algorithm to minimize the total cost. All algorithms, but the Round Robin algorithm, adapt to both channel’s time and frequency variations. We propose a simple link adaptation algorithm, which adapts to channel conditions -both in time and frequency-and assigns modulation and coding scheme to a user, according to his average channel quality.  It serves in maximization of the throughput, while maintaining the Packet Error Rate lower than 0.01.We study the above algorithms in a multi-cell radio network simulator.  We apply a traffic model with Poisson arrival pattern.  The performance measure studied is the user’s average packet delay and upon this we define capacity as the maximum load where 95% of users have an average packet delay lower than50msec. Results show that channel depended allocation can outperform the Round Robin algorithm by more than 80% in terms of capacity.  The Maximum C/I algorithm performs better than the Proportional Fair algorithm by 7%. Moreover, implementing the proposed enhancement, we observe a further increase incapacity of 8%.

Place, publisher, year, edition, pages
2005.
Series
TRITA-S3-RST, 0410
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-28022OAI: oai:DiVA.org:kth-28022DiVA: diva2:383812
Uppsok
Technology
Supervisors
Examiners
Available from: 2011-03-11 Created: 2011-01-06 Last updated: 2015-01-09Bibliographically approved

Open Access in DiVA

No full text

By organisation
Communication Systems, CoS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 83 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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