A layered grouping random access scheme based on dynamic preamble selection for massive machine type communications  

作　　者：Gaofeng CHENG Huan CHEN Pingzhi FAN Li LI Li HAO 

机构地区：[1]Information Coding&Transmission Key Lab of Sichuan Province,CSNMT International Cooperation Research Centre of China,Southwest Jiaotong University,Chengdu 610031,China

出　　处：《Science China(Information Sciences)》2022年第7期265-266,共2页中国科学（信息科学）（英文版）

基　　金：supported by National Key R&D Project (Grant No. 2018YFB1801104);National Natural Science Foundation of China (Grant Nos. 62020106001,62071394);111 Project (Grant No. 111-2-14);Sichuan Science and Technology Program (Grant No. 2020YFH0011)。

摘　　要：Dear editor,The massive random access(RA)schemes in the existing literature are mainly grant-free approaches,which are supported by non-orthogonal multiple access[1–3],compressive sensing(CS)[4,5],group paging[2,6],and multichannel ALOHA[7].However,they still face the challenges of high energy consumption and data overhead,especially in future ultra-dense Internet of Things(Io T)networks(>10^(6) devices/km^(2))[8].

关 键 词：EDITOR networks MASSIVE 

分 类 号：TN91[电子电信—通信与信息系统]