A General Framework for Temporal Fair User Scheduling in NOMA Systems
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 variable. It is shown that optimal system utility is achieved using a class of opportunistic scheduling schemes called threshold based strategies (TBS). One of the challenges in temporal fair scheduling for heterogeneous NOMA scenarios - where only specific users may be activated simultaneously - is to determine the set of feasible temporal shares. In this work, a variable elimination algorithm is proposed to accomplish this task. Furthermore, an (online) iterative algorithm based on the Robbins-Monro method is proposed to construct a TBS by finding the optimal thresholds for a given system utility metric. Various numerical simulations of practical scenarios are provided to illustrate the effectiveness of the proposed NOMA scheduling in static and mobile scenarios.
Code (0)
등록된 구현이 없습니다.
Tasks
FairnessSchedulingSimilar Papers 제목 키워드 기반
Spatio-Temporal Scheduling Prediction Under Backhaul Delay for Resilient Coordinated Beamforming
Coordinated beamforming in distributed 5G networks relies on the timely exchange of inter-cell scheduling information, but backhaul latency makes this information stale. Even a single transmission time interval (TTI) of …
Graph Neural NetworkEquinox: Holistic Fair Scheduling in Serving Large Language Models
We address the limitations of current LLM serving with a dual-counter framework separating user and operator perspectives. The User Fairness Counter measures quality of service via weighted tokens and latency; the Resour…
Fairness-Oriented User Scheduling for Bursty Downlink Transmission Using Multi-Agent Reinforcement Learning
In this work, we develop practical user scheduling algorithms for downlink bursty traffic with emphasis on user fairness. In contrast to the conventional scheduling algorithms that either equally divides the transmission…
Distributed OptimizationFairnessMulti-agent Reinforcement LearningReinforcement Learning (RL)+1Fairness-Aware Scheduling in Multi-Numerology Based 5G New Radio
Multi-numerology waveform based 5G New Radio (NR) systems offer great flexibility for different requirements of users and services. Providing fairness between users is not an easy task due to inter-numerology interferenc…
FairnessSchedulingMulti-User Scheduling in Hybrid Millimeter Wave Massive MIMO Systems
While mmWave bands provide a large bandwidth for mobile broadband services, they suffer from severe path loss and shadowing. Multiple-antenna techniques such as beamforming (BF) can be applied to compensate the signal at…
Scheduling