Practical Scheduling Algorithms with Contiguous Resource Allocation for Next-Generation Wireless Systems
Shu Sun, Sungho Moon

TL;DR
This paper introduces three practical contiguous resource scheduling algorithms for 5G and beyond, enhancing efficiency and standard compliance while maintaining near-optimal throughput and packet loss performance.
Contribution
It presents three novel contiguous FDRA scheduling algorithms that are standards-compliant, computationally efficient, and effective under various traffic loads.
Findings
All algorithms achieve near-optimal throughput and packet loss rates.
The first algorithm performs well even with many users.
Algorithms are suitable for 5G and beyond wireless systems.
Abstract
This paper proposes three novel resource and user scheduling algorithms with contiguous frequency-domain resource allocation (FDRA) for wireless communications systems. The first proposed algorithm jointly schedules users and resources selected adaptively from both ends of the bandwidth part (BWP), while the second and third ones apply disjoint user and resource selection with either single-end or dual-end BWP strategies. Distinct from existing contiguous FDRA approaches, the proposed ones comply with standards specifications for fifth-generation (5G) and beyond 5G communications, and have lower computational complexity hence are more practical. Simulation results show that all of the proposed algorithms can achieve near-optimal performance in terms of throughput and packet loss rate for low to moderate traffic load, and the first one can still perform relatively well even with a large…
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.
