Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things
Open accessThe DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“The grant-free random access protocol provides a low-latency and low signaling overhead way to detect the active devices, followed by decoding their corresponding information data [75], [182], [183].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [75]
The cited source says what the claim attributes to it.
In the citing paper
“The sparsity in the activity pattern was leveraged to develop the sparse signal processing framework for joint activity detection and channel estimation in grant-free massive access [75].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [75]
In the citing paper
“Sparse signal processing provides a promising modeling framework to simultaneously detect the active devices and estimate their channels [75], [76], which is supported by various efficient algorithms, including the approximate message passing algorithm [184], [185] and DNN algorithm unrolling approach [97], [186].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [75]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas
Marzetta, T. L. (2010) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.092810.091092 · Cited by 6,302
Internet of Things in industries: A survey
Xu, L. D., He, W., & Li, S. (2014) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2014.2300753 · Cited by 5,172
Message-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Marzetta, T. L., Larsson, E. G., Yang, H., & Ngo, H. Q. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9781316799895 · Cited by 1,718
Self-citationLarsson, E. (2016) · International Workshop on Signal Processing Advances in Wireless Communications · doi:10.1109/spawc.2015.7226986 · Cited by 1,425
Self-citationToward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short Packets
Durisi, G., Koch, T., & Popovski, P. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2537298 · Cited by 1,154
Self-citationGeneralized approximate message passing for estimation with random linear mixing
Rangan, S. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6033942 · Cited by 1,103
Group lasso with overlap and graph lasso
Jacob, L., Obozinski, G., & Vert, J.-P. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553431 · Cited by 833
The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
Bayati, M., & Montanari, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2094817 · Cited by 780
Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation
Liu, L., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2818082 · Cited by 686
Self-citationRandom access for machine-to-machine communication in LTE-advanced networks: issues and approaches
Hasan, M., Hossain, E., & Niyato, D. (2013) · IEEE Communications Magazine · doi:10.1109/mcom.2013.6525600 · Cited by 563
Message passing algorithms for compressed sensing: I. motivation and construction
Donoho, D. L., Maleki, A., & Montanari, A. (2010) · IEEE Information Theory Workshop 2010 (ITW 2010) · doi:10.1109/itwksps.2010.5503193 · Cited by 542
Sparse Activity Detection for Massive Connectivity
Chen, Z., Sohrabi, F., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2795540 · Cited by 378
Self-citationThe Noise-Sensitivity Phase Transition in Compressed Sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165823 · Cited by 339
Exploiting Sparse User Activity in Multiuser Detection
Zhu, H., & Giannakis, G. B. (2011) · IEEE Transactions on Communications · doi:10.1109/tcomm.2011.121410.090570 · Cited by 277
Coded random access: applying codes on graphs to design random access protocols
Paolini, E., Stefanovic, C., Liva, G., & Popovski, P. (2015) · IEEE Communications Magazine · doi:10.1109/mcom.2015.7120031 · Cited by 231
Self-citationEfficient High-Dimensional Inference in the Multiple Measurement Vector Problem
Ziniel, J., & Schniter, P. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222382 · Cited by 166
Massive Connectivity With Massive MIMO—Part II: Achievable Rate Characterization
Liu, L., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2818070 · Cited by 155
Self-citationA Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems
Björnson, E., de Carvalho, E., Sørensen, J. H., Larsson, E. G., & Popovski, P. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2660489 · Cited by 152
Self-citationSparse Signal Processing Concepts for Efficient 5G System Design
Wunder, G., Boche, H., Strohmer, T., & Jung, P. (2015) · IEEE Access · doi:10.1109/access.2015.2407194 · Cited by 146
Capacity of Gaussian Many-Access Channels
Chen, X., Chen, T., & Guo, D. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2668391 · Cited by 140
Belief propagation for joint sparse recoveryPreprint
Kim, J., Chang, W., Jung, B. C., et al. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1102.3289 · Cited by 66
Compressive coded random access for massive MTC traffic in 5G systems
Wunder, G., Stefanović, Č., Popovski, P., & Thiele, L. (2015) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2015.7421050 · Cited by 45
Self-citationRRH based massive MIMO with “on the Fly” pilot contamination control
Bursalioglu, O. Y., Wang, C., Papadopoulos, H., & Caire, G. (2016) · International Conference on Communications · doi:10.1109/icc.2016.7511522 · Cited by 43
Random Access in C-RAN for User Activity Detection With Limited-Capacity Fronthaul
Utkovski, Z., Simeone, O., Dimitrova, T., & Popovski, P. (2016) · IEEE Signal Processing Letters · doi:10.1109/lsp.2016.2633962 · Cited by 43
Self-citationOn the fundamental limits of massive connectivity
Yu, W. (2017) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2017.8023482 · Cited by 40
Self-citationDevice Activity and Embedded Information Bit Detection Using AMP in Massive MIMO
Şenel, K., & Larsson, E. G. (2017) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2017.8269163 · Cited by 34
Self-citationCoded Random Access: How Coding Theory Helps to Build Random Access Protocols.Preprint
Paolini, E., Stefanović, Č., Liva, G., et al. (2014) · arXiv (Cornell University) · Cited by 24
Sub-linear time compressed sensing using sparse-graph codes
Xiao, L., Pawar, S., & Ramchandran, K. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282735 · Cited by 22
Piggybacking an Additional Lonely Bit on Linearly Coded Payload Data
Larsson, E. G., & Moosavi, R. (2012) · IEEE Wireless Communications Letters · doi:10.1109/wcl.2012.041612.120093 · Cited by 16
Self-citationŞenel, K., & Larsson, E. G. (2018) · International ITG Workshop on Smart Antennas · Cited by 10
Self-citation
Cited by
Wang, Z., Liu, L., & Cui, S. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3004330 · Cited by 914
Self-citationEdge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“The sparsity in the activity pattern was leveraged to develop the sparse signal processing framework for joint activity detection and channel estimation in grant-free massive access [75].”
BackgroundMethodMassive Access for 5G and Beyond
Chen, X., Ng, D. W. K., Yu, W., Larsson, E. G., Al-Dhahir, N., & Schober, R. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3019724 · Cited by 681
Self-citationCellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G
Vaezi, M., Azari, A., Khosravirad, S. R., Shirvanimoghaddam, M., Azari, M. M., Chasaki, D., & Popovski, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3151028 · Cited by 631
Self-citationWu, Q., Xu, J., Zeng, Y., Ng, D. W. K., Al-Dhahir, N., Schober, R., & Swindlehurst, A. L. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3088681 · Cited by 562
Metadata
- Authors
- Liu, L., Larsson, E. G., Yu, W., Popovski, P., Stefanovic, C., & de Carvalho, E.
- Affiliations
- University of Toronto (CA)
- Uppsala University (SE)
- Stanford University (US)
- Ss. Cyril and Methodius University in Skopje (MK)
- Aalborg University (DK)
- Venue
- IEEE Signal Processing Magazine
- Published
- 2018-09
- Volume
- 35
- Issue
- 5
- Pages
- 88-99
- ISSN
- 1053-5888 (ISSN-L)
- 1558-0792
- OpenAlex
- W2890736047
- Cited by
- 510
- References
- 33
- Citations by year
- 2026: 25 · 2025: 56 · 2024: 70 · 2023: 63 · 2022: 84 · 2021: 84 · 2020: 91 · 2019: 35 · 2018: 2
- FWCI
- 20.29
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Signal Processing Magazine (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- VBN Forskningsportal (Aalborg Universitet) (submittedVersion)
- KTH Publication Database DiVA (KTH Royal Institute of Technology) (submittedVersion, other-oa)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › IoT Networks and Protocols
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Keywords
- grant-free access, massive connectivity, Internet of Things, sparse signal processing, compressed sensing, device detection, massive MIMO, coded random access
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.