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

Maryam Mohsenivatani; Ye Liu; Mahsa Derakhshani; Saeedeh Parsaeefard; Sangarapillai Lambotharan

doi:10.1109/LCOMM.2020.2987639

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

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

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

57 Downloads (Pure)

Abstract

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 language	English
Article number	9064811
Pages (from-to)	1775-1779
Number of pages	5
Journal	IEEE Communications Letters
Volume	24
Issue number	8
Early online date	13 Apr 2020
DOIs	https://doi.org/10.1109/LCOMM.2020.2987639
Publication status	Published - Aug 2020

Keywords

Non-Orthogonal Multiple Access (NOMA)
maximum completion time ,
uplink scheduling
maximum completion time
Non-orthogonal multiple access (NOMA)

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Science Applications
Modelling and Simulation

Access to Document

10.1109/LCOMM.2020.2987639

final_versionAccepted author manuscript, 242 KB

Cite this

@article{69d24ddedbf542f08c9a23738f759089,

title = "Completion-Time-Driven Scheduling for Uplink NOMA-Enabled Wireless Networks",

abstract = "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 = "Non-Orthogonal Multiple Access (NOMA), maximum completion time ,, uplink scheduling, maximum completion time, Non-orthogonal multiple access (NOMA)",

author = "Maryam Mohsenivatani and Ye Liu and Mahsa Derakhshani and Saeedeh Parsaeefard and Sangarapillai Lambotharan",

year = "2020",

month = aug,

doi = "10.1109/LCOMM.2020.2987639",

language = "English",

volume = "24",

pages = "1775--1779",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers",

number = "8",

}

TY - JOUR

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

AU - Mohsenivatani, Maryam

AU - Liu, Ye

AU - Derakhshani, Mahsa

AU - Parsaeefard, Saeedeh

AU - Lambotharan, Sangarapillai

PY - 2020/8

Y1 - 2020/8

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

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

KW - Non-Orthogonal Multiple Access (NOMA)

KW - maximum completion time ,

KW - uplink scheduling

KW - maximum completion time

KW - Non-orthogonal multiple access (NOMA)

UR - http://www.scopus.com/inward/record.url?scp=85089934315&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2020.2987639

DO - 10.1109/LCOMM.2020.2987639

M3 - Article

VL - 24

SP - 1775

EP - 1779

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 8

M1 - 9064811

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this