Grant-Free Random Access for Massive IoT Networks

196 concepts148 papers1 proposal

In traditional cellular networks, before a device can transmit a single byte of data, it must perform a coordinated dance with the base station. This process—known as a grant-based access protocol—requires a multi-step handshake. The device requests permission to transmit, the base station schedules the resources, and finally, a "grant" is issued.

While this centralized coordination works beautifully for high-throughput, continuous streams of data like video calls, it completely breaks down in the era of the Internet of Things (IoT) and massive machine-type communications (mMTC).

The Handshake Bottleneck

The fundamental issue with grant-based access in massive IoT networks is an imbalance between control overhead and actual data. As Xianbin Wang et al. point out in Grant-Free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things, the control signaling required for scheduling and resource allocation often dwarfs the size of the actual data payload. A smart meter or environmental sensor might only need to send a few bytes of data every hour, yet the energy and bandwidth consumed by the request-grant handshake can exceed the requirements of the data transmission itself.

When millions of devices attempt to connect sporadically, this coordination phase becomes a severe bottleneck. As described by Liang Liu et al. in Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things, the sheer volume of simultaneous handshake requests can easily overwhelm available control channels, leading to massive latency and network congestion. This latency penalty is exacerbated in long-delay scenarios, such as Low Earth Orbit (LEO) satellite-based IoT networks, where the propagation delay makes multi-step handshakes completely prohibitive, a challenge highlighted by Keke Ying et al. in Quasi-Synchronous Random Access for Massive MIMO-Based LEO Satellite Constellations.

The Grant-Free Paradigm

To eliminate this signaling overhead, researchers have shifted toward grant-free random access. In a grant-free architecture, devices skip the handshake entirely. When a device has data to send, it simply transmits its payload along with a unique identification sequence (or pilot) immediately, without waiting for explicit permission from the base station.

Grant-Based Access (Traditional):
Device   --- Request --->  Base Station
Device   <--- Grant -----  Base Station
Device   --- Data ------>  Base Station  (High Overhead)

Grant-Free Access:
Device   --- Pilot + Data ---> Base Station (Zero Handshake)

By removing the coordination phase, grant-free access drastically reduces latency and saves precious battery life for low-power sensors. However, this introduces a major signal processing challenge at the receiver: if devices can transmit at any time without coordination, how does the base station know which devices are currently active, what their wireless channels look like, and how to decode their interleaved data?

Why It Works: Exploiting Sparsity

The reason grant-free massive access is mathematically and practically viable comes down to a single key concept: sporadic user activity.

Even if a network contains millions of deployed IoT devices, only a tiny fraction (typically less than 1% to 5%) will be active at any given millisecond. This means that the vector of device activity is highly sparse. Because of this inherent sparsity, the receiver can transform an otherwise intractable multi-user detection problem into a compressed sensing or sparse recovery problem.

Instead of assigning an orthogonal pilot sequence to every single device—which is impossible because the number of orthogonal sequences is limited by the packet length—devices are assigned unique, non-orthogonal signature sequences.

In Massive Connectivity With Massive MIMO - Part I: Device Activity Detection and Channel Estimation, Liang Liu demonstrates that when the base station is equipped with a massive number of antennas (Massive MIMO), the law of large numbers causes the random channels of different devices to become asymptotically orthogonal. This phenomenon, known as channel hardening, allows the base station to perfectly identify the sparse subset of active devices and estimate their channels simultaneously, even when they share the same frequency and time slots using non-orthogonal signatures.

Joint Activity Detection and Data Decoding

To make grant-free access work in practice, the receiver must execute three tasks at once: Joint Activity Detection, Channel Estimation, and Data Decoding (JACD).

To minimize the length of the pilot sequences and maximize spectral efficiency, modern approaches exploit the underlying physical structures of the wireless medium:

  • Low-Rank and Angular Sparsity: In high-frequency bands like millimeter-wave (mmW) and Terahertz (THz), signals travel along a very limited number of spatial paths. Xiaodan Shao et al. leverage this in Joint Activity Detection and Channel Estimation for mmW/THz Wideband Massive Access by designing a Multi-Rank Aware Sparse (MRAS) algorithm. By exploiting the "jointly sparse and low-rank" structure of wideband channels in the angular domain, the authors drastically reduce the required pilot sequence lengths.
  • Iterative Turbo Receivers: Rather than treating activity detection and data decoding as isolated steps, advanced receivers pass information back and forth. For example, Xinyu Bian et al. in Joint Activity Detection and Data Decoding in Massive Random Access via a Turbo Receiver propose an architecture that iteratively exchanges "soft" probabilistic information between a signal detector and a channel decoder. This allows the data payload itself to help refine the accuracy of the activity detection.
  • Hybrid Semi-Grant-Free Protocols: To ease the transition from legacy networks, hybrid protocols have emerged. Zhiguo Ding et al. introduce this concept in Simple Semi-Grant-Free Transmission Strategies Assisted by Non-Orthogonal Multiple Access, where opportunistic grant-free IoT users are permitted to share channels already reserved for high-priority grant-based users. By utilizing Non-Orthogonal Multiple Access (NOMA) principles, the base station can decode both signals without compromising the reliability of the primary user.

By shifting the burden of coordination from a pre-transmission handshake to advanced sparse signal processing at the receiver, grant-free random access provides a scalable, low-latency foundation for the billions of sporadic connections defining the future of the Internet of Things.

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 155 papers
  2. Version 1 · 2026-10-04 · 205 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_signaling_overhead_grant_based_signaling_1ebebe3a,
  title = {signaling overhead (grant-based signaling overhead)},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/signaling-overhead-grant-based-signaling-overhead/rdr_1ebebe3a1a9641f9b2f379730cf58c27},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 2, frozen text):

@misc{lacuna_signaling_overhead_grant_based_signaling_1ebebe3a_v2,
  title = {signaling overhead (grant-based signaling overhead)},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/signaling-overhead-grant-based-signaling-overhead/rdr_1ebebe3a1a9641f9b2f379730cf58c27/v/2},
  note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake