Completion-Time-Driven Scheduling for Uplink NOMA-Enabled Wireless Networks
2020
Efficient scheduling policy is crucial in wireless
networks due to delay-sensitivity of many emerging applications.
In this work, we consider a joint user pairing and scheduling
(UPaS) scheme for multi-carrier non-orthogonal multiple access
(MC-NOMA)-enabled wireless networks to reduce the maximum
completion time of serving uplink users. The NOMA scheduling
problem is shown to be NP-hard and a shortest processing time
(SPT)-based strategy to solve the same problem within affordable
time and complexity is introduced. The simulation results confirm
the efficacy of the proposed scheduling scheme in terms of
the maximum completion time in comparison with orthogonal
multiple access (OMA) and random NOMA pairing.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
12
References
2
Citations
NaN
KQI