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.
- Non-Orthogonal Multiple Access (NOMA)
- maximum completion time ,
- uplink scheduling
Mohsenivatani, M., Liu, Y., Derakhshani, M., Parsaeefard, S., & Lambotharan, S. (2020). Completion-Time-Driven Scheduling for NOMA-Enabled Wireless Networks. IEEE Communications Letters, (In-press), (In-press). https://doi.org/10.1109/LCOMM.2020.2987639