Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things

By Liang Liu, Erik G. Larsson, Wei Yu, Petar Popovski, Č. Stefanović, E. de Carvalho. IEEE Signal Processing Magazine, 2018

467 citations recorded by the source corpus.

The next wave of wireless technologies will proliferate in connecting sensors, machines, and robots for myriad new applications, thereby creating the fabric for the Internet of Things (IoT). A generic scenario for IoT connectivity involves a massive number of machine-type connections, but in a typical application, only a small (unknown) subset of devices are active at any given instant; therefore, one of the key challenges of providing massive IoT connectivity is to detect the active devices first and then decode their data with low latency. This article advocates the usage of grant-free, rather than grantbased random access schemes to overcome the challenge of massive IoT access. Several key signal processing techniques that promote the performance of the grant-free strategies are outlined, with a primary focus on advanced compressed sensing techniques and their applications for the efficient detection of active devices. We argue that massive multiple-input, multiple-output (MIMO) is especially well suited for massive IoT connectivity because the device detection error can be driven to zero asymptotically in the limit as the number of antennas at the base station (BS) goes to infinity by using the multiplemeasurement vector (MMV) compressed sensing techniques. This article also provides a perspective on several related important techniques for massive access, such as embedding short messages onto the device-activity detection process and the coded random access.

Subfields: Computational Mechanics, Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/2ace2a3eb70914193a9174905f6c89f04f23fcdd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

  1. Robert Schober
  2. Khaled Ben Letaief
  3. Erik G. Larsson
  4. Liang Liu
  5. Jianmin Lu
  6. Jianhua Lu
  7. Yuanming Shi
  8. Zhen Gao

In Computer Networks and Communications

  1. Rui Zhang
  2. Qingqing Wu
  3. Jie Xu
  4. Robert Schober
  5. Derrick Wing Kwan Ng
  6. Yong Zeng
  7. Wei Yu
  8. Liang Liu

In Electrical and Electronic Engineering

  1. Rui Zhang
  2. Robert Schober
  3. Qingqing Wu
  4. Derrick Wing Kwan Ng
  5. Yong Zeng
  6. Jie Xu
  7. Naofal Al-Dhahir
  8. Erik G. Larsson

Citations in the corpus