Open AccessComparative Analysis of Scheduling Algorithms Performance in a Long Term Evolution Network
Author(s) -
Bamidele Moses Kuboye
Publication year - 2021
Publication title -
journal of computer science research
Language(s) - English
Resource type - Journals
ISSN - 2630-5151
DOI - 10.30564/jcsr.v3i4.3555
Subject(s) - computer science , proportionally fair , quality of service , maximum throughput scheduling , network packet , scheduling (production processes) , packet loss , throughput , term (time) , matlab , toolbox , round robin scheduling , algorithm , computer network , real time computing , dynamic priority scheduling , mathematical optimization , telecommunications , mathematics , wireless , physics , quantum mechanics , programming language , operating system
The advancement in cellular communications has enhanced the special attention given to the study of resource allocation schemes. This study is to enhance communications to attain efficiency and thereby offers fairness to all users in the face of congestion experienced anytime a new product is rolled out. The comparative analysis was done on the performance of Enhanced Proportional Fair, Qos-Aware Proportional Fair and Logarithmic rule scheduling algorithms in Long Term Evolution in this work. These algorithms were simulated using LTE system toolbox in MATLAB and their performances were compared using Throughput, Packet delay and Packet Loss Ratio. The results showed Qos-Aware Proportional Fair has a better performance in all the metrics used for the evaluation.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom