Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM60539
Volume:
10 |
4 |
April 2026
Pages:
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
â This project presents a MATLAB-based simulation for optimizing delay in massive IoT networks using Non-Orthogonal Multiple Access (NOMA). Unlike traditional orthogonal systems, NOMA enables multiple users to transmit simultaneously by allocating different power levels, significantly enhancing spectral efficiency and reducing transmission delay (Ding et al., 2017 [5]; Liu et al., 2018 [6]). We implemented two core components: a user scheduling algorithm based on simplified K-CUT principles to minimize intra-group interference (Yang et al., 2020 [14]) and a power control algorithm using Standard Interference Function (SIF) theory to allocate power while meeting minimum SINR thresholds (Ren et al., 2023 [20]). Delay for each user is modeled using an exponential decay function over multiple iterations, influenced by power levels (Chen et al., 2021 [9]). The final output includes a delay-vs-iteration plot for each user and console outputs of user groups and power allocations. This simulation captures the performance improvements enabled by NOMA-based access, making it a valuable tool for visualizing and validating delay optimization strategies in future IoT systems (Zhai et al., 2019 [2]; Wang et al., 2020 [8]). 2019 [2]; Wang et al., 2020 [8]).
KEYWORDS
Publication Date
4/19/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
0
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...