Semi-Grant-Free NOMA: Ergodic Rates Analysis With Random Deployed Users

Chao Zhang, Yuanwei Liu, Wenqiang Yi, Zhijin Qin, Zhiguo Ding

TL;DR

This paper provides a rigorous mathematical analysis of Semi-Grant-Free (Semi-GF) NOMA, a hybrid communication strategy where "grant-free" users (who transmit spontaneously) share the same frequency channels as "grant-based" users (who have reserved slots). The authors introduce a dynamic protocol that pairs users based on their instantaneous signal strength and derive exact formulas to predict the data rates both user types can achieve in a real-world, randomly deployed network.

What Problem Does This Paper Address?

In the push toward 5G and 6G, two major needs often conflict: stability (for primary users like voice calls) and low latency (for massive IoT sensors or emergency services).

  • Grant-Based (GB) access is the traditional way: a user asks for permission, the base station grants it, and then they transmit. This is stable but slow due to the "handshake" overhead.
  • Grant-Free (GF) access allows users to transmit immediately, which is fast but leads to collisions when multiple devices talk at once.

The "Semi-GF" approach allows these two types to coexist on the same spectrum using Non-Orthogonal Multiple Access (NOMA). However, figuring out exactly how to pair a GF user with a GB user without ruining the connection for either—especially when users are moving around randomly—is a complex mathematical challenge. This paper fills that gap by providing the theoretical performance limits (ergodic rates) for such a system.

Methods

The authors propose and analyze a Dynamic Protocol for user pairing:

  1. Thresholding: The Base Station (BS) broadcasts the instantaneous received power of the GB user.
  2. User Selection: A GF user only attempts to join the channel if its own estimated received power at the BS is lower than the GB user's. This ensures the GB user remains the "strong" user in the NOMA pair, which is critical for the Successive Interference Cancellation (SIC) process at the receiver.
  3. Mathematical Modeling: The authors use stochastic geometry, assuming users are uniformly distributed in a disc around the BS. They employ advanced calculus techniques, including Chebyshev-Gauss quadrature and hypergeometric functions, to turn complex probability integrals into closed-form analytical expressions.

Datasets

As a theoretical paper in communications engineering, it does not use external "big data" sets. Instead, the authors use Monte Carlo simulations to generate synthetic network deployments. They define specific parameters (e.g., a 600m radius cell, 10 MHz bandwidth, -90 dB noise floor, and a path loss exponent of 2.8) to validate that their derived mathematical formulas match simulated reality.

Key Insights and Ideas

  • Instantaneous vs. Average: Unlike previous work that used average channel gains, this paper uses instantaneous power. This is much more relevant for "short packet" communications (like IoT bursts) where the channel might change before an average can even be calculated.
  • The GF Performance Ceiling: One of the most important findings is that GF users have a "maximum" achievable rate. If a GF user pumps out too much power, they might violate the pairing constraint or cause the SIC process to fail, meaning more power doesn't always equal more speed.
  • GB Stability: Conversely, the GB user’s rate increases linearly with its transmit signal-to-noise ratio (SNR) and does not suffer from an "error floor," provided the GF interference is managed correctly.
  • Interference Trade-off: Increasing the transmit power of GF users directly reduces the performance of GB users because the GF signal acts as noise that the GB user cannot fully cancel out.

Key Results

  • Theorems 1 & 2: The paper successfully derives the first closed-form expressions for the ergodic rates of both GB and GF users under this dynamic protocol.
  • Validation: Numerical results show a near-perfect match between the complex analytical formulas and the simulation data.
  • BPCU Metrics: In the tested scenarios, the GB user's rate (measured in Bits Per Channel Use or BPCU) scales steadily with power, while the GF user's rate peaks (e.g., at around 11 BPCU in their specific setup) before declining as transmit power continues to rise.

Limitations and Future Work

  • Single-Cell Focus: The analysis assumes a single base station in a vacuum (a disc). In the real world, "inter-cell interference" from neighboring base stations would add another layer of complexity.
  • Rayleigh Fading: The paper assumes a Rayleigh fading model, which is standard but doesn't account for "Line-of-Sight" scenarios (like Rician fading) common in urban small cells.
  • User Load: The current model assumes one GF user pairs with one GB user. Future work could explore "massive" Semi-GF NOMA, where multiple GF users attempt to occupy a single GB user's resource block simultaneously.

Summary updated

Abstract

Semi-grant-free (Semi-GF) non-orthogonal multiple access (NOMA) enables grant-free (GF) and grant-based (GB) users to share the same resource blocks, thereby balancing the connectivity and stability of communications. This letter analyzes ergodic rates of Semi-GF NOMA systems. First, this paper exploits a Semi-GF protocol, denoted as dynamic protocol, for selecting GF users into the occupied GB channels via the GB user's instantaneous received power. Under this protocol, the closed-form analytical and approximated expressions for ergodic rates are derived. The numerical results illustrate that the GF user (weak NOMA user) has a performance upper limit, while the ergodic rate of the GB user (strong NOMA user) increases linearly versus the transmit signal-to-noise ratio.
BibTeX
@article{zhang2021semi,
  author = {Chao Zhang and Yuanwei Liu and Wenqiang Yi and Zhijin Qin and Zhiguo Ding},
  title = {{Semi-Grant-Free NOMA: Ergodic Rates Analysis With Random Deployed Users}},
  journal = {IEEE Wireless Communications Letters},
  year = {2021},
  doi = {10.1109/lwc.2020.3034725},
}
Figure