Performance Analysis of NOMA for Ultra-Reliable and Low-Latency Communications
Muhammad Amjad, Leila Musavian

TL;DR
This paper evaluates the performance of grant-free NOMA in URLLC scenarios, focusing on short packet transmission, finite blocklength effects, and queueing-delay, providing analytical insights validated by simulations.
Contribution
It introduces a finite blocklength analysis of NOMA for URLLC, deriving effective bandwidth and error probabilities considering queueing and transmission constraints.
Findings
Transmission error probability increases with SNR requirements.
Queueing-delay violation probability depends on QoS exponent.
Finite blocklength significantly impacts system performance.
Abstract
Grant-free non-orthogonal multiple access (NOMA) has been regarded as a key-enabler technology for ultra-reliable and low-latency communications (URLLC). In this paper, we analyse the performance of NOMA with short packet communications for URLLC. In this regard, the overall packet loss probability consists of transmission error probability and queueing-delay violation probability. Queueing-delay has been modelled using the effective bandwidth. Due to short transmission time, the infinite block-length has been replaced with finite blocklength of the channel codes which rules out the application of Shannon's formula. The achievable effective bandwidth of the system is derived, and then, the transmission error probability has been analysed. The derivations are validated through extensive simulations, which shows the variations of the signal-to-noise ratio (SNR) requirements of the system…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
