FINAL VERSION.pdf (223.95 kB)
Download file

Completion-time-driven scheduling for uplink NOMA-enabled wireless networks

Download (223.95 kB)
journal contribution
posted on 21.04.2020, 10:42 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.

History

School

  • Mechanical, Electrical and Manufacturing Engineering

Published in

IEEE Communications Letters

Volume

24

Issue

8

Pages

1775 - 1779

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Version

AM (Accepted Manuscript)

Rights holder

© IEEE

Publisher statement

Personal 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.

Publication date

2020-04-13

ISSN

1089-7798

eISSN

2373-7891

Language

en

Depositor

Dr Mahsa Derakhshani. Deposit date: 15 April 2020