Performance Evaluation of Different Scheduling Algorithms in WiMAX
Ala'a Z. Al-Howaide, Ahmad S. Doulat, Yaser M. Khamayseh

TL;DR
This paper evaluates the performance of various scheduling algorithms in WiMAX networks through simulation, aiming to improve resource allocation, network throughput, and delay management.
Contribution
It provides a comparative simulation analysis of multiple scheduling algorithms in WiMAX, highlighting their efficiencies and performance metrics.
Findings
Weighted Fair Queuing outperforms others in throughput
Round-Robin offers lower delay for certain traffic types
Strict Priority can lead to starvation issues
Abstract
Worldwide Interoperability for Microwave Access (WiMAX) networks were expected to be the main Broadband Wireless Access (BWA) technology that provided several services such as data, voice, and video services including different classes of Quality of Services (QoS), which in turn were defined by IEEE 802.16 standard. Scheduling in WiMAX became one of the most challenging issues, since it was responsible for distributing available resources of the network among all users; this leaded to the demand of constructing and designing high efficient scheduling algorithms in order to improve the network utilization, to increase the network throughput, and to minimize the end-to-end delay. In this study, we presenedt a simulation study to measure the performance of several scheduling algorithms in WiMAX, which were Strict Priority algorithm, Round-Robin (RR), Weighted Round Robin (WRR), Weighted…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Network Optimization · Advanced MIMO Systems Optimization · Wireless Communication Networks Research
