Success Probability of Grant-Free Random Access with Massive MIMO

IEEE Internet of Things Journal(2018)

引用 94|浏览55
暂无评分
摘要
Massive 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.
更多
查看译文
关键词
MIMO communication,Array signal processing,Internet of Things,Wireless communication,NOMA,Channel estimation,Machine-to-machine communications
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要