User scheduling for opportunistic nonorthogonal random access in finite blocklength IoT networks

Ngoc Phuc Le; Khoa N. Le; Trung Q. Duong

doi:10.1109/JSYST.2022.3206842

User scheduling for opportunistic nonorthogonal random access in finite blocklength IoT networks

Ngoc Phuc Le, Khoa N. Le, Trung Q. Duong

Western Sydney University

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

Abstract

We propose a user-scheduling scheme for uplink opportunistic nonorthogonal random access in a finite blocklength Internet-of-Things (IoT) network. The considered system consists of high-priority IoT (HP-IoT) devices requiring strict quality-of-service (QoS) and low-priority IoT (LP-IoT) devices with delay-tolerance. Active LP-IoT devices opportunistically transmit their data subject to the QoS constraints of the HP-IoTs. We first analyze the sum-throughput achieved by the LP-IoT devices. Next, we devise greedy algorithm and Kuhn–Munkres algorithm-based schemes for user scheduling to maximize the throughput. Numerical results are provided to demonstrate the effectiveness of our proposed scheme over the conventional approach.

Original language	English
Pages (from-to)	1056-1059
Number of pages	4
Journal	IEEE Systems Journal
Volume	17
Issue number	1
DOIs	https://doi.org/10.1109/JSYST.2022.3206842
Publication status	Published - 1 Mar 2023

Bibliographical note

Publisher Copyright:
© 2007-2012 IEEE.

Keywords

Finite blocklength (FBL)
quality-of-service (QoS)
nonorthogonal random access
opportunistic access
throughput

Access to Document

10.1109/JSYST.2022.3206842

Cite this

@article{bd7c67ac4e824fbf808a51533285891f,

title = "User scheduling for opportunistic nonorthogonal random access in finite blocklength IoT networks",

abstract = "We propose a user-scheduling scheme for uplink opportunistic nonorthogonal random access in a finite blocklength Internet-of-Things (IoT) network. The considered system consists of high-priority IoT (HP-IoT) devices requiring strict quality-of-service (QoS) and low-priority IoT (LP-IoT) devices with delay-tolerance. Active LP-IoT devices opportunistically transmit their data subject to the QoS constraints of the HP-IoTs. We first analyze the sum-throughput achieved by the LP-IoT devices. Next, we devise greedy algorithm and Kuhn–Munkres algorithm-based schemes for user scheduling to maximize the throughput. Numerical results are provided to demonstrate the effectiveness of our proposed scheme over the conventional approach.",

keywords = "Finite blocklength (FBL), quality-of-service (QoS), nonorthogonal random access, opportunistic access, throughput",

author = "Le, {Ngoc Phuc} and Le, {Khoa N.} and Duong, {Trung Q.}",

note = "Publisher Copyright: {\textcopyright} 2007-2012 IEEE.",

year = "2023",

month = mar,

day = "1",

doi = "10.1109/JSYST.2022.3206842",

language = "English",

volume = "17",

pages = "1056--1059",

journal = "IEEE Systems Journal",

issn = "1937-9234",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

TY - JOUR

T1 - User scheduling for opportunistic nonorthogonal random access in finite blocklength IoT networks

AU - Le, Ngoc Phuc

AU - Le, Khoa N.

AU - Duong, Trung Q.

PY - 2023/3/1

Y1 - 2023/3/1

N2 - We propose a user-scheduling scheme for uplink opportunistic nonorthogonal random access in a finite blocklength Internet-of-Things (IoT) network. The considered system consists of high-priority IoT (HP-IoT) devices requiring strict quality-of-service (QoS) and low-priority IoT (LP-IoT) devices with delay-tolerance. Active LP-IoT devices opportunistically transmit their data subject to the QoS constraints of the HP-IoTs. We first analyze the sum-throughput achieved by the LP-IoT devices. Next, we devise greedy algorithm and Kuhn–Munkres algorithm-based schemes for user scheduling to maximize the throughput. Numerical results are provided to demonstrate the effectiveness of our proposed scheme over the conventional approach.

AB - We propose a user-scheduling scheme for uplink opportunistic nonorthogonal random access in a finite blocklength Internet-of-Things (IoT) network. The considered system consists of high-priority IoT (HP-IoT) devices requiring strict quality-of-service (QoS) and low-priority IoT (LP-IoT) devices with delay-tolerance. Active LP-IoT devices opportunistically transmit their data subject to the QoS constraints of the HP-IoTs. We first analyze the sum-throughput achieved by the LP-IoT devices. Next, we devise greedy algorithm and Kuhn–Munkres algorithm-based schemes for user scheduling to maximize the throughput. Numerical results are provided to demonstrate the effectiveness of our proposed scheme over the conventional approach.

KW - Finite blocklength (FBL)

KW - quality-of-service (QoS)

KW - nonorthogonal random access

KW - opportunistic access

KW - throughput

UR - https://hdl.handle.net/1959.7/uws:68744

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

U2 - 10.1109/JSYST.2022.3206842

DO - 10.1109/JSYST.2022.3206842

M3 - Article

SN - 1937-9234

SN - 1932-8184

VL - 17

SP - 1056

EP - 1059

JO - IEEE Systems Journal

JF - IEEE Systems Journal

IS - 1

ER -

User scheduling for opportunistic nonorthogonal random access in finite blocklength IoT networks

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this