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
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 180
“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].”
BackgroundIoT data analytics in dynamic environments: From an automated machine learning perspective
Yang, L., & Shami, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105366 · Cited by 131
Tensor-Based Modulation for Unsourced Massive Random Access
Decurninge, A., Land, I., & Guillaud, M. (2020) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2020.3037523 · Cited by 113
“At the physical layer, this requires a departure from the design assumptions prevailing in current cellular systems [1].”
BackgroundResource Allocation for NOMA-Enabled Cognitive Satellite–UAV–Terrestrial Networks With Imperfect CSI
Liu, R., Guo, K., An, K., Zhou, F., Wu, Y., Huang, Y., & Zheng, G. (2023) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2023.3261311 · Cited by 78
“To solve the above challenge, introducing cognitive radio (CR) and non-orthogonal multiple access (NOMA) into satellite-UAV-terrestrial networks is attracting the attention of experts and engineers, which can improve spectrum utilization and cope with the expansion of network scale [5], [6], [7].”
BackgroundSelf-citationA Contemporary Survey on Live Video Streaming from a Computation-Driven Perspective
Dao, N., Tran, A.-T., Tu, N. H., Thanh, T. T., Bao, V. N. Q., & Cho, S. (2022) · ACM Computing Surveys · doi:10.1145/3519552 · Cited by 90
Zhang, Z., Wong, K., Dang, J., Zhang, Z., & Chae, C. (2025) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2025.3608113 · Cited by 73
“Specifically, the information bit per channel use for each user approaches zero with the number of devices growing to infinity [4].”
Massive Access in Space-Based Internet of Things: Challenges, Opportunities, and Future Directions
Jiao, J., Wu, S., Lu, R., & Zhang, Q. (2021) · IEEE Wireless Communications · doi:10.1109/mwc.001.2000456 · Cited by 75
Unveiling the Potential of NOMA: A Journey to Next-Generation Multiple Access
Ahmed, A., Wang, X., Hawbani, A., Yuan, W., Tabassum, H., Liu, Y., Qaisar, M. U. F., Ding, Z., Al‐Dhahir, N., Nallanathan, A., et al. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3521647 · Cited by 88
Grant-Free Access via Bilinear Inference for Cell-Free MIMO With Low-Coherence Pilots
Iimori, H., Takahashi, T., Ishibashi, K., de Abreu, G. T. F., & Yu, W. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3088125 · Cited by 74
On Fundamental Limits of Slow-Fluid Antenna Multiple Access for Unsourced Random Access
Zhang, Z., Wong, K., Dang, J., Zhang, Z., Masouros, C., & Chae, C. (2025) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2025.3594112 · Cited by 56
“URA prophets a random concatenated coding approach, which projects information bits onto a common codebook, resulting in highly favorable spectral and energy efficiency [6], [7].”
Zhou, B., & Saad, W. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3122841 · Cited by 55
“INTRODUCTION Owing to the rapid developments of wireless communication technologies, the next-generation Internet of Things (IoT) will encompass a large number of IoT devices that must send fresh information updates of various real-world physical processes to a myriad of time-critical IoT applications [2], [3].”
BackgroundUnsourced Multiple Access With Random User Activity
Ngo, K., Lancho, A., Durisi, G., & Amat, A. G. I. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3248967 · Cited by 59
“A significant fraction of IoT devices is battery limited and transmits short packets in a sporadic and uncoordinated manner [2], [3].”
Achieving Energy-Efficient Massive URLLC Over Cell-Free Massive MIMO
Zeng, J. J., Wu, T., Song, Y., Zhong, Y., Lv, T., & Zhou, S. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3293008 · Cited by 51
“In addition, for most users, short packet communications lead to considerably different transmission strategies [9].”
BackgroundSelf-citationLi, T., Wu, Y., Zheng, M., Zhang, W., Xing, C., An, J., Xia, X., & Xiao, C. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3145914 · Cited by 50
Self-citationChannel Estimation Performance Analysis of Massive MIMO IoT Systems With Ricean Fading
Liu, P., & Jiang, T. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3033667 · Cited by 47
“S INCE the Internet of Things (IoT) aims to connect everything over the world and massive data is generated by the abundance of IoT devices, the data traffic of IoT is growing exponentially [1], [2].”
BackgroundSparse Kronecker-Product Coding for Unsourced Multiple Access
Han, Z., Yuan, X., Xu, C., Jiang, S., & Wang, X. (2021) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2021.3099285 · Cited by 50
Gao, J., Wu, Y., Shao, S., Yang, W. Q., & Poor, H. V. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3220261 · Cited by 46
“1It should be noted that individual codebook and common codebook assumptions correspond to different massive access models in practice [10].”
BackgroundSelf-citationKe, M., Gao, Z., Zhou, M., Zheng, D., Ng, D. W. K., & Poor, H. V. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3280981 · Cited by 47
“In the simulations, Bc ∈ [4, 8, 16] are investigated, where the corresponding Lp = Lr with”
Algorithm Unrolling for Massive Access via Deep Neural Networks With Theoretical Guarantee
Shi, Y., Choi, H., Shi, Y., & Zhou, Y. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3100500 · Cited by 48
Grant Free Age-Optimal Random Access Protocol for Satellite-Based Internet of Things
Yang, T., Jiao, J., Wu, S., Lu, R., & Zhang, Q. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3171450 · Cited by 44
“codebook to encode their status packets [19].”
Fundamentals of Physical Layer Anonymous Communications: Sender Detection and Anonymous Precoding
Wei, Z., Liu, F., Masouros, C., & Poor, H. V. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3093722 · Cited by 41
“In particular, via the contested manner, the users access the channel based on particular sensing or back-off strategies [23], which has been widely used in ad-hoc networks and cognitive radios.”
BackgroundMassive Unsourced Random Access: Exploiting Angular Domain Sparsity
Xie, X., Wu, Y., An, J., Gao, J., Zhang, W., Xing, C., Wong, K., & Xiao, C. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3153957 · Cited by 45
“, j ∈ [2]) into two sets of sequences: the row index of the equivalent real part is denoted by jre ∈ [2 ] and that of the imaginary part by”
Self-citationGuo, C., Chen, X., Yu, J., & Xu, Z. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3228730 · Cited by 39
“The another scheme is unsourced random access, in which the receiver is only interested in the transmitted data [13], [14], [15], [16], [17].”
BackgroundAge of Incorrect Information in Semantic Communications for NOMA Aided XR Applications
Chen, J., Wang, J., Jiang, C., & Wang, J. (2023) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2023.3282836 · Cited by 39
“However, ultramassive access and real-time synchronization impose more stringent requirements on the capacity and efficiency in XR than those in fifth-generation (5G) [3] [4].”
BackgroundAge of Information in Ultra-Dense IoT Systems: Performance and Mean-Field Game Analysis
Zhou, B., & Saad, W. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2023.3292515 · Cited by 41
“closed-form expression of the average AoI. Note that, in a real-world dense IoT, ALOHA-like random access schemes would result in significant collisions, effectively rendering communication impossible [3], [16]. In this regard, to reduce the collisions suffered by ALOHA schemes, the second group in [21]–[25] considers…”
BackgroundZhang, X., Labeau, F., Hao, L., & Liu, J. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3077569 · Cited by 41
“Massive machine-type communications (mMTC) is an important scenario to support the proliferation of Internet of things (IoT) applications [1].”
BackgroundChen, W., Xiao, H., Sun, L., & Ai, B. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3117358 · Cited by 39
Qamar, F., Kazmi, S. H. A., Ariffin, K. A. Z., Tayyab, M. A., & Nguyễn, Q. N. (2024) · Information · doi:10.3390/info15080442 · Cited by 41
Resource-Hopping-Based Grant-Free Multiple Access for 6G-Enabled Massive IoT Networks
Jang, H. S., Jung, B. C., Quek, T. Q. S., & Sung, D. K. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3064872 · Cited by 33
Joint Activity Detection, Channel Estimation, and Data Decoding for Grant-Free Massive Random Access
Bian, X., Mao, Y., & Zhang, J. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3243947 · Cited by 36
“, user activity detection) at the BS, becomes a new and critical task for grant-free massive RA [12].”
BackgroundInterference Cancellation Algorithms for Grant-Free Multiple Access With Massive MIMO
Valentini, L., Chiani, M., & Paolini, E. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3277891 · Cited by 35
“occurs, in which a myriad of transmitters contend to transmit short data packets to the same receiver over the radio access network [4], [5].”
BackgroundZhang, Z., Dang, J., Morales‐Jiménez, D., Jiang, H., Zhang, Z., Masouros, C., & Chae, C. (2026) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2026.3673148 · Cited by 46
“Massive communication builds upon the concept of massive machine-type communication (mMTC) from International Mobile Telecommunications (IMT)-2020, enabling the connectivity of a vast number of long-lasting devices or sensors for diverse Internet-of-Things (IoT) applications [1], [2].”
Low-Complexity Coding and Spreading for Unsourced Random Access
Truhachev, D. V., Bashir, M., Karami, A., & Nassaji, E. (2020) · IEEE Communications Letters · doi:10.1109/lcomm.2020.3039436 · Cited by 29
“The devices transmit their messages on demand, without a permission (grant) to access the network or pre-allocation of time, bandwidth, or code resources [1], [2].”
BackgroundMassive MIMO: An Overview, Recent Challenges, and Future Research Directions
Abood, T., Hburi, I. S., & Khazaal, H. F. (2021) · International Conference on Advance of Sustainable Engineering and its Application (ICASEA) · doi:10.1109/icasea53739.2021.9733081 · Cited by 28
Next-Generation Multiple Access: From Basic Principles to Modern Architectures
Jorswieck, E. A. (2024) · Proceedings of the IEEE · doi:10.1109/jproc.2024.3412423 · Cited by 34
“Finally, the recent magazine paper [24] examines massive access and the fundamental challenges and gives an overview of the concept of massive access wireless communication and the current research on this important topic.”
Faster Activity and Data Detection in Massive Random Access: A Multiarmed Bandit Approach
Dong, J., Zhang, J., Shi, Y., & Wang, J. H. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3142185 · Cited by 28
Polar Coding and Sparse Spreading for Massive Unsourced Random Access
Zheng, M., Wu, Y., & Zhang, W. (2020) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2020-fall49728.2020.9348654 · Cited by 27
“The study of massive random-access has drawn increasing attention recently as massive machine-type communications (mMTC) is one of the key application scenarios in 5G and beyond [1].”
BackgroundSelf-citationEM-AMP-Based Joint Active User Detection and Channel Estimation in Cell-Free System
Jiang, S., Dang, J., Zhang, Z., Wu, L., Zhu, B., & Wang, L. (2023) · IEEE Systems Journal · doi:10.1109/jsyst.2023.3236954 · Cited by 29
Zhang, Z., Dang, J., Zhang, Z., Wu, L., Zhu, B., & Wu, Y. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3466213 · Cited by 32
“It has been proven that traditional approaches such as ALOHA, TIN have failed to support such system with surging equipment density [8].”
Self-citationFacing to wireless network densification in 6G: Challenges and opportunities
Cho, H., Mukherjee, S., Kim, D.-S., Noh, T., & Lee, J. (2022) · ICT Express · doi:10.1016/j.icte.2022.10.001 · Cited by 27
Energy Efficiency of MIMO Massive Unsourced Random Access With Finite Blocklength
Gao, J., Wu, Y., Li, T., & Zhang, W. (2023) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2023.3242945 · Cited by 28
“AS A TYPICAL use case in future wireless networks, massive machine-type communication has two distinct features different from traditional human-type communication [1], [15].”
Self-citationIntelligent Hybrid Nonorthogonal Multiple Access Relaying for Vehicular Networks in 6G
Jiao, J., He, Y., Wu, S., & Zhang, Q. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3071354 · Cited by 23
Scheduling Versus Contention for Massive Random Access in Massive MIMO Systems
Kang, J., & Yu, W. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3190904 · Cited by 23
“Existing wireless protocols [3] already implement random 41 access, but on a much smaller scale than is envisioned for 42 massive connectivity in IoT and mMTC [4].”
BackgroundMassive Unsourced Random Access for Massive MIMO Correlated Channels
Xie, X., Wu, Y., Gao, J., & Zhang, W. (2020) · Globecom · doi:10.1109/globecom42002.2020.9347959 · Cited by 24
Self-citationDesign of multi-band millimeter wave antenna for 5G smartphones
Shareef, O. A., Sabaawi, A. M. A., Muttair, K. S., Mosleh, M. F., & Almashhdany, M. B. (2022) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v25.i1.pp382-387 · Cited by 21
Nusrat, T., Dawod, F. S., Islam, T., Kunkolienker, P., Roy, S. K., Rahman, M. M., Ghosh, S., Dey, S., Mitra, D., & Braaten, B. D. (2022) · Electronics · doi:10.3390/electronics11203341 · Cited by 23
MSPA: Multislot Pilot Allocation Random Access Protocol for mMTC-Enabled IoT System
Jiao, J., Xu, L., Wu, S., Lu, R., & Zhang, Q. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3081535 · Cited by 19
Diao, L., Wang, H., Li, J., Zhu, P., Wang, D., & You, X. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3282271 · Cited by 21
“On account of the prohibitive signaling overhead and long access latency, the grant-based (GB) access procedure, which was widely used in the scheduling process of long term evolution-advanced (LTE-A), has been gradually replaced by grant-free (GF) access protocols [12].”
MethodMassive Unsourced Random Access for Near-Field Communications
Xie, X., Wu, Y., An, J., Ng, D. W. K., Xing, C., & Zhang, W. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3361529 · Cited by 22
“Despite various efforts have been devoted to the literature, the aforementioned schemes are confined to a single-antenna receiver and their results are typically not applicable to multi-antenna systems due to the impacts of fading and the multi-antenna correlation [2].”
BackgroundSelf-citationUnsourced Random Access via Random Dictionary Learning With Pilot-Free Transceiver Design
Zhang, Z., Dang, J., Zhang, Z., Wu, L., & Zhu, B. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3457611 · Cited by 22
“Particularly, this technique caters to the requirements in a massive machine-type communication (mMTC) scenario [4], where a large number of cheap devices share a fixed channel block length to exchange small data packages.”
SPARC-LDPC Coding for MIMO Massive Unsourced Random Access
Li, T., Wu, Y., Zheng, M., Wang, D., & Zhang, W. (2020) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/gcwkshps50303.2020.9367450 · Cited by 19
“A key feature of these scenarios is that the cellular base station (BS) needs to serve a massive number of users or devices [1].”
Self-citationUplink transmission design for crowded correlated cell-free massive MIMO-OFDM systems
Gao, J., Wu, Y., Wang, Y., Zhang, W., & Wei, F. (2021) · Science China Information Sciences · doi:10.1007/s11432-020-3103-3 · Cited by 19
Self-citationMassive Unsourced Random Access Over Rician Fading Channels: Design, Analysis, and Optimization
Tian, F., Chen, X., Liu, L., & Ng, D. W. K. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3155670 · Cited by 18
He, C., Tian, C., Zhang, C., Feng, D., Pan, C., & Zheng, F. (2020) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2020.2997689 · Cited by 17
“The mode means that the same CUE can be served by multiple RAUs at the same time, which can be achieve by OFDM technology [26].”
BackgroundUnsourced Random Access in MIMO Quasi-Static Rayleigh Fading Channels with Finite Blocklength
Gao, J., Wu, Y., Caire, G., Yang, W., & Zhang, W. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619489 · Cited by 17
“Massive random access is expected to be one of the main use cases in future wireless networks, in which there are a large number of potential users and a fraction of them are active at any given time [1].”
BackgroundSelf-citationUnsourced Random Access: A Comprehensive Survey
Özateş, M., Ahmadi, M. J., Kazemi, M., Gündüz, D., & Duman, T. M. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3637685 · Cited by 28
“On the other hand, with the number of devices within a certain coverage area reaching millions [15], it is not feasible to assign a distinct pilot/preamble to each device, as this would result in prohibitive receiver complexity.”
InfluentialProbabilistic ODMA Receiver With Low-Complexity Algorithm for MIMO Unsourced Random Access
Zhang, Z., Dang, J., & Zhang, Z. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3570708 · Cited by 17
Gao, J., Wu, Y., Caire, G., Yang, W. Q., Poor, H. V., & Zhang, W. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3555398 · Cited by 17
“A key challenge in umMTC scenarios is to enable e ffi cient and reliable random access for large numbers of devices, among which only a small fraction are active and transmit a relatively small amount of information to the base-station (BS) [2].”
Self-citationMassive Uncoordinated Access With Random User Activity
Ngo, K., Lancho, A., Durisi, G., & Amat, A. G. I. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518253 · Cited by 15
Receiver Design for MIMO Unsourced Random Access With Sparse Kronecker-Product Coding
Han, Z., Yuan, X., Xu, C., & Wang, X. (2022) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2022.3216666 · Cited by 16
“M ASSIVE machine-type communication (mMTC) has become one of the most important scenarios in future wireless communications [1], [2].”
BackgroundCode-Domain Collision Resolution Grant-Free Random Access for Massive Access in IoT
Rao, Z., Jiao, J., Wang, Y., Wu, S., Lu, R., & Zhang, Q. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3227569 · Cited by 14
“As the potentially significant performance gains from well-designed codebooks, how to construct the excellent codebooks for massive access is still an open problem [16].”
BackgroundFeng, R., Wang, C., Huang, J., & Gao, X. (2023) · IEEE Vehicular Technology Magazine · doi:10.1109/mvt.2022.3231711 · Cited by 14
“There are also AoA-based precoding/ beamforming techniques that do not need CSI.”
BackgroundSelf-citationAsynchronous MIMO-OFDM Massive Unsourced Random Access With Codeword Collisions
Li, T., Wu, Y., Gao, J., Zhang, W., Xia, X., Ng, D. W. K., & Xiao, C. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3480334 · Cited by 16
“Massive machine-type communications (mMTC), recognized as one of the three pivotal application scenarios in fifth-generation (5G) wireless communications, facilitate connectivity for burgeoning communication services [2].”
BackgroundSelf-citationUncoupled Unsourced Random Access: Exploiting Geographical Diversity of Access Points
Zhang, Z., Dang, J., Zhang, Z., Wu, L., & Zhu, B. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3531912 · Cited by 13
QoS-Driven Satellite Constellation Design for LEO Satellite Internet of Things
Ying, M., Chen, X., Qi, Q., & Zhang, Z. (2025) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2025.3605220 · Cited by 15
“Additionally, DtS communication can offer greater flexibility and mobility, making it a valuable option for applications such as maritime and aerial communication, where continuous connectivity is essential [10].”
Sparse Activity Discovery in Energy Constrained Multi-Cluster IoT Networks Using Group Testing
Robin, J., & Erkip, E. (2021) · International Conference on Communications · doi:10.1109/icc42927.2021.9500808 · Cited by 12
“Moreover, adaptively calibrating each device’s channel is infeasible due to the massive device count [3].”
BackgroundMethodYuan, X., Li, B., Hu, Y., Zhu, Y. P., & Schmeink, A. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3400522 · Cited by 12
“The continuing transition from IoT toward Internet of Everything (IoE) is particularly driving the wireless network to an extremely large scale [12], which may potentially reach a high connection density of 10 million per km 2 [11].”
BackgroundJoint Pattern, Data, and Channel Estimation for Unsourced Random Access in GMAC and MIMO Systems
Zhang, Z., Ahmadi, M. J., Wong, K., Dang, J., Zhang, Z., Masouros, C., & Chae, C. (2026) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2026.3705749 · Cited by 12
“Next-generation multiple access techniques are among the key enablers for supporting massive connectivity [3].”
Dang, J., Zhang, Z., Wu, L., Zhu, B., & Li, C. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3345429 · Cited by 11
“W ITH the proliferation of Internet of Things (IoT) applications, such as smart healthcare, intelligent transportation, and diverse sensor networks, the concept of massive machine-type communications (mMTC), or massive access, has become a vital component of future wireless networks [1], [2].”
BackgroundG-SC-IRSA: Graph-Based Spatially Coupled IRSA for Age-Critical Grant-Free Massive Access
Huang, Y., Jiao, J., Wang, Y., Wu, S., Lu, R., & Zhang, Q. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3232568 · Cited by 11
“Slotted ALOHA [8] is the earliest grant-free random access protocol, with the normalized throughput bottleneck 1 / e ≈ 37% when the number of UEs approaches infin-ity [9].”
BackgroundAge-Critical Frameless ALOHA Protocol for Grant-Free Massive Access
Huang, Y., Jiao, J., Wu, S., Lu, R., & Zhang, Q. (2021) · Globecom · doi:10.1109/globecom46510.2021.9685814 · Cited by 10
Adaptive–Persistent Nonorthogonal Random Access Scheme for URLL Massive IoT Networks
Ebrahimi, M. E., Khamforoosh, K., Amini, M., Sheikhahmadi, A., & Khamfroush, H. (2022) · IEEE Systems Journal · doi:10.1109/jsyst.2022.3190132 · Cited by 11
“Therefore, such applications require novel spectrum-efficient transmission schemes to fulfill their demands [3], [8], [9].”
BackgroundDiao, L., Li, J., Zhu, P., Wang, D., & You, X. (2023) · Information Communication Technologies Conference (ICTC) · doi:10.1109/ictc57116.2023.10154724 · Cited by 10
“) realize massive connections with low latency [3].”
BackgroundSupporting More Active Users for Massive Access via Data-assisted Activity Detection
Bian, X., Mao, Y., & Zhang, J. (2021) · International Conference on Communications · doi:10.1109/icc42927.2021.9500797 · Cited by 12
“As a result, accommodating the maximum number of active devices with minimum degradation of communication performance is widely acknowledged as one of the most fundamental design considerations for grant-free massive access [3], [6], [7].”
BackgroundUnsourced Random Access Under Quasi-Static Fading Channel: A Less-Is-More Strategy
Zhang, Z., Dang, J., & Zhang, Z. (2025) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2025.3603032 · Cited by 12
“Under finite blocklength, the aim to support a large number of devices can be converted into the problem of multiple random access strategy design [4], [5].”
Power Efficient Time-Division Random-Access Model Based in Wireless Communication Networks
Suma, V. (2021) · IRO Journal on Sustainable Wireless Systems · doi:10.36548/jsws.2020.4.003 · Cited by 9
“Several technologies like the narrowband-IoT (NB-IoT) and extended coverage-GSM (EC-GSM) has been developed as evolved LTE and clean-state technologies respectively [5].”
BackgroundMethodEnhanced power choice barring scheme for massive MTCs with grant-free NOMA
Wu, L., Tang, X., Zhang, Z., & Dang, J. (2021) · China Communications · doi:10.23919/jcc.2021.10.009 · Cited by 10
Analyzing and stabilizing multichannel ALOHA with the use of the preamble-based exploration phase
Burkov, A. A., Turlikov, A. M., & Rachugin, R. (2022) · Информационно-управляющие системы · doi:10.31799/1684-8853-2022-5-49-59 · Cited by 9
“Since the number of users is potentially infinite, random access algorithms are assumed [4, 5].”
BackgroundExplainable AI for Spectral Analysis of Electromagnetic Fields
Kalatzis, D., Ploussi, A., Spyratou, E., Panagiotakopoulos, T., EFSTATHOPOULOS, E. P., & Kiouvrekis, Y. (2025) · IEEE Access · doi:10.1109/access.2025.3583944 · Cited by 8
RIS-Assisted Massive Access With Semi-Passive Elements
Cao, Y. T., Xing, C., Wu, Y., An, J., Ng, D. W. K., & Xia, X. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3373224 · Cited by 9
“…communications, a huge challenge of mMTC is that base stations (BSs) are expected to enable massive connectivity for serving an enormous volume of IoT user equipments (UEs), which have the feature of sporadic traffics, i.e., only a small fraction of IoT UEs are active at any given time [4].”
BackgroundSelf-citationAli, Z., & Pamucar, D. (2025) · Systems and Soft Computing · doi:10.1016/j.sasc.2025.200248 · Cited by 8
Qiao, L., Gao, Z., Li, Z., & Gündüz, D. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206560 · Cited by 9
“Recently, grant-free random access has received attention to enable massive access of IoT devices with low signaling overhead and latency [13], where devices can directly transmit their signals without the permission of the base station (BS).”
BackgroundMethodOn Compressed Sensing of Binary Signals for the Unsourced Random Access Channel
Romanov, E., & Ordentlich, O. (2021) · Entropy · doi:10.3390/e23050605 · Cited by 7
“Over the last few years, there has been great interest in developing efficient low-complexity schemes for the unsourced random access channel [3, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15].”
BackgroundKiouvrekis, Y., & Panagiotakopoulos, T. (2025) · Computers · doi:10.3390/computers14090373 · Cited by 7
Zhang, Z., Dang, J., Wong, K., Zhang, Z., & Masouros, C. (2025) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2025-spring65109.2025.11174834 · Cited by 7
“From information theory perspective [2], the users’ average channel capacity will converge to zero as the number of devices approaches infinity, even if other system metrics, such as sum-rate, are satisfactorily optimized.”
Performance Bounds of Coded Slotted ALOHA Over Erasure Channels
Zhang, Z., Niu, K., & Dai, J. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3192092 · Cited by 7
“With the blooming of uncoordinated wireless machine-type communications and the Internet of Things communication paradigms, efficient grant-free medium access control (MAC) protocols have been attracted remarkable attention [1]–[3].”
BackgroundUnsourced Multiple Access With Common Alarm Messages: Network Slicing for Massive and Critical IoT
Ngo, K., Durisi, G., Amat, A. G. I., Popovski, P., Kalør, A. E., & Soret, B. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3325470 · Cited by 10
“In UMA, the receiver decodes the list of transmitted messages without prior knowledge of the identity of the active devices [7], [8], [9], [10], [11].”
BackgroundCoexistence of Human-Type and Machine-Type Communications in Uplink Massive MIMO
Kuai, X., Yuan, X., Yan, W., & Liang, Y. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3018796 · Cited by 7
Nakıp, M., Çakan, E., Rodoplu, V., & Guzelis, C. (2022) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2022.103360 · Cited by 8
Li, P., Wen, X., Liu, H., & Lu, Y. (2022) · Chinese Journal of Aeronautics · doi:10.1016/j.cja.2022.08.014 · Cited by 7
Coded Pattern Unsourced Random Access With Analyses on Sparse Pattern Demapper
Zhang, Z., An, B., Wong, K., Dang, J., Masouros, C., Zhang, Z., & Chae, C. (2025) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2025.3617544 · Cited by 10
“Traditional strategies such as ALOHA, coded slotted ALOHA, CDMA, and treating interference as noise (TIN) become less effective as the number of access users increases [4].”
Enhanced Pilot Design for Collision-Resilient Unsourced Random Access in Massive MIMO
Shi, C., Xie, Z., Kang, P., Cai, X., Guo, L., Fang, Y., & Chen, P. (2026) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2026.3695614 · Cited by 7
“for fifth-generation (5G) and beyond wireless networks [1], [2], [3], [4].”
Kang, Z., He, D., Wang, H., Wang, Z., & Han, Z. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3561270 · Cited by 6
“On the other hand, the widely used authorized random access (RA) protocol requires multiple handshakes to accurately schedule device access, where the excessive signaling overhead and interaction will make it inefficient when a large number of device accesses simultaneously [7].”
Kiouvrekis, Y., Panagiotakopoulos, T., Nousi, E., Filippopoulos, I., Ploussi, A., Spyratou, E., & EFSTATHOPOULOS, E. P. (2025) · IEEE Access · doi:10.1109/access.2025.3564650 · Cited by 6
“With this massive expansion of wireless networks comes a critical need for accurate models that can predict how electromagnetic signals propagate through various environments [45].”
Event-set differential privacy for fine-grained data privacy protection
Wang, T., Yang, W., Ma, X., & Wang, B. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.10.006 · Cited by 6
Self-citationDevelopment of electromagnetic pollution maps utilizing Gaussian process spatial models
Kiouvrekis, Y., Zikas, S., Katis, I., Tsilikas, I., & Filippopoulos, I. (2024) · The Science of The Total Environment · doi:10.1016/j.scitotenv.2024.176907 · Cited by 6
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.