MIMO-Based Reliable Grant-Free Massive Access With QoS Differentiation for 5G and Beyond

被引:13
作者
Abebe, Ameha Tsegaye [1 ]
Kang, Chung G. [1 ]
机构
[1] Korea Univ, Sch Elect Engn, Seoul 02841, South Korea
基金
新加坡国家研究基金会;
关键词
Quality of service; Channel estimation; Receivers; Pollution measurement; MIMO communication; Antennas; Complexity theory; Grant-free access; MIMO; non-orthogonal Zadoff-Chu sequences; quality-of-services (QoS); uRLLC; mMTC; AVERAGE-CASE ANALYSIS; PART I; CONNECTIVITY; RECOVERY; NETWORKS; CHANNEL;
D O I
10.1109/JSAC.2020.3018963
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Grant-free (GF) access has been one of the enablers for the various use cases in 5th generation (5G) mobile system, especially for time-critical massive machine-type communication (mMTC). However, these use cases have diverse quality of service (QoS) requirements, which can be measured in terms of an access success rate from a GF random access perspective. Consequently, a GF scheme that enables supporting of diverse QoS is highly sought. This article proposes a GF access scheme in which high-QoS users superpose multiple preambles to improve their access success rate as a result of the diversity in access collision and multiple access interference seen by multiple preambles. We further show that in the presence of multiple antennas in the base station (BS), a low-complexity receiver can correctly detect active preambles with a significantly high probability, even under severe multiple access interference caused by non-orthogonal preamble transmission. A theoritical performance analysis is conducted by modeling the preamble reception as a multiple measurement vector-based compressive sensing problem. The preamble misdetection probability is shown to decrease exponentially as the number antennas at BS increases. Numerical results demonstrate multiple-order improvement in terms of the access success rate for critical-QoS users, even under severe noise and multiple access contamination.
引用
收藏
页码:773 / 787
页数:15
相关论文
共 31 条
[1]   A Novel Analytical Framework for Massive Grant-Free NOMA [J].
Abbas, Rana ;
Shirvanimoghaddam, Mahyar ;
Li, Yonghui ;
Vucetic, Branka .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (03) :2436-2449
[2]   Iterative Order Recursive Least Square Estimation for Exploiting Frame-Wise Sparsity in Compressive Sensing-Based MTC [J].
Abebe, Ameha T. ;
Kang, Chung G. .
IEEE COMMUNICATIONS LETTERS, 2016, 20 (05) :1018-1021
[3]   Grant-Free Uplink Transmission With Multi-Codebook-Based Sparse Code Multiple Access (MC-SCMA) [J].
Abebe, Ameha Tsegaye ;
Kang, Chung G. .
IEEE ACCESS, 2019, 7 :169853-169864
[4]   Joint Channel Estimation and MUD for Scalable Grant-Free Random Access [J].
Abebe, Ameha Tsegaye ;
Kang, Chung G. .
IEEE COMMUNICATIONS LETTERS, 2019, 23 (12) :2229-2233
[5]  
[Anonymous], 2012, 22368 TR 3GPP
[6]  
[Anonymous], 2017, 2017 IEEE International Conference on Communications (ICC)
[7]   Massive MIMO networks: Spectral, energy, and hardware efficiency [J].
Björnson, Emil ;
Hoydis, Jakob ;
Sanguinetti, Luca .
Foundations and Trends in Signal Processing, 2017, 11 (3-4) :154-655
[8]   Stable signal recovery from incomplete and inaccurate measurements [J].
Candes, Emmanuel J. ;
Romberg, Justin K. ;
Tao, Terence .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (08) :1207-1223
[9]   Asynchronous Grant-Free Uplink Transmissions in Multichannel Wireless Networks With Heterogeneous QoS Guarantees [J].
Chang, Cheng-Shang ;
Lee, Duan-Shin ;
Wang, Chun .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (04) :1584-1597
[10]   On Throughput of Compressive Random Access for One Short Message Delivery in IoT [J].
Choi, Jinho .
IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (04) :3499-3508