A Heuristic Scheduling Scheme in Multiuser OFDMA Networks
Zheng Sun, Zhiqiang He, Ruochen Wang, Kai Niu

TL;DR
This paper introduces a heuristic scheduling scheme for multiuser OFDMA networks that balances real-time and non-real-time traffic, improving throughput and fairness across diverse traffic loads.
Contribution
It proposes a novel heuristic scheduling method that assigns priorities to both user types and schedules resources simultaneously, addressing fairness and efficiency.
Findings
Efficiently manages heterogeneous traffic with diverse QoS needs.
Reduces unfairness between real-time and non-real-time services.
Improves overall network throughput under various loads.
Abstract
Conventional heterogeneous-traffic scheduling schemes utilize zero-delay constraint for real-time services, which aims to minimize the average packet delay among real-time users. However, in light or moderate load networks this strategy is unnecessary and leads to low data throughput for non-real-time users. In this paper, we propose a heuristic scheduling scheme to solve this problem. The scheme measures and assigns scheduling priorities to both real-time and non-real-time users, and schedules the radio resources for the two user classes simultaneously. Simulation results show that the proposed scheme efficiently handles the heterogeneous-traffic scheduling with diverse QoS requirements and alleviates the unfairness between real-time and non-real-time services under various traffic loads.
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
