Comparative Study of Packet Scheduling Algorithm in LTE Network
Alaa Omer Najim1, Nor Asilah Wati Abdul Hamid1, Zurina Mohd Hanapi1 & Idawaty Ahmad1 Show affiliations
- Universiti Putra Malaysia, Malaysia
Journal of Computer Science, Volume 13, Issue 12, pp. 756–766 · doi.org/10.3844/jcssp.2017.756.766
Abstract
At present, Long-Term Evolution (LTE) is the most popular Internet access technology because of its robust wireless connectivity that can support data, voice, video and messaging traffic. This advantage has significantly increased the number of users availing themselves of these services through various devices. Such an increase in the number of users has also increased network traffic. Thus, scheduling algorithms are needed to prioritize and distribute available resources among users to improve system performance. Researchers have proposed several algorithms that focus on meeting the Quality of Service requirement for different applications. The current study evaluates the performance of four scheduling algorithms for LTE downlink transmission, namely, proportional fair, exponential PF, exponential rule and log-rule algorithms, in a certain scenario. The performance of these algorithms was evaluated using an LTE-Sim simulator. Simulation results show that the log-rule algorithm outperforms other packet scheduling algorithms in terms of delay, throughput and packet loss ratio when serving Voice-over-Internet Protocol packet data service on the LTE network.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Najim, A. O., Abdul Hamid, N. A. W., Hanapi, Z. M. & Ahmad, I. (2017). Comparative Study of Packet Scheduling Algorithm in LTE Network. Journal of Computer Science, 13(12), 756–766. https://doi.org/10.3844/jcssp.2017.756.766
- Licence
- CC BY 3.0
- Issue
- Volume 13, Issue 12
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
