Performance analysis of packet scheduling algorithms for long term evolution (LTE)

Xue, M

Performance analysis of packet scheduling algorithms for long term evolution (LTE)

Xue, M

Permalink

Publication Type:: Thesis
Issue Date:: 2010

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download contents and abstractAdobe PDF (3.82 MB)

Adobe PDF

Download thesisAdobe PDF (39.93 MB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Xue, M
dc.date.accessioned	2014-09-26T04:04:52Z
dc.date.available	2014-09-26T04:04:52Z
dc.date.issued	2010
dc.identifier.uri	http://hdl.handle.net/10453/29878
dc.description	University of Technology, Sydney. Faculty of Engineering and Information Technology.	en_US
dc.description.abstract	The third generation partnership project long term evolution (3GPP LTE) system is proposed as a new radio access technology in order to support high-speed data and multimedia traffic. The 3GPP LTE system has a flat radio access network architecture consisting of only one node, known as eNodeB, between user and core network. All radio resource management (RRM) functions are performed at the eNodeB. As one of the essential RRM functions, packet scheduling is responsible for the intelligent allocation of radio resources for active users. Since there is a diversity of the traffic types in wireless systems, active users may have different Quality of Service (QoS) requirements. In order to satisfy various QoS requirements and efficiently utilize the radio resources, a packet scheduler adopts a specific packet scheduling algorithm when making decisions. Several packet scheduling algorithms have been proposed in the literature. The objective of this thesis is to evaluate the performance of the well-known and some recently proposed packet scheduljng algorithms and identify the suitability of these algorithms in the downlink LTE system. The perfonnance evaluation of packet scheduling algorithms based on both computer simulation and theoretical analysis is provided in this thesis. The performance of packet scheduling algorithms is evaluated in three scenarios including 100% RT scenario, 100% NRT scenario and 50% RT and 50% NRT scenario under the downlink LTE simulation environment. The simulation results for wellknown packet scheduling algorithms show that Maximum-Largest Weighted Delay First (M-LWDF) outperforms other algorithms in the 100% RT scenario, while Exponential/Proportional Fair (EXP/PF) is comparatively more suitable in the 50% RT and 50% NRT scenario. In the 100% NRT scenario, Proportional Fair (PF) and Maximum Rate (Max-Rate) achieve a good throughput and resource block (RB) utilization performance while Round Robin (RR) has the best fairness performance. Additionally, two recently proposed algorithms are evaluated and can be considered as the packet scheduling candidates. The simulation results show that Sun Qiaoyun' s Algorithm is more appropriate than Jeongsik Park's Algorithm for the downlink LTE supporting the real-time traffic. The mathematical model for performance evaluation of the packet scheduling algorithms in the downlink L TE system is discussed in this thesis. The theoretical delay analysis for OFDMA system and the theoretical throughput analysis of PF algorithm is studied and validated in detail. This thesis moves further to theoretical performance analysis of M-L WDF and obtains the analytical result of the expected throughput of M- WDF.	en_US
dc.format	Thesis (ME)	en_US
dc.language.iso	en	en_US
dc.relation	https://opus.lib.uts.edu.au/bitstream/10453/29878/9/02Whole.pdf
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	The author owns the copyright in this thesis including all reproduction and reuse rights for the work. The work may not be altered without the permission of the copyright owner. Attribution is essential when quoting or paraphrasing from this thesis.
dc.rights	au.edu.uts.lib/ppc
dc.title	Performance analysis of packet scheduling algorithms for long term evolution (LTE)	en_US
dc.type	Thesis
utslib.copyright.status	open_access

Abstract:

The third generation partnership project long term evolution (3GPP LTE) system is proposed as a new radio access technology in order to support high-speed data and multimedia traffic. The 3GPP LTE system has a flat radio access network architecture consisting of only one node, known as eNodeB, between user and core network. All radio resource management (RRM) functions are performed at the eNodeB. As one of the essential RRM functions, packet scheduling is responsible for the intelligent allocation of radio resources for active users. Since there is a diversity of the traffic types in wireless systems, active users may have different Quality of Service (QoS) requirements. In order to satisfy various QoS requirements and efficiently utilize the radio resources, a packet scheduler adopts a specific packet scheduling algorithm when making decisions. Several packet scheduling algorithms have been proposed in the literature. The objective of this thesis is to evaluate the performance of the well-known and some recently proposed packet scheduljng algorithms and identify the suitability of these algorithms in the downlink LTE system. The perfonnance evaluation of packet scheduling algorithms based on both computer simulation and theoretical analysis is provided in this thesis. The performance of packet scheduling algorithms is evaluated in three scenarios including 100% RT scenario, 100% NRT scenario and 50% RT and 50% NRT scenario under the downlink LTE simulation environment. The simulation results for wellknown packet scheduling algorithms show that Maximum-Largest Weighted Delay First (M-LWDF) outperforms other algorithms in the 100% RT scenario, while Exponential/Proportional Fair (EXP/PF) is comparatively more suitable in the 50% RT and 50% NRT scenario. In the 100% NRT scenario, Proportional Fair (PF) and Maximum Rate (Max-Rate) achieve a good throughput and resource block (RB) utilization performance while Round Robin (RR) has the best fairness performance. Additionally, two recently proposed algorithms are evaluated and can be considered as the packet scheduling candidates. The simulation results show that Sun Qiaoyun' s Algorithm is more appropriate than Jeongsik Park's Algorithm for the downlink LTE supporting the real-time traffic. The mathematical model for performance evaluation of the packet scheduling algorithms in the downlink L TE system is discussed in this thesis. The theoretical delay analysis for OFDMA system and the theoretical throughput analysis of PF algorithm is studied and validated in detail. This thesis moves further to theoretical performance analysis of M-L WDF and obtains the analytical result of the expected throughput of M- WDF.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/29878