Sparse Signal Processing for Grant-Free Massive Connectivity A future paradigm for random access protocols in the Internet of Things

被引:376
作者
Liu, Liang [1 ]
Larsson, Erik G. [2 ]
Yu, Wei [1 ,3 ,4 ]
Popovski, Petar
Stefanovic, Cedomir [5 ]
de Carvalho, Elisabeth [6 ,7 ]
机构
[1] Univ Toronto, Toronto, ON, Canada
[2] Linkoping Univ, Linkoping, Sweden
[3] Univ Toronto, Informat Theory & Wireless Commun, Toronto, ON, Canada
[4] Canadian Acad Engn, Ottawa, ON, Canada
[5] Aalborg Univ, Dept Elect Syst, Aalborg, Denmark
[6] Stanford Univ, Stanford, CA 94305 USA
[7] Aalborg Univ, Aalborg, Denmark
关键词
WIRELESS; GRAPHS;
D O I
10.1109/MSP.2018.2844952
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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 grant-based 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 multiple-measurement 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.
引用
收藏
页码:88 / 99
页数:12
相关论文
共 30 条
[1]  
[Anonymous], 2009, P INT C MACH LEARN
[2]  
[Anonymous], P INF THEOR APPL ITA
[3]  
[Anonymous], P 49 AS C SIGN SYST
[4]  
[Anonymous], P IEEE GLOB COMM C G
[5]  
[Anonymous], 2011, Belief propagation for joint sparse recovery
[6]  
[Anonymous], P IEEE INT C COMM IC
[7]  
[Anonymous], P 22 INT ITG WORKSH
[8]   The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing [J].
Bayati, Mohsen ;
Montanari, Andrea .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) :764-785
[9]   A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems [J].
Bjornson, Emil ;
de Carvalho, Elisabeth ;
Sorensen, Jesper H. ;
Larsson, Erik G. ;
Popovski, Petar .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (04) :2220-2234
[10]   Capacity of Gaussian Many-Access Channels [J].
Chen, Xu ;
Chen, Tsung-Yi ;
Guo, Dongning .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (06) :3516-3539