The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Massive Access for Future Wireless Communication Systems
Open accessAbstract
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., & 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 93
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
Edge 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 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].”
BackgroundGrant-Free Non-Orthogonal Multiple Access for IoT: A Survey
Shahab, M. B., Abbas, R., Shirvanimoghaddam, M., & Johnson, S. J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2996032 · Cited by 453
“finite block-length regime [203], [204].”
A Survey on Nongeostationary Satellite Systems: The Communication Perspective
Al-Hraishawi, H., Chougrani, H., Kisseleff, S., Lagunas, E., & Chatzinotas, S. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3197695 · Cited by 376
“On the other hand, the uncoordinated solutions can be generally employed when user terminals have tight power consumption restrictions, limited time of network visibility, and relatively low data rate and QoS requirements [141].”
BackgroundMultiple Access Techniques for Intelligent and Multifunctional 6G: Tutorial, Survey, and Outlook
Clerckx, B., Mao, Y., Yang, Z., Chen, M., Alkhateeb, A., Liu, L., Qiu, M., Yuan, J., Wong, V. W. S., & Montojo, J. I. (2024) · Proceedings of the IEEE · doi:10.1109/jproc.2024.3409428 · Cited by 174
“Grant-free RA is suitable for supporting a massive number of devices with sporadic traffic, e.g., mMTC as in IoT, and can be divided into two different paradigms, namely, sourced and unsourced RA [142], [143].”
BackgroundGenerative AI-Empowered Simulation for Autonomous Driving in Vehicular Mixed Reality Metaverses
Xu, M., Niyato, D. T., Chen, J., Zhang, H., Kang, J., Xiong, Z., Mao, S., & Han, Z. (2023) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2023.3293650 · Cited by 165
“Specifically, AVs continuously generate digital representations during their traveling, which are offloaded to RSUs for remote executions within required deadlines [33], [34].”
Background
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Massive Access for Future Wireless Communication Systems. https://app.cochat.ai/papers/10.1109/mwc.001.1900494
- The paper
- Wu, Y., Gao, X., Zhou, S., Yang, W., Polyanskiy, Y., & Caire, G. (2020). Massive Access for Future Wireless Communication Systems. IEEE Wireless Communications. https://doi.org/10.1109/mwc.001.1900494
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.