A General Framework for Temporal Fair User Scheduling in NOMA Systems
- 7 March 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 13 (3) , 408-422
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, inter-relations 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 under temporal fairness constraints, optimal system utility is achieved using a class of opportunistic scheduling schemes called threshold based strategies (TBS). One of the challenges in heterogeneous NOMA scenarios - where only specific users may be activated simultaneously - is to determine the set of feasible temporal shares. 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. The algorithm does not require knowledge of the users' channel statistics. Rather, at each time-slot, it has access to the channel realizations in the previous time-slots. Various numerical simulations of practical scenarios are provided to illustrate the effectiveness of the proposed NOMA scheduling in static and mobile scenariosKeywords
All Related Versions
Funding Information
- NYU WIRELESS Industrial Affiliates
- National Science Foundation (EARS-1547332, NeTS-1527750)
This publication has 35 references indexed in Scilit:
- Tropical Fourier–Motzkin elimination, with an application to real-time verificationInternational Journal of Algebra and Computation, 2014
- Opportunistic Scheduling for OFDM Systems with Fairness ConstraintsEURASIP Journal on Wireless Communications and Networking, 2007
- Sum Capacity of Gaussian Vector Broadcast ChannelsIEEE Transactions on Information Theory, 2004
- A framework for opportunistic scheduling in wireless networksComputer Networks, 2003
- Opportunistic beamforming using dumb antennasIEEE Transactions on Information Theory, 2002
- Opportunistic transmission scheduling with resource-sharing constraints in wireless networksIEEE Journal on Selected Areas in Communications, 2001
- Rate control for communication networks: shadow prices, proportional fairness and stabilityJournal of the Operational Research Society, 1998
- A Newton-Raphson Version of the Multivariate Robbins-Monro ProcedureThe Annals of Statistics, 1985
- A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)IEEE Transactions on Information Theory, 1974
- A Stochastic Approximation MethodThe Annals of Mathematical Statistics, 1951