Success Probability of Grant-Free Random Access with Massive MIMO
Version 2 2024-06-06, 10:58Version 2 2024-06-06, 10:58
Version 1 2019-12-11, 14:38Version 1 2019-12-11, 14:38
journal contribution
posted on 2024-06-06, 10:58 authored by J Ding, D Qu, H Jiang, T Jiang© 2014 IEEE. Massive multiple-input multiple-output (MIMO) opens up new avenues for enabling highly efficient random access (RA) by offering abundance of spatial degrees of freedom. In this paper, we investigate the grant-free RA with massive MIMO and derive the analytic expressions of success probability of the grant-free RA for conjugate beamforming and zero-forcing beamforming techniques. With the derived analytic expressions, we further shed light on the impact of system parameters on the success probability. Simulation results verify the accuracy of the analyses. It is confirmed that the grant-free RA with massive MIMO is an attractive RA technique with low signaling overhead that could simultaneously accommodate a number of RA users, which is multiple times the number of RA channels, with close-to-one success probability. In addition, when the number of antennas in massive MIMO is sufficiently large, we show that the number of orthogonal preambles would dominate the success probability.
History
Journal
IEEE Internet of Things JournalVolume
6Pagination
506-516Location
Piscataway, N.J.Publisher DOI
ISSN
2327-4662eISSN
2327-4662Language
engPublication classification
C1.1 Refereed article in a scholarly journalIssue
1Publisher
IEEEUsage metrics
Categories
Keywords
Licence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC