Sparse Signal Processing for Grant-Free Massive IoT Connectivity

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, thus one of the key challenges for providing massive IoT connectivity is to detect the active devices first and then to decode their data with low latency. This article outlines several key signal processing techniques that are applicable to the problem of massive IoT access, focusing primarily on advanced compressed sensing technique and its application for efficient detection of the active devices. We show that massive multiple-input multiple-output (MIMO) is especially well-suited for massive IoT connectivity in the sense that the device detection error can be driven to zero asymptotically in the limit as the number of antennas at the base station goes to infinity by using the multiple-measurement vector (MMV) compressed sensing techniques. The paper also provides a perspective on several related important techniques for massive access, such as embedding of short messages onto the device activity detection process and the coded random access.

[1]  Wei Yu,et al.  On the fundamental limits of massive connectivity , 2017, 2017 Information Theory and Applications Workshop (ITA).

[2]  Jean-Philippe Vert,et al.  Group lasso with overlap and graph lasso , 2009, ICML '09.

[3]  Sundeep Rangan,et al.  Generalized approximate message passing for estimation with random linear mixing , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[4]  Erik G. Larsson,et al.  Device Activity and Embedded Information Bit Detection Using AMP in Massive MIMO , 2017, 2017 IEEE Globecom Workshops (GC Wkshps).

[5]  Andrea Montanari,et al.  The Noise-Sensitivity Phase Transition in Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[6]  Holger Boche,et al.  Sparse Signal Processing Concepts for Efficient 5G System Design , 2014, IEEE Access.

[7]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[8]  Gerhard Wunder,et al.  Compressive coded random access for massive MTC traffic in 5G systems , 2015, 2015 49th Asilomar Conference on Signals, Systems and Computers.

[9]  Erik G. Larsson,et al.  Joint User Activity and Non-Coherent Data Detection in mMTC-Enabled Massive MIMO Using Machine Learning Algorithms , 2018, WSA.

[10]  Zoran Utkovski,et al.  Random Access in C-RAN for User Activity Detection With Limited-Capacity Fronthaul , 2017, IEEE Signal Processing Letters.

[11]  Wu He,et al.  Internet of Things in Industries: A Survey , 2014, IEEE Transactions on Industrial Informatics.

[12]  Emil Björnson,et al.  A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems , 2016, IEEE Transactions on Wireless Communications.

[13]  Andrea Montanari,et al.  The dynamics of message passing on dense graphs, with applications to compressed sensing , 2010, ISIT.

[14]  Jong Chul Ye,et al.  Belief propagation for joint sparse recovery , 2011, ArXiv.

[15]  Wei Yu,et al.  Sparse Activity Detection for Massive Connectivity , 2018, IEEE Transactions on Signal Processing.

[16]  Kannan Ramchandran,et al.  Sub-linear time compressed sensing using sparse-graph codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[17]  Giuseppe Caire,et al.  RRH based massive MIMO with “on the Fly” pilot contamination control , 2016, 2016 IEEE International Conference on Communications (ICC).

[18]  Petar Popovski,et al.  Coded Random Access: How Coding Theory Helps to Build Random Access Protocols , 2014, ArXiv.

[19]  Philip Schniter,et al.  Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem , 2011, IEEE Transactions on Signal Processing.

[20]  Thomas L. Marzetta,et al.  Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas , 2010, IEEE Transactions on Wireless Communications.

[21]  Andrea Montanari,et al.  Message passing algorithms for compressed sensing: I. motivation and construction , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[22]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[23]  Erik G. Larsson,et al.  Piggybacking an Additional Lonely Bit on Linearly Coded Payload Data , 2012, IEEE Wireless Communications Letters.

[24]  Georgios B. Giannakis,et al.  Exploiting Sparse User Activity in Multiuser Detection , 2011 .

[25]  Wei Yu,et al.  Massive Connectivity With Massive MIMO—Part II: Achievable Rate Characterization , 2017, IEEE Transactions on Signal Processing.

[26]  Dusit Niyato,et al.  Random access for machine-to-machine communication in LTE-advanced networks: issues and approaches , 2013, IEEE Communications Magazine.

[27]  Xu Chen,et al.  Capacity of Gaussian Many-Access Channels , 2016, IEEE Transactions on Information Theory.

[28]  Wei Yu,et al.  Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation , 2017, IEEE Transactions on Signal Processing.

[29]  Petar Popovski,et al.  Towards Massive, Ultra-Reliable, and Low-Latency Wireless Communication with Short Packets , 2015 .

[30]  Andrea Montanari,et al.  Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.