A General Framework for Temporal Fair User Scheduling in NOMA Systems
Shahram Shahsavari, Farhad Shirani, Elza Erkip

TL;DR
This paper introduces a framework for temporal fair user scheduling in NOMA systems, balancing system utility, fairness, and low complexity, using threshold-based strategies and an iterative algorithm.
Contribution
It proposes a novel class of threshold-based scheduling schemes and an algorithm to determine feasible temporal shares in heterogeneous NOMA scenarios.
Findings
Optimal utility achieved with threshold-based strategies.
Variable elimination algorithm for feasible temporal shares.
Effective scheduling demonstrated in static and mobile scenarios.
Abstract
Non-orthogonal multiple access (NOMA) is one of the promising radio access techniques for next generation wireless networks. Opportunistic multi-user scheduling is necessary to fully exploit multiplexing gains in NOMA systems, but compared with traditional scheduling, interrelations between users' throughputs induced by multi-user interference poses new challenges in the design of NOMA schedulers. A successful NOMA scheduler has to carefully balance the following three objectives: maximizing average system utility, satisfying desired fairness constraints among the users and enabling real-time, and low computational cost implementations. In this paper, scheduling for NOMA systems under temporal fairness constraints is considered. Temporal fair scheduling leads to communication systems with predictable latency as opposed to utilitarian fair schedulers for which latency can be highly…
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.
