Massive Access for Future Wireless Communication Systems
Open accessThe DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
Multiple access technology played an important role in wireless communication in the last decades: it increases the capacity of the channel and allows different users to access the system simultaneously. However, the conventional multiple access technology, as originally designed for current human-centric wireless networks, is not scalable for future machine-centric wireless networks. Massive access (studied in the literature under such names as "massive- device multiple access," "unsourced massive random access," "massive connectivity," "massive machine-type communication," and "many-access channels") exhibits a clean break with current networks by potentially supporting millions of devices in each cellular network. The tremendous growth in the number of connected devices requires a fundamental rethinking of the conventional multiple access technologies in favor of new schemes suited for massive random access. Among the many new challenges arising in this setting, the most relevant are: the fundamental limits of communication from a massive number of bursty devices transmitting simultaneously with short packets, the design of low complexity and energy-efficient massive access coding and communication schemes, efficient methods for the detection of a relatively small number of active users among a large number of potential user devices with sporadic transmission pattern, and the integration of massive access with massive MIMO and other important wireless communication technol…
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
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 [183]
Citations
Cites
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 · cited 2×
“By exploiting this sporadic traffic, a compressive sensing-based scheme is proposed to detect user activity and estimate the channels for massive access in massive MIMO systems [11].”
MethodA perspective on massive random-access
Polyanskiy, Y. (2017) · 2017 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006984 · Cited by 490 · cited 15×
“In order to fix this problem, we need to abandon the traditional joint probability of error criterion (dominant in the multiuser information theory literature since the days of Liao, Ahslwede, Cover and Wyner [1]) and introduce per-user probability of error (PUPE) [6].”
BackgroundMethodInfluentialSelf-citationKe, M., Gao, Z., Wu, Y., Gao, X., & Schober, R. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2967175 · Cited by 417 · cited 3×
“Here we provide some simulation results for the massive access in massive MIMO systems in [12].”
BackgroundMethodInfluentialSelf-citationA Coded Compressed Sensing Scheme for Unsourced Multiple Access
Amalladinne, V. K., Chamberland, J., & Narayanan, K. R. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3012948 · Cited by 263
Fengler, A., Haghighatshoar, S., Jung, P., & Caire, G. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3065291 · Cited by 231 · cited 9×
“Extracting the statistical CSI requires collecting a large sample of the received signal energy from each device in the network.”
BackgroundInfluentialSelf-citationLow complexity schemes for the random access Gaussian channel
Ordentlich, O., & Polyanskiy, Y. (2017) · 2017 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006985 · Cited by 215 · cited 6×
“Figure 6 plots the Eb/N0 required by the Ordentlich-Polyanskiy scheme [13], sparse regression code scheme [1], CS-based coding scheme [1], Polar code schemes [1], and relevant benchmarks for k = 100 bits per user, n = 30000 channel uses, Pe = 0.”
BackgroundMethodInfluentialSelf-citationCapacity of Gaussian Many-Access Channels
Chen, X., Chen, T.-Y., & Guo, D. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2668391 · Cited by 140 · cited 5×
“When the number of users goes to infinity, a positive rate as in the classic multiple access channel setup is not achievable [2].”
BackgroundInfluentialEnergy Efficient Coded Random Access for the Wireless Uplink
Kowshik, S. S., Andreev, K., Frolov, A., & Polyanskiy, Y. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.3000635 · Cited by 105
Self-citationRandom Pilot and Data Access in Massive MIMO for Machine-Type Communications
de Carvalho, E., Björnson, E., Sørensen, J. H., Larsson, E. G., & Popovski, P. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2748106 · Cited by 83 · cited 1×
“propose a joint pilot assignment and data transmission protocol for crowded massive MIMO systems, where each user selects a pilot signal in each time slot based on a pseudo-random pilot hopping pattern known at the BS [9].”
BackgroundFundamental Limits of Many-User MAC With Finite Payloads and Fading
Kowshik, S. S., & Polyanskiy, Y. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3091423 · Cited by 77 · cited 2×
“Kowshik and Polyanskiy study the same regime, but consider the effects of Rayleigh fading [8].”
BackgroundSelf-citation
Cited by
Items 201–250 of 250
López, O. L. A., & Alves, H. (2021) · Wiley eBooks · doi:10.1002/9781119718703.biblio
Yang, L., Lu, X., Hu, J., & Yang, K. (2021) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2021-fall52928.2021.9625506
“Massive access which is di ff erent from conventional access is mainly divided into two types: coordinated and uncoor-dinated access [2].”
BackgroundDhanavath, R. K., & Sevyanaik, G. N. (2022) · Wireless Personal Communications · doi:10.1007/s11277-022-09634-w
“The additional portion of the bandwidth is taken outside thereby the essential quality for communication can also be attained at a minimum transmitted power [1].”
BackgroundResource Allocation in Massive Non-Orthogonal Multiple Access System
Zhang, W., Zeng, J. J., & Li, Z. (2022) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-99200-2_17
Simplified Models in Evaluating the Performance of the Non-orthogonal Slotted Aloha Protocol
Han, X., Wang, Q., & Ren, G. (2021) · International Conference on Space-Air-Ground Computing (SAGC) · doi:10.1109/sagc52752.2021.00023
An Improved Design of Concatenated Code Scheme for Massive Random Access
Li, Y., Dong, C., Suo, S., Niu, K., & Lin, J. (2022) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2022-spring54318.2022.9860776
“Generally, l is the index of L simultaneously transmitted users in one slot, so Wl ∈ [2] is the information of user l.”
BackgroundJoint Intra/Inter-Slot Code Design for Unsourced Multiple Access in 6G Internet of Things
Li, Y., Niu, K., Dong, C., Suo, S., & Lin, J. (2022) · Sensors · doi:10.3390/s23010242
“The UMA’s achievability bound was given in [5], laying the foundation for research in this field.”
BackgroundInfluentialMultiband Compact mmW Antenna for 5G Smart Phones
Noorjahan, M. M., Sivanantham, M., Manojraj, M., Sathish, S., & Ravinesan, M. (2023) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-9579
One-Shot Messaging at Any Load Through Random Sub-Channeling in OFDM
Wunder, G., Flinth, A., & Groß, B. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3283063
“Notably, CS together particularly with OFDM still plays a key role in upcoming 6G RACH design [29], see, e.”
BackgroundAn Asynchronous Massive Access Scheme with Dynamic Range Considerations
Liu, L., & Guo, D. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206478
Joint Multi-User Detection with Weighting Factors for Unsourced Multiple Access
Liu, Y., Niu, K., & Li, Y. (2023) · Journal of Computer and Communications · doi:10.4236/jcc.2023.119007
Allocation designs for massive multiple access with interference cancellation
Molina, F. (2021) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-358134
Challenges of Livecast Computing Network: A Contemporary Survey
Zeng, Q., Zhuang, Y., Hai, J., Pan, Q. J., Yin, Z., Chen, Q., & Liang, J. (2023) · International Conference on Networking and Network Applications (NaNA) · doi:10.1109/nana60121.2023.00119
“Billions of user devices are involved in the exchange of information over the Internet [39].”
BackgroundAlgorithm Unrolling for Massive Connectivity in IoT Networks
Zou, Y., Zhou, Y., & Shi, Y. (2024) · Wiley eBooks · doi:10.1002/9781394180523.ch13
Capacity of Many‐Access Channels
Liu, L., & Guo, D. (2024) · Wiley eBooks · doi:10.1002/9781394180523.ch10
Studies on Potential Conflicts of Network Densification in 6G
Ramasamy, V., Maity, S., Priya, N. M., Ganesan, V., Viriyala, S. A. P., Chowdhury, S., & Adhikari, S. (2024) · Algorithms for intelligent systems · doi:10.1007/978-981-99-8976-8_21
Transmitter Filtering-aided Sparse Activity Detection for TDD-based Random Access
Fujimoto, H., Hara, T., & Higuchi, K. (2024) · 2012 International Conference on Computing, Networking and Communications (ICNC) · doi:10.1109/icnc59896.2024.10556248
To Sense or Not To Sense: A Delay Perspective
Zhao, X., & Dai, L. (2024) · International Conference on Communications · doi:10.1109/icc51166.2024.10623027
“Random access, with which nodes independently decide when to transmit in a distributed manner, plays a vital role in Machine-to-Machine (M2M) communications [1].”
BackgroundPerformance of Slotted ALOHA in User-Centric Cell-Free Massive MIMO
Maryopi, D., Adumy, D. A., Musa, O., Jung, P., & Virgono, A. (2024) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc59610.2024.10817232
“Beyond the large number, the main characteristics of this type of communication are the sporadic traffic, short block length, and low-power consumption, which have made its system design rather challenging [2, 3].”
Learning to estimate via group-sparse based algorithm unrolling
Zhou, Y., Zou, Y., Wu, Y., Shi, Y., & Zhang, J. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-322073-9.00013-4
Self-citationEfficient Multi-Stage Active Device Identification for Massive Random Access
Robin, J., & Erkip, E. (2024) · Globecom · doi:10.1109/globecom52923.2024.10901242
Qi, Y., Dang, J., Zhang, Z., Wu, L., & Zhu, B. (2025) · IET Communications · doi:10.1049/cmu2.70034
Performance Analysis on Massive Random-Access Based on Repetition and Post-Encoding Processing
Bai, W., Kang, S., Sun, S., & Chen, S. (2025) · IEEE Access · doi:10.1109/access.2025.3585185
“[5] was a summary.”
A Graph-Based Theoretical Framework and Performance Analysis of Pattern Division Random Access
Pang, L., Wang, P., Li, H., Wang, X., Li, L., & Dai, X. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3608441
Sparse Regression Codes for Covert Communication over Multiple Access Channels
Jiang, H., Wang, Y., Wu, Z., & Zhou, L. (2025) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/iccc65529.2025.11148720
Optimization of urban optical wireless communication systems Using WSM Method
(2025) · Journal on Electronic and Automation Engineering · doi:10.46632/jeae/4/3/1
Enhanced Kalman Filter for Uplink Channel Tracking in Codebook-Reused SCMA-OFDM Systems
Guo, L., Ping, S., Shi, C., Kang, P., & Chen, P. (2025) · International Conference on Electronic Information Technology (EIT) · doi:10.1109/eit67313.2025.11232436
“Massive machine type communication (mMTC) is one of the key application scenarios in current fifth-generation (5G) mobile communication systems that require support for terminal access by a massive number of devices [1-2].”
Balanced-QoS power allocation schemes for nNOMA in the finite blocklength regime
Montefiore, M. C. F., González, G., López Martínez, F. J., & Gregorio, F. (2024) · El Servicio de Difusión de la Creación Intelectual (National University of La Plata)
Angular Correlation-Aware Grant-Free Detection in Multi-Satellite Cooperative Networks
Li, Y., Chen, S., Meng, W., & Wang, J. (2025) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2025.3631055
“In this context, grant-free random access (GF-RA) has emerged as a promising solution, enabling UTs to directly transmit data to the access point (AP) without waiting for grants, thus reducing signaling overhead and latency [8], [9].”
A Massive Grant‐Free Random Access Scheme Based on Spectrum Sensing and Preamble Delay
Zhang, J., Wei, Z., Zhang, Y., Gao, H., Zhao, H., & Zhu, H. (2025) · IET Communications · doi:10.1049/cmu2.70124
User-Centric Cell-Free Massive MIMO Enhanced by Fluid-Antenna Access Points: Uplink Analysis
Olyaee, M., Interdonato, G., & Buzzi, S. (2026) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2026.3732285
“…this property, FA systems have recently been investigated for a wide range of wireless communication scenarios, including point-to-point links, conventional multiple-input multiple-output (MIMO) systems, and, more recently, user-centric cell-free massive MIMO (CF-mMIMO) architectures [3], [6].”
Resource Hopping-Based Pattern Division Multiple Access for 6G Grant-Free Massive MTC System
Zhang, W., Ma, G., Ma, Y., Wang, K., Yang, M., Lu, Y., Yang, J., & Ai, B. (2026) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2026.3656693
Radio-Frequency Fingerprint-Tag-Based Device Authentication for Massive Random Access
Kitagawa, Y., Ogawa, K., Sotohebo, R., Song, G., Kimura, T., Liu, Z., & Cheng, J. (2026) · IEEE Access · doi:10.1109/access.2026.3659838
“Consequently, authenticating devices during random access and supporting a massive number of devices is still a challenging problem [36].”
MD-AirComp+: Adaptive Quantization for Blind Massive Digital Over-the-Air Computation
Qiao, L., Wang, Y., Jiang, H., Liu, X., Xing, Y., Wu, Y., Gao, Z., & Zhou, X. (2026) · Chinese Journal of Electronics · doi:10.23919/cje.2025.00.447
“However, when the receiver focuses on the collective data rather than individual device identities, the paradigm shifts from sourced access to unsourced massive access (UMA) [45], [46], [47], [48].”
Self-citationOptimizing Effectiveness-Aware Information Exchange for Goal-Oriented Semantic Communication
Agheli, P. (2025) · theses.fr (ABES) · doi:10.70675/3d75c3e5z7bdaz494dz9545z3f198c507460
Transmission Prediction Feedback Network Enhanced by Trajectory-Aware Modeling for URLLC
Liu, X., Fu, X., Lu, A.-A., Gong, X., & Gao, X. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3685714
“I N RECENT years, the evolution toward beyond-5G (B5G) and 6G systems has driven the deployment of mission-critical services such as ultrareliable and low-latency communication (URLLC) and the massive Internet of Things (IoT) [1], [2], [3].”
Self-citationZhou, L., & Bai, L. (2026) · Textbooks in telecommunication engineering · doi:10.1007/978-3-032-06627-5_6
Subspace-Constrained Hybrid Generalized Expectation Consistent for Massive Connectivity
Zou, Q., & Zhang, H. (2026) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2026.3693698
Tandem Spreading Multiple Access With Cascaded LT-RS Codes for mMTC in 6G IoT
Wang, K., Ma, G., Ai, B., Wang, G., Ma, Y., Yang, J., Yang, M., Lu, Y., & Shi, G. (2026) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2026.3698120
“This innovation facilitates the deployment of ultra-massive connectivity for machine-type devices (MTDs), supporting device densities exceeding 10 7 devices/km 2 [1], [2], [3], [4].”
Age of Information Constrained Unsourced Random Access
Pazouki, I., & Truhachev, D. V. (2026) · IEEE Communications Letters · doi:10.1109/lcomm.2026.3701665
“URA is well-suited for massive machine-type communications (mMTC), the Internet of Things (IoT), and large-scale sensor networks [2].”
Abdel‐Razeq, S. (2026) · Telecommunication Systems · doi:10.1007/s11235-026-01469-1
Multi-Agent Reinforcement Learning for URLLC Modern Random Access
Boumba, T., Coupechoux, M., & Godlewski, P. (2025) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/gcwkshps68340.2025.11591059
“Following Wu et al. [11], these schemes can be separated into two groups: coordinated and uncoordinated access.”
Decentralized Cascaded Channel Estimation and Active User Detection for RIS-Assisted IoT Networks
Cao, Y. T., Liu, H., Yu, T., Gong, S., Wang, G., & Xing, C. (2026) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2026.3716251
“Specifically, the grant-free random access allows each active UE to transmit a unique non-orthogonal pilot sequence along with its data directly, without waiting for approval from the base station (BS) [7].”
Get, Y., Luo, Y., Chi, Y., Zhao, Y., Guan, Y. L., David González, G., & Ding, Z. (2026) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc69400.2026.11711611
“Therefore, grant-free random access (GFRA) has emerged as a promising access mechanism tailored for enabling low-latency and high-efficiency massive connectivity scenarios [3].”
An ALOHA Massive Machine Type Communication System Based on Blind Source Separation
Carini, A., Godeas, M., Valentini, L., Paolini, E., & Babich, F. (2026) · IEEE Transactions on Communications · doi:10.1109/tcomm.2026.3725056
Ge, Y., Luo, Y., Chi, Y., Guan, Y. L., David González, G., & Ding, Z. J. (2026) · IEEE Transactions on Communications · doi:10.1109/tcomm.2026.3725036
“Therefore, grant-free random access (GFRA) has emerged as a promising access mechanism tailored for enabling low-latency and high-efficiency massive connectivity scenarios [4].”
ODMA-Based MIMO Massive Unsourced Random Access With Soft-Output Polar Codes
Li, T., Zhang, X., Hu, N., Wu, Y., Zhang, W., Xia, X., & Xiao, C. (2026) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2026.3730538
“With the accelerated advancement of digitization in society, the number of Internet-of-Things (IoT) devices will T. Li experience an explosive growth to the scale of hundreds of billions in the next ten years [1].”
Self-citationBalanced-QoS power allocation schemes for NOMA in the finite blocklength regime
Montefiore, M. C. F., González, G., Martinez, F. J. L., & Gregorio, F. (2024) · JAIIO, Jornadas Argentinas de Informática
Fractional Chirp Rate CSS-Based Grant-Free Random Access for LEO Satellite IoT
Cheng, T., Ma, J., Zhang, S., & Dobre, O. A. (2026) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2026.3741589
“Neverthe-less, constructing optimal codebooks for large-scale satellite access remains an open challenge [26].”
Metadata
- Authors
- Wu, Y., Gao, X., Zhou, S., Yang, W., Polyanskiy, Y., & Caire, G.
- Affiliations
- Xidian University (CN)
- Southeast University (CN)
- Tsinghua University (CN)
- Qualcomm (United States) (US)
- Massachusetts Institute of Technology (US)
- Technische Universität Berlin (DE)
- Venue
- IEEE Wireless Communications
- Published
- 2020-08
- Volume
- 27
- Issue
- 4
- Pages
- 148-156
- ISSN
- 1536-1284 (ISSN-L)
- 1558-0687
- OpenAlex
- W3015801342
- Cited by
- 241
- References
- 15
- Citations by year
- 2026: 20 · 2025: 42 · 2024: 42 · 2023: 36 · 2022: 41 · 2021: 42 · 2020: 18
- FWCI
- 11.77
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Wireless Communications (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc-sa)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › IoT Networks and Protocols
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Technologies
- Keywords
- massive access, multiple access, machine-type communication, massive connectivity, unsourced random access, user detection, massive MIMO, fundamental limits
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.