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

Direct link
Frame Allocation and Scheduling for Relay Networks in the LTE Advanced Standard
Linköping University, Department of Electrical Engineering, Communication Systems.
2010 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

The use of relays is seen as a promising way to extend cell coverage and increase rates in LTE Advanced networks. Instead of increasing the number of base stations (BS), relays with lower cost could provide similar gains. A relay will have a wireless link to the closest BS as only connection to the core network and will cover areas close to the cell edge or other areas with limited rates.

Performing transmissions in several hops (BS-relay & relay-user) requires more radio resources than using direct transmission. This thesis studies how the available radio resources should be allocated between relays and users in order to maximize throughput and/or fairness. Time and frequency multiplexed backhaul is investigated under a full buffer traffic assumption. It is shown that the system will be backhaul limited and that the two ways of multiplexing will perform equally when maximising throughput and/or fairness. The analysis results in a set of throughput/fairness suboptimal solutions, dependant on how many relays are used per cell. The results are verified by simulations, which also show the limiting effects on throughput caused by interference between relays.

It is also analysed how the resource allocation should be done given non-fullbuffer traffic. A resource allocation that minimises packet delay given a certain number of relays per cell is presented. The analysis is based on queuing theory.

Finally some different schedulers and their suitability for relay networks are discussed. Simulation results are shown, comparing the throughput and fairness of Round Robin, Weighted Round Robin, Proportional Fairness and Weighted Proportional Fairness schemes. It is shown that allocating the resource among the relays according to the number of users served by the relays improves the fairness.

Place, publisher, year, edition, pages
2010. , 64 p.
Keyword [en]
Relay, Resource Allocation, Scheduling, Weighted Proportional Fairness, LTE Advanced
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
URN: urn:nbn:se:liu:diva-54594ISRN: LiTH-ISY-EX--10/4327--SEOAI: diva2:305955
2010-02-22, Algoritmen, Hus B, Linköpings Universitet, Linköping, 13:15 (English)
Available from: 2010-03-26 Created: 2010-03-25 Last updated: 2010-08-24Bibliographically approved

Open Access in DiVA

fulltext(1324 kB)1549 downloads
File information
File name FULLTEXT01.pdfFile size 1324 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Roth, Stefan
By organisation
Communication Systems
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 1549 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

Total: 1751 hits
ReferencesLink to record
Permanent link

Direct link