Completion-time-driven scheduling for uplink NOMA-enabled wireless networks
journal contributionposted on 2020-04-21, 10:42 authored by Maryam Mohsenivatani, Ye Liu, Mahsa DerakhshaniMahsa Derakhshani, Saeedeh Parsaeefard, Sangarapillai LambotharanSangarapillai Lambotharan
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.
- Mechanical, Electrical and Manufacturing Engineering
Published inIEEE Communications Letters
Pages1775 - 1779
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
- AM (Accepted Manuscript)
Rights holder© IEEE
Publisher statementPersonal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.