Completion-Time-Driven Scheduling for Uplink NOMA-Enabled Wireless Networks

Maryam Mohsenivatani, Ye Liu, Mahsa Derakhshani*, Saeedeh Parsaeefard, Sangarapillai Lambotharan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


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.

Original languageEnglish
Article number9064811
Pages (from-to)1775-1779
Number of pages5
JournalIEEE Communications Letters
Issue number8
Publication statusPublished - Aug 2020
Externally publishedYes


  • Non-orthogonal multiple access (NOMA)
  • maximum completion time
  • uplink scheduling

Cite this