Comparative Analysis of Resource Scheduling Algorithms for LTE
dc.contributor.advisor | Yihenew, Wondie (PhD) | |
dc.contributor.author | Semir, Kedir | |
dc.date.accessioned | 2022-02-10T11:15:03Z | |
dc.date.accessioned | 2023-11-04T15:13:03Z | |
dc.date.available | 2022-02-10T11:15:03Z | |
dc.date.available | 2023-11-04T15:13:03Z | |
dc.date.issued | 2021-11 | |
dc.description.abstract | As wireless communication services demand grows, new challenges in the design and operation of cellular networks arise. Despite the fact that LTE cellular wireless network is one of the most well-accepted and fastest-growing technologies in communications, network resources are limited, and they need to be allocated efficiently. As a key design factor in enhancing the performance of LTE systems, managing radio resources is crucial. With the expansion of LTE networks by ethio telecom and their growing usage among all mobile users in the country, the necessity to efficiently manage the available radio resources becomes more and more essential, in order to maintain Quality of Service (QoS) levels. Since the Third Generation Partnership Project (3GPP) does not specify a resource scheduler mechanism, researchers have come up with several approaches either to attain fairness among users or to achieve maximum throughput. This enables wide options in resource allocation, thereby allowing several different scheduling algorithms to flourish, with different aims. Comparing the performance of such algorithms in different scenarios is therefore great interest of this thesis. Henceforth, performance analysis of five existing LTE downlink scheduling schemes; namely Maximum Largest Weighted Delay First (MLWDF), Exponential_Rule (EXP-Rule), Exponential/Proportional Fair (EXP/PF), Logarithmic_Rule (LOG-Rule), and Frame Level Scheduler (FLS) are done in a macro cell with interference environment for both non-real-time and real-time traffic flows. While varying the number of users and user speed, it examines the performance of each scheduling algorithm with respect to throughput, packet loss ratio (PLR), fairness, and energy efficiency. Results show that among the five algorithms considered here, for real-time flow the FLS scheme outperforms the other four schemes in terms of throughput, PLR, and fairness metrics, whereas the rest algorithms perform well for best-effort (BE) flow. | en_US |
dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/30000 | |
dc.language.iso | en_US | en_US |
dc.publisher | Addis Ababa University | en_US |
dc.subject | LTE | en_US |
dc.subject | Downlink scheduling algorithms | en_US |
dc.subject | QoS | en_US |
dc.subject | Fairness | en_US |
dc.subject | Energy efficiency | en_US |
dc.title | Comparative Analysis of Resource Scheduling Algorithms for LTE | en_US |
dc.type | Thesis | en_US |