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 101–200 of 250
Age of Information in Ultra-Dense Computation-Intensive Internet of Things (IoT) Systems
Zhou, B., & Saad, W. (2021) · International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) · doi:10.23919/wiopt52861.2021.9589799 · Cited by 6
“Note that, as next generation IoTs will encompass a large number of IoT devices [12], it is of great importance to investigate the AoI performance for ultra-dense computation-intensive IoT systems.”
BackgroundDelay Analysis of Reservation Based Random Access: A Tandem Queue Model
Hui, H., & Chen, W. (2022) · Globecom · doi:10.1109/globecom48099.2022.10001084 · Cited by 6
“To address the massive connectivity, random access technologies have been recognized as a promising solution to provide massive access control for a large number of devices with limited communication resources [3].”
BackgroundNon-Coherent Active Device Identification for Massive Random Access
Robin, J., & Erkip, E. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3300914 · Cited by 6
“Restrictions apply. access strategies result in excessive preamble collisions drastically increasing the signaling overheads and transmission delays [8], [25].”
BackgroundBiSPARCs for Unsourced Random Access in Massive MIMO
Agostini, P., Utkovski, Z., & Stańczak, S. (2023) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf59524.2023.10477087 · Cited by 6
“Such grant-free access requires a departure from the design assumptions prevailing in current cellular systems, which has sparked the development of novel random access schemes [1].”
BackgroundZhang, Z., Dang, J., & Zhang, Z. (2025) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/iccc65529.2025.11148951 · Cited by 7
“In application scenarios such as massive machine-type communications (mMTC) [5], [6], where massive connectivity necessitates timely sensing and reliable communication services, multiple access remains a challenging area [7].”
Zak-OTFS-based coded random access for uplink mMTC
Mirri, A., Khammammetti, V., Dabak, B., Paolini, E., Narayanan, K. R., & Calderbank, R. (2026) · Journal on Advances in Signal Processing · doi:10.1186/s13634-025-01286-9 · Cited by 5
“To address this challenge of massive multiple access (MMA) [4], [5], grant-free random access schemes [6], [7], [8] have gained increasing attention, as they allow devices to transmit autonomously, whenever new The Duke team is supported in part by the National Science Foundation under grants…”
Performance Analysis of Random Access NOMA for Critical mIoT With Timer-Power Back-Off Strategy
Amini, M., Al-Habashna, A., Wainer, G., & Boudreau, G. (2023) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2023.3257107 · Cited by 5
“The transmission reliability R is defined as the probability that a typical packet transmitted (5) from an IoT node is received successfully at the BS (i.e. without any decoding errors 8 ).”
BackgroundDesign and Analysis of Massive Uncoupled Unsourced Random Access With Bayesian Joint Decoding
Tian, F., Chen, X., Guan, Y. L., & Yuen, C. (2024) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2024.3377716 · Cited by 6
“To be spe-cific, in the unsourced random access protocol, the base station (BS) only focuses on the recovery of transmitted messages, but is not concerned about the identities and channel states of active devices which sent the messages [10], [11], [12].”
BackgroundFederated Learning With Massive Random Access
Xia, S., Shi, Y., Zhou, Y., Wu, Y., Yang, L. F., & Letaief, K. B. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3405451 · Cited by 5
“Random access protocols can be divided into two categories, i.e., grant-based random access and grant-free random access [17].”
BackgroundSelf-citationQi, Y., Dang, J., Zhang, Z., Zhang, Z., Wu, L., & Wu, Y. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3465488 · Cited by 6
Self-citationAchievable Second-Order Asymptotics for MAC and RAC With Additive Non-Gaussian Noise
Wang, Y., Bai, L., Wu, Z., & Zhou, L. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3570647 · Cited by 5
“However, in certain practical scenarios [18], [19], the user activities could be unpredictable.”
Indoor Massive IoT Access Relying on Millimeter-Wave Extra-Large-Scale MIMO
Qiao, L., Liao, A., Gao, Z., & Wang, H. (2023) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc55385.2023.10118760 · Cited by 5
“Massive Internet-of-Things (IoT) access is one of the key features of future sixth-generation (6G) communication networks [1].”
BackgroundJoint Activity-Delay Detection and Channel Estimation for Asynchronous Massive Random Access
Bian, X., Mao, Y., & Zhang, J. (2023) · Globecom · doi:10.1109/globecom54140.2023.10436887 · Cited by 8
Gorce, J.-M., Mary, P., Anade, D., & Kélif, J.-M. (2021) · Sensors · doi:10.3390/s21030715 · Cited by 5
“From this perspective the capacity, or the capacity region in case of multi-user communications, becomes less important in regard to other metrics [2,3].”
BackgroundLi, Y., Chen, S., Meng, W., & Li, C. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3363704 · Cited by 5
“W ITH the rapid development of the Internet of Things (IoT), the next-generation wireless networks tend to evolve from conventional networks tailored for human-type communications (HTCs) to networks designed to connect everything [1].”
BackgroundGuaranteed Private Communication With Secret Block Structure
Costa, M. F. D., Li, J., & Mitra, U. (2024) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2024.3433527 · Cited by 7
“Many massive access communication schemes rely on sporadic channel traffic [39] to allow more robust decoding on the receiver side, even from an under-determined channel output.”
BackgroundCao, Y. T., Xing, C., Ni, W., Gong, S., Zhao, N., & Niyato, D. T. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3578806 · Cited by 6
“Characterized by massive connectivity, low power, and broad coverage, mMTC serves a vast number of IoT devices in a sporadic transmission mode, where a minor portion of devices are activated to transmit short packets [5], [6].”
Hu, Y., Wang, D., Xia, X., Li, J., Zhu, P., & You, X. (2025) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2025.3615587 · Cited by 4
“Unlike coordinated schemes, grant-free non-orthogonal multiple access (NOMA) allows devices to transmit data without allocated resources.”
Zhang, Z., Wong, K., Dang, J., Zhang, Z., Masouros, C., & Chae, C. (2026) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2026.3657304 · Cited by 6
Fresh multiple access: A unified framework based on large models and mean-field approximations
Hui, H., Wei, S., & Chen, W. (2023) · Journal of Communications and Networks · doi:10.23919/jcn.2023.000044 · Cited by 4
Feedback-Aided Coded Random Access With Intentional Power Unbalance
Valentini, L., Mirri, A., & Paolini, E. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3437480 · Cited by 6
Meng, H., Zheng, L., Yang, C., Chen, J., Deng, X., & Wang, J. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3540972 · Cited by 4
“In addition, the rapid development of the Internet of Things in recent years has put forward higher requirements for the communication of a large number of low-complexity mobile terminals [2], [3], [4], [5].”
Sparsity-Exploiting Channel Estimation for Unsourced Random Access With Fluid Antenna
Zhou, K., Zhang, Z., Dang, J., Sun, Q., & Zhang, Z. (2025) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2025-spring65109.2025.11174462 · Cited by 4
“Unsourced random access (URA) techniques [1] address multiple access challenges in the context of massive machine-type communications with finite blocklengths.”
An Achievability Bound of Energy Per Bit for Stabilized Massive Random Access Gaussian Channel
Burkov, A. A., Shneer, S., & Turlikov, A. M. (2020) · IEEE Communications Letters · doi:10.1109/lcomm.2020.3023461 · Cited by 4
“An overview of studies containing research in this area is given in [6] and [7].”
BackgroundAn Investigation on Cloud Computing Adoption Within Information Technology Companies
Mohammadi, A., Saeedikondori, A., Nezakati, H., Sabermajidi, N., & Jantan, A. H. (2021) · Advances in educational technologies and instructional design book series · doi:10.4018/978-1-7998-8327-2.ch016 · Cited by 5
Uniquely Decodable Multi-Amplitude Sequence for Grant-Free Multiple-Access Adder Channels
Yu, Q., & Song, K.-X. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2023.3267792 · Cited by 6
“The major difference between a grant-free coordinated multiple-access and an uncoordinated multiple-access is relayed on the dedicated signature [4].”
BackgroundLISP-MM: Efficient LISP-Based Mobility Management in Software Defined Vehicular Networks
Cui, J., Li, M., Chen, H., Fan, C., Zhang, J., Zhong, H., Bolodurina, I. P., & He, D. (2024) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2024.3366887 · Cited by 4
An SCMA-Based Grant-Free Access Scheme
Mirri, A., Forlivesi, D., Valentini, L., Chiani, M., & Paolini, E. (2024) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc57260.2024.10570968 · Cited by 4
“…of the Internet of Things (IoT) in many application domains has posed a challenge for next-generation wireless networks to uphold massive machine-type communications (mMTC), i.e., massive connectivity from smart devices with sporadic activity and mild reliability and latency requirements [1].”
BackgroundJuwari, J., & Asyhari, M. Y. (2022) · Journal of Information System Research (JOSH) · doi:10.47065/josh.v3i2.1275 · Cited by 4
Wang, Y., Zhu, X., Lim, E. G., Wei, Z., Jiang, Y., & Gan, L. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3167093 · Cited by 4
Design a MIMO printed dipole antenna for 5G sub-band applications
Najm, H. S., Mosleh, M. F., & Abd‐Alhameed, R. A. (2022) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v27.i3.pp1649-1660 · Cited by 4
Liu, T., Wang, X., Xin, Y., & Yang, X. (2023) · Electronics · doi:10.3390/electronics12194015 · Cited by 4
Orthogonal Matching Non-Negative Least Squares for Activity Detection in Unsourced Random Access
Dang, J., Zhang, Z., Zhang, Z., Wu, L., & Zhu, B. (2024) · IEEE Communications Letters · doi:10.1109/lcomm.2024.3374757 · Cited by 4
“Thereupon, activity detection (AD) on codewords has a tight correlation with URA [4], [5].”
BackgroundContention Based Massive Access Scheme for B5G: A Compressive Sensing Method
Bai, Y., Chen, W., Ai, B., & Zhong, Z. D. (2020) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc48107.2020.9148341 · Cited by 4
“The coordinated multiple access methods, such as code division multiple access (CDMA), rely on dedicated protocols to co-ordinate the active users to handle contention, failing to meet the requirement of high overloading factor under the limitation of numbered resources [4].”
MethodMassive SIMO System Based on Energy Difference Detection in Rician Channels
Meng, H., Zheng, L., Yang, C., Chen, J., Deng, X., & Wang, J. (2022) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2022-fall57202.2022.10012831 · Cited by 3
“Even with 200-300 receiving antennas, the number of concurrent Mobile Stations (MS) that can be supported is only 2-3, and the signal to interference-plus-noise ratio (SINR) was difficult to meet the detection requirements [1]–[3].”
BackgroundRazzaque, A. B. A., & Baiocchi, A. (2025) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2025.3621589 · Cited by 4
“Massive applications are characterized by highly variable traffic profiles, possibly limited amount of data delivered in each interaction, requirements ranging from low delay to high reliability and energy efficiency [3], [4], [5], [6], [7].”
Finite-blocklength information theory
Gao, J., Chen, S., Wu, Y., Liu, L., Caire, G., Poor, H. V., & Zhang, W. (2026) · Fundamental Research · doi:10.1016/j.fmre.2025.12.032 · Cited by 8
“…and reliable random access for a large number of users (comparable to or larger than the blocklength), among which only a fraction is active and trans-mits a short packet (e.g., several hundred bits) to the base-station (BS) under limited channel uses and stringent energy constraints [112–114] .”
Self-citationGoal-Oriented Multiple Access Connectivity for Networked Intelligent Systems
Agheli, P., Παππάς, Ν., & Kountouris, M. (2024) · IEEE Communications Letters · doi:10.1109/lcomm.2024.3415711 · Cited by 6
“Despite some prior work [2]–[7], the problem of goal-oriented multiple access and update provision remains mostly unexplored.”
BackgroundPolar-Coded Tensor-Based Unsourced Random Access With Soft Decoding
Fang, J., Liang, Y., Sun, G., Hou, H., Wang, Y., You, L., & Wang, W. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3554633 · Cited by 4
“W ITH the approaching era of the Internet-of-Things (IoT), it is anticipated that the sixth generation (6G) wireless networks will provide massive machine-type communications (mMTC) services, such as sensing, monitoring, and reporting [1], [2], [3].”
Xu, Y., Wang, X., Jiang, W., Guan, X., Shi, M., Hu, W., & Yi, L. (2025) · Optics Express · doi:10.1364/oe.558237 · Cited by 3
Sparse and Dense: An Achievable Region for Code-Domain NOMA with Mixed Users
Zaidel, B. M., & Shamai, S. S. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517908 · Cited by 3
Effective Rate of Multiuser NOMA Systems with Imperfect SIC for Beyond 5G Applications
Montefiore, M. C. F., González, G. J., López‐Martínez, F. J., & Gregorio, F. (2021) · Workshop on Information Processing and Control · doi:10.1109/rpic53795.2021.9648512 · Cited by 3
“In the case of mMTC, it is intended to provide connectivity to a massive number of low-power, low-cost, low-complexity devices [6].”
BackgroundPolar-Slotted ALOHA Over Slot Erasure Channel
Zhang, Z., Niu, K., Dai, J., & Dong, C. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3204321 · Cited by 3
“MASSIVE machine-type communication (mMTC) has been widely recognized as an essential component of the upcoming cellular communications [1].”
BackgroundMethodResultInfluentialActive User Identification in Fast Fading Massive Random Access Channels
Robin, J., & Erkip, E. (2023) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw55543.2023.10161612 · Cited by 3
“In dense M2M networks, grant-based random access (RA) results in excessive preamble collisions drastically increasing the signaling overheads whereas grant-free schemes suffer from severe co-channel interference due to the non-orthogonality of preambles [8].”
BackgroundA Graph-Based Collision Resolution Scheme for Asynchronous Unsourced Random Access
Li, T., Wu, Y., Zhang, W., Xia, X., & Xiao, C. (2023) · Globecom · doi:10.1109/globecom54140.2023.10437166 · Cited by 3
“A IMING to provide massive connectivity for the burgeoning communication services with short packets and sporadic traffic, massive machine-type communications (mMTC) has been a pivotal application scenario in the fifth-generation (5G) wireless communication [1].”
BackgroundSelf-citationHu, Y., Wang, Q., Wang, D., Xia, X., & You, X. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3423335 · Cited by 3
“Compared to human-type communication (HTC), mMTC’s characteristics include uplink traffic primarily consisting of very short data packets [1], using little or without granted signaling for data transmission [2] and sparse user activity [3].”
BackgroundGraph-Based Random Sampling for Massive Access in IoT Networks
Zhai, S., Li, G., Qi, Z., & Zhang, G. (2020) · Globecom · doi:10.1109/globecom42002.2020.9348082 · Cited by 3
“In order to meet the fast-growing demands on massive connectivity in the Internet-of-Things (IoT), massive access technique is receiving increasing attention [1], [2].”
BackgroundAge of Information in Ultra-Dense IoT Systems with Noisy Channels: With and Without Feedback
Zhou, B., & Saad, W. (2021) · International Conference on Communications · doi:10.1109/icc42927.2021.9500426 · Cited by 3
Signal power and energy-per-bit optimization problems in systems mMTC
Burkov, A. A. (2021) · Информационно-управляющие системы · doi:10.31799/1684-8853-2021-5-51-58 · Cited by 3
Islam, K. N., & Rajesh, K. P. (2024) · Asian Conference on Intelligent Technologies (ACOIT) · doi:10.1109/acoit62457.2024.10939912 · Cited by 2
“Over the past few decades, there has been a substantial surge in the popularity of wireless communication technologies, with each new iteration of network technology [1].”
Frame-Asynchronous Coded Slotted ALOHA with MDS Component Codes
Mirri, A., & Paolini, E. (2025) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc61545.2025.10978554 · Cited by 3
“This challenge, known as massive multiple access (MMA) [6], requires the development of innovative medium access control (MAC) protocols.”
Srinivas, C. V. V. S., & Borugadda, S. (2025) · Transactions on Emerging Telecommunications Technologies · doi:10.1002/ett.70235 · Cited by 2
Unsourced Random Access for mmWave Massive MIMO-OFDM Over Doubly-Selective Channel
Hu, Y., Wang, D., Xia, X., Li, J., & Zhu, P. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3611011 · Cited by 2
Tensor-Based Unsourced Random Access for LEO Satellite Internet of Things
Kang, Z., He, D., Wang, H., Yuan, W., & Quek, T. Q. S. (2025) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2025.3612505 · Cited by 3
“Compared to the grant-based random access (GB-RA), which requires multiple handshakes and excessive signaling overhead, GF-RA successively improves the access efficiency by avoiding the complex access request especially in large-scale access scenarios [7].”
Liu, X., Gong, X., & Fu, X. (2025) · Entropy · doi:10.3390/e27111111 · Cited by 2
“However, due to the large scale, sporadic activity, and short data packet transmission characteristic of IoT devices, traditional grant-based random access methods, which rely on negotiation and resource allocation, can lead to heavy signaling overhead and high transmission latency [3].”
Zak-OTFS: A Predictable Physical Layer for Communications and Sensing
Mattu, S. R., Mehrotra, N., Khammammetti, V., & Calderbank, R. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3725989 · Cited by 2
“Our discussion thus far has assumed separable filters with the same functional structure in delay and Doppler (i.e., w ( τ, ν ) = w ( τ ) tx ( τ ) w ( ν ) tx ( ν ) with w ( τ ) tx ( τ ) = w ( ν ) tx ( ν )).”
Valentini, R., Marco, P. D., & Santucci, F. (2021) · Sensors · doi:10.3390/s21155070 · Cited by 2
“In this context, the need of protocols that require minimum overhead and simplified access mechanism has pushed forward the design of uncoordinated random access solutions [2] based on slotted-ALOHA strategies in combination with the Non-orthogonal Multiple Access (NOMA) paradigm [3–5].”
MethodA Fast Charging Icon-shaped Slotted Patch Antenna for Bluetooth/Wi-Fi/WiMAX Applications
Paul, L. C., Ankan, S. S. A., Shezan, S. A., Mahmud, M. Z., & Samsuzzaman, M. (2021) · International Conference on Computer and Information Technology (ICCIT) · doi:10.1109/iccit54785.2021.9689815 · Cited by 2
Pilot Sequences Aided Spatial Modulation for Grant-Free Multiple Access Systems
Yang, C.-Y., Yu, Q., & Zhang, Y. (2023) · IEEE Communications Letters · doi:10.1109/lcomm.2023.3328902 · Cited by 2
“G RANT-FREE multiple-access (GFMA) is an appealing technique, since it can avoid resource pre-allocation and obtain low-latency transmission [1].”
MethodTian, F., Chen, X., Huang, C., & Zhang, Z. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3399265 · Cited by 2
“Herein, the BS is only interested in the transmitted messages and not concerned about the identities or channel states of active UEs [9], [10], [11].”
BackgroundEigenvalue-Based Active User Enumeration for Grant-Free Access Under Carrier Frequency Offsets
Hara, T. (2025) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2025.3529829 · Cited by 2
“F UTURE wireless communication systems are required to support time-sensitive applications, such as robot control and automated driving, which involve sporadic data traffic due to massive short-packet communications [1]–[3].”
Removing Impulsive Noise for Unsourced Massive Random Access via A Practical Inexact ADMM
Chen, Y., He, H., Qi, L., & Zhang, X. (2025) · Optimization and Engineering · doi:10.1007/s11081-025-09998-5 · Cited by 2
“…random access, also named as massive access, massive-device multiple access, massive connectivity, and massive machine-type communication, has the potential to support millions of devices in each cellular network (Chen et al. 2021, 2022; Jiang and Wang 2023; Wu et al. 2020; Xie et al. 2022).”
Toward Efficient Device Identification in Massive Random Access: A Multi-Stage Approach
Robin, J., & Erkip, E. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3593618 · Cited by 2
“The sparse nature of the active device set renders the compressed sensing techniques suitable for active device identification [9].”
Energy-efficiency of Massive Random Access with Individual Codebook
Gao, J., Wu, Y., & Zhang, W. (2020) · Globecom · doi:10.1109/globecom42002.2020.9348157 · Cited by 2
“The infinite payload assumption in classical multiuser information theory will result in infinite energy-per-bit when K and n go to infinity with a fixed rate, which is not suitable for practice mMTC systems [1].”
InfluentialSelf-citationHardware impaired modify-and-forward relaying with relay selection: Reliability and security
Peng, H., Qi, H., Li, X., Ding, Y., Wu, J., & Menon, V. G. (2021) · Physical Communication · doi:10.1016/j.phycom.2021.101315 · Cited by 2
A Tensor-Based Approach to Massive Random Access
Decurninge, A., Land, I., & Guillaud, M. (2020) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf51394.2020.9443284 · Cited by 2
“At the physical layer, such grantfree access requires a departure from the design assumptions prevailing in current cellular systems, as discussed in detail in [1].”
BackgroundUnsourced Random Access with a Massive MIMO Receiver: Exploiting Angular Domain Sparsity
Xie, X., & Wu, Y. (2021) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/iccc52777.2021.9580441 · Cited by 3
Self-citationPerformance Analysis of Irregular Repetition Slotted Aloha with Multi-Cell Interference
Srivatsa, C. R., & Murthy, C. R. (2022) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc51304.2022.9833941 · Cited by 2
“Assigning mutually orthogonal pilots to users avoids pilot contamination, but is prohibitive in mMTC, since the pilot overhead would be proportional to the total number of users [4].”
BackgroundDesign of Circular Patch Array Microstrip Antenna Using Slot for ISM Band
Sabila, L. Y., Yudhana, A., Amri, M. M., Akrima, A., & Pratama, I. P. (2022) · Journal of Electrical Technology UMY · doi:10.18196/jet.v6i2.16514 · Cited by 2
“The telecommunications system that is often used today is a wireless communication system [1], [2].”
BackgroundError Rate Analysis for Grant-free Massive Random Access with Short-Packet Transmission
Bian, X., Mao, Y., & Zhang, J. (2022) · Globecom · doi:10.1109/globecom48099.2022.10001105 · Cited by 2
“A two-phase transmission protocol is typically adopted for grant-free massive RA, where the pilot symbols are first transmitted to detect the set of active users and estimate their channel coefficients, followed by the data transmission phase to delivery the payload [4].”
Xie, W., & Zhang, H. (2023) · Sensors · doi:10.3390/s23115239 · Cited by 2
“Introduction The continuous evolution of massive machine type communication (mMTC+) [1] will still be one of main use cases of sixth-generation (6G) wireless networks [2,3].”
BackgroundAnalysis of ${\textit{d}}$ -ary tree algorithms with successive interference cancellation
Vogel, Q., Deshpande, Y., Stefanović, Č., & Kellerer, W. (2024) · Journal of Applied Probability · doi:10.1017/jpr.2023.107 · Cited by 2
“For massive IoT scenarios, distributed random access (RA) schemes are better suited as they provide minimal signalling and control overhead [26].”
Grant-Free NOMA Using Time-Delay Domain for Low-Latency Massive Access over MIMO-OFDM
Hara, T., Iimori, H., & Ishibashi, K. (2022) · International Conference on Communications · doi:10.1109/icc45855.2022.9839108 · Cited by 1
Design a CPW-Fed Circular Polarization Printed Antenna for 5G Sub-Band Applications
Najm, H. S., Farhan, M., & Abd‐Alhameed, R. A. (2022) · International Conference on Contemporary Information Technology and Mathematics (ICCITM) · doi:10.1109/iccitm56309.2022.10031832 · Cited by 1
“5G may give applications such as smart homes, smart cities, autonomous cars, Internet of Things (IoT), and mobile phones with high data speeds, low latency, energy efficiency, network dependability, and huge interconnectedness [1-7].”
BackgroundUser orientation and position-based transmission characteristics analysis of a LiFi system
Islam, M. S., Mahbub, M., & Barua, B. (2023) · Journal of Optical Communications · doi:10.1515/joc-2023-0260 · Cited by 1
Chbeine, M., Azmani, M., Astito, A., & Sellak, L. (2024) · International Conference on Global Aeronautical Engineering and Satellite Technology (GAST) · doi:10.1109/gast60528.2024.10520765 · Cited by 1
Securing the IoT wireless communication system: A multi-access physical layer approach
Katariya, J. K., Manjunath, H. R., Malviya, A. V., & Kumar, R. (2024) · Multidisciplinary Science Journal · doi:10.31893/multiscience.2024ss0320 · Cited by 1
Yang, N., & Wang, C. (2024) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126625500768 · Cited by 1
Future Internet Architecture: Applications, Challenges, and Design Issues
Mirajkar, R., Shinde, G. R., Mahalle, P. N., & Sable, N. P. (2024) · Lecture notes in networks and systems · doi:10.1007/978-981-97-6675-8_38 · Cited by 1
Scalable Active User Detection Based on Federated Learning in Cell-Free Massive MIMO System
Jiang, K., Wang, J., Li, J., Zhu, P., & Wang, D. (2024) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2024.3505854 · Cited by 1
“Additionally, due to prohibitive signaling overhead and long access delays, the grant-based random access (GBRA) process, which is widely used in the scheduling process of advanced long-term evolution (LTE-A), has gradually been replaced by grant-free random access (GFRA) protocols [6].”
Novel Real-Time Image Transmission (RTIT) Algorithm for Remote Electronic Engineering Labs
He, X., He, Z., & Huang, X. (2024) · International Conference on Data Intelligence and Cognitive Informatics (ICDICI) · doi:10.1109/icdici62993.2024.10810818 · Cited by 1
“Before designing efficient real-time image transmission system, comparison of different data communication methods [19]-[22] is firstly summarized in the Table 1.”
Emerging Trends in Massive Access Techniques for B5G and 6G Networks: A Concise Review
Kahsay, L. Z., Al-Khatib, A., Muhaidat, S., & Sofotasios, P. C. (2024) · IEEE Middle East Conference on Communications and Networking (MECOM) · doi:10.1109/mecom61498.2024.10882128 · Cited by 1
Kumar, A., & Naz, S. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-96-2015-9_50 · Cited by 1
Okumus, K., Ngo, K., Durisi, G., & Ström, E. G. (2026) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2026.3724940 · Cited by 1
“These devices typically transmit short packets in a sporadic and uncoordinated manner and operate under strict energy constraints [3], [4], [5].”
Joint Random Access and MIMO Downlink Optimization via Threshold-Based User Detection
Atapattu, S. (2026) · International Conference on Communications · doi:10.1109/icc59461.2026.11587345 · Cited by 1
“Future wireless networks will operate in dense multiuser environments enabled by massive and extra-large antenna arrays, commonly termed holographic or extra-large MIMO (HMIMO, XL-MIMO) systems [1].”
Low Complexity Activity Detection for Massive Access with Massive MIMO
Liu, Y., & Zhou, S. (2020) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/iccc49849.2020.9238922 · Cited by 1
“In the future scenario of Internet of Everything (IoE) [1], millions of infrequently communicating devices include intelligent connections of people, processes, data, and things are served at the same time.”
BackgroundSelf-citationArbitrarily Accurate Approximation of Numerical Characteristics of Stationary ALOHA Channels
Burkov, A. A., Shneer, S., & Turlikov, A. M. (2021) · Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) · doi:10.1109/weconf51603.2021.9470700 · Cited by 1
Massive MIMO-Enabled Semi-Blind Detection for Grant-Free Massive Connectivity
Ke, M., Gao, Z., Tan, S., Fang, L., Jian, M., Xu, H., & Zhao, Y. (2022) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc55113.2022.9825394 · Cited by 1
Performance Evaluation of IPTV Zapping Time Reduction Using Edge Processing of Fog RAN
Kareem, A. R., Mahmood, A. M., & Al‐Falahy, N. (2022) · Mathematical Modelling and Engineering Problems · doi:10.18280/mmep.090409 · Cited by 2
“The shifting towards Internet-based services is one of the key trends in the present and future technologies [1].”
BackgroundFeedback-Aided Coded Random Access via Replica Spacing
Valentini, L., Mirri, A., Chiani, M., & Paolini, E. (2023) · International Conference on Communications · doi:10.1109/icc45041.2023.10278984 · Cited by 1
“In mMTC, a massive number of devices, each transmitting short packets with a low duty cycle and at unpredictable time instants, contend for wireless access to the network through the same base station (BS); in the uplink, this problem is typically referred to as massive multiple access (MMA) [2].”
BackgroundFBMC-based Massive Connectivity with Asynchronous Transmission and Frequency-selective Channels
Qi, Y., Dang, J., & Zhang, Z. (2024) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc57260.2024.10570596 · Cited by 1
“Massive connectivity [1, 2] is a key requirement of massive machine-type communication (mMTC) in the fifth-generation (5G) mobile communication system, which aims to connect a large number of potential Internet-of-Things (IoT) devices.”
BackgroundImproved BCH-Polar Concatenated Scheme for Unsourced Random Access in Internet of Things
Zhang, Z., Niu, K., & Cui, H. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3425578 · Cited by 1
“We stick to the case of perfect power control by all the active users and equal channel conditions among the users at the BS side 1 [10], [11], [13], [31], [32], [33].”
BackgroundYuan, X., Zhou, Y., Hu, Y., & Schmeink, A. (2024) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc60668.2024.10694611 · Cited by 1
“Moreover, the future wireless network is also being driven to an extremely large scale, enabling the concept of Internet of Everything (IoE) [7].”
BackgroundThe Family of LML Detectors and the Family of LAS Detectors for Massive MIMO Communications
Sun, Y. (2025) · IntechOpen eBooks · doi:10.5772/intechopen.1007870 · Cited by 1
Non-Negative Least Squares Exploiting Multiple Measurements in Unsourced Random Access
Sun, Q., Zhang, Z., Dang, J., & Zhang, Z. (2024) · International Conference on Wireless Communications and Signal Processing (WCSP) · doi:10.1109/wcsp62071.2024.10827794 · Cited by 2
Antenna Design with high Gain and Efficiency for Millimeter wave Applications
Rani, D. H., & Nanda, S. (2025) · International Conference on Sustainable Energy Technologies and Computational Intelligence (SETCOM) · doi:10.1109/setcom64758.2025.10932592 · Cited by 1
Backhauling Many Devices: Relay Schemes for Massive Random Access Networks
Ogbe, D. O., Love, D. J., & Wang, C.-C. (2020) · Globecom · doi:10.1109/globecom42002.2020.9322431
“…of beyond-5G communication standards is the emergence of so-called massive networks of low-power and low-complexity devices, evolving the current paradigms of the Internet of Things (IoT) and massive machine-type communications (mMTC) into a hyper-connected Internet of Everything (IoE) [1].”
BackgroundLiu, Y., & Zhou, S. (2021) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc51323.2021.9498897
Self-citationUniquely Decodable Multi-Amplitude Sequence for Massive Grant-free Multiple-Access Adder Channels.Preprint
Yu, Q., & Song, K. (2021) · arXiv (Cornell University)
Clustering-Aided Graph Signal Sampling and Reconstruction for Large-Scale Sensor Networks
Yuan, C., Li, G., He, B., & Zhang, G. (2021) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/iccc52777.2021.9580427
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.