Online Backlog-Aware NOMA Random Access With Nested Collision Resolution for Massive IoT Networks

  • Gao, Zhanyang; 
  • Xing, Zhi; 
  • Xie, Huiyang; 
  • Jin, Hu
Citations

SCOPUS

0

초록

This paper investigates a non-orthogonal multiple access (NOMA)-based grant-free random access framework tailored for massive Internet of Things (IoT) networks with highly dynamic and bursty device activation. A nested collision resolution protocol (NCRP) combined with an online transmission control mechanism is developed to efficiently support large-scale machine-type communications. Two resolution schemes, NCRP-A and NCRP-B, are proposed to exploit power-domain diversity for scalable collision splitting. Closed-form expressions for the expected service rate are derived, and the optimal operating points are characterized under a Poisson backlog approximation. Analytical results show that NCRP-B achieves a maximum throughput of 0.752, outperforming conventional dual power multiple access (DPMA)-based schemes. To enable practical deployment without prior backlog knowledge, a Bayesian-inspired online estimation algorithm is introduced to dynamically adjust transmission probabilities at embedded decision points. A burst-aware enhancement is further proposed to improve robustness under synchronized IoT traffic surges. Simulation results under Poisson, machine-type, and interrupted Poisson traffic demonstrate that the proposed framework closely approaches ideal throughput and delay performance while maintaining strong robustness to large-scale and time-varying IoT traffic. © 2026 IEEE. All rights reserved.

키워드

Bayesian estimation; collision resolution; Multi-packet reception; non-orthogonal multiple access; random access
제목
Online Backlog-Aware NOMA Random Access With Nested Collision Resolution for Massive IoT Networks
저자
Gao, Zhanyang; Xing, Zhi; Xie, Huiyang; Jin, Hu
DOI
10.1109/JIOT.2026.3747998
발행일
2026-10
유형
Article in press
저널명
IEEE Internet of Things Journal