The University of Southampton
University of Southampton Institutional Repository

Grant-free NOMA: a low-complexity power control through user clustering

Grant-free NOMA: a low-complexity power control through user clustering
Grant-free NOMA: a low-complexity power control through user clustering

Non-orthogonal multiple access (NOMA) has emerged as a promising solution to support multiple devices on the same network resources, improving spectral efficiency and enabling massive connectivity required by ever-increasing Internet of Things devices. However, traditional NOMA schemes operate in a grant-based fashion and require channel-state information and power control, which hinders its implementation for massive machine-type communications. Accordingly, this paper proposes synchronous grant-free NOMA (GF-NOMA) frameworks that effectively integrate user equipment (UE) clustering and low-complexity power control to facilitate the power-reception disparity required by the power-domain NOMA. Although single-level GF-NOMA (SGF-NOMA) designates an identical transmit power for all UEs, multi-level GF-NOMA (MGF-NOMA) groups UEs into partitions based on the sounding reference signals strength and assigns partitions with different identical power levels. Based on the objective of interest (e.g., max–sum or max–min rate), the proposed UE clustering scheme iteratively admits UEs to form clusters whose size is dynamically determined based on the number of UEs and available resource blocks (RBs). Once the UEs are acknowledged with power levels and allocated RBs through random-access response (RAR) messages, UEs can transmit anytime without grant acquisition. Numerical results show that the proposed GF-NOMA frameworks can compute clusters in the order of milliseconds for hundreds of UEs. The MGF-NOMA can reach up to 96–99% of the optimal benchmark max–sum rate, and the SGF-NOMA reaches 87% of the optimal benchmark max–sum rate at the same power consumption. Since the MGF-NOMA and optimal benchmark enforce the strongest and weakest channel UEs to transmit at maximum and minimum transmit powers, respectively, the SGF-NOMA also offers a significantly higher energy consumption fairness and network lifetime as all UEs consume equal transmit powers. Although the MGF-NOMA delivers an inferior max–min rate performance, the SGF-NOMA is shown to reach 3e6 MbpJ energy efficiency compared to the 1e7 MbpJ benchmark.

clustering, grant-free, Internet of Things, machine-type communications, massive connectivity, non-orthogonal multiple access, power domain, resource allocation, user pairing
1424-8220
Celik, Abdulkadir
f8e72266-763c-4849-b38e-2ea2f50a69d0
Celik, Abdulkadir
f8e72266-763c-4849-b38e-2ea2f50a69d0

Celik, Abdulkadir (2023) Grant-free NOMA: a low-complexity power control through user clustering. Sensors, 23 (19), [8245]. (doi:10.3390/s23198245).

Record type: Article

Abstract

Non-orthogonal multiple access (NOMA) has emerged as a promising solution to support multiple devices on the same network resources, improving spectral efficiency and enabling massive connectivity required by ever-increasing Internet of Things devices. However, traditional NOMA schemes operate in a grant-based fashion and require channel-state information and power control, which hinders its implementation for massive machine-type communications. Accordingly, this paper proposes synchronous grant-free NOMA (GF-NOMA) frameworks that effectively integrate user equipment (UE) clustering and low-complexity power control to facilitate the power-reception disparity required by the power-domain NOMA. Although single-level GF-NOMA (SGF-NOMA) designates an identical transmit power for all UEs, multi-level GF-NOMA (MGF-NOMA) groups UEs into partitions based on the sounding reference signals strength and assigns partitions with different identical power levels. Based on the objective of interest (e.g., max–sum or max–min rate), the proposed UE clustering scheme iteratively admits UEs to form clusters whose size is dynamically determined based on the number of UEs and available resource blocks (RBs). Once the UEs are acknowledged with power levels and allocated RBs through random-access response (RAR) messages, UEs can transmit anytime without grant acquisition. Numerical results show that the proposed GF-NOMA frameworks can compute clusters in the order of milliseconds for hundreds of UEs. The MGF-NOMA can reach up to 96–99% of the optimal benchmark max–sum rate, and the SGF-NOMA reaches 87% of the optimal benchmark max–sum rate at the same power consumption. Since the MGF-NOMA and optimal benchmark enforce the strongest and weakest channel UEs to transmit at maximum and minimum transmit powers, respectively, the SGF-NOMA also offers a significantly higher energy consumption fairness and network lifetime as all UEs consume equal transmit powers. Although the MGF-NOMA delivers an inferior max–min rate performance, the SGF-NOMA is shown to reach 3e6 MbpJ energy efficiency compared to the 1e7 MbpJ benchmark.

Text
sensors-23-08245-v2 - Version of Record
Available under License Creative Commons Attribution.
Download (763kB)

More information

Accepted/In Press date: 29 September 2023
Published date: 4 October 2023
Keywords: clustering, grant-free, Internet of Things, machine-type communications, massive connectivity, non-orthogonal multiple access, power domain, resource allocation, user pairing

Identifiers

Local EPrints ID: 505760
URI: http://eprints.soton.ac.uk/id/eprint/505760
ISSN: 1424-8220
PURE UUID: 11865ecb-5104-4366-8556-8b7157e3165e
ORCID for Abdulkadir Celik: ORCID iD orcid.org/0000-0001-9007-9979

Catalogue record

Date deposited: 17 Oct 2025 16:46
Last modified: 18 Oct 2025 02:18

Export record

Altmetrics

Contributors

Author: Abdulkadir Celik ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×