面向大规模物联网的随机接入：现状、挑战与机遇

doi:10.11959/j.issn.1000-436x.2021098

通信学报 ›› 2021, Vol. 42 ›› Issue (4): 1-21.doi: 10.11959/j.issn.1000-436x.2021098

• 专题：面向未来移动网络的大规模组网关键技术 • 下一篇

面向大规模物联网的随机接入：现状、挑战与机遇

范平志, 李里, 陈欢, 程高峰, 杨林杰, 汤小波

西南交通大学信息科学与技术学院，四川成都 611756

修回日期:2021-04-08 出版日期:2021-04-25 发布日期:2021-04-01
作者简介:范平志（1955- ），男，四川广汉人，博士，西南交通大学教授，主要研究方向为大规模物联网、高移动无线通信、信息理论与编码技术。
李里（1983- ），男，四川成都人，博士，西南交通大学副教授、硕士生导师，主要研究方向为信道编译码技术、大规模随机接入技术等。
陈欢（1995- ），女，浙江湖州人，西南交通大学硕士生，主要研究方向为大规模随机接入技术、群组通信技术。
程高峰（1995- ），男，山西晋城人，西南交通大学硕士生，主要研究方向为大规模随机接入技术。
杨林杰（1991- ），男，四川遂宁人，西南交通大学博士生，主要研究方向为大规模随机接入技术。
汤小波（1992- ），男，四川达州人，西南交通大学博士生，主要研究方向为大规模随机接入技术、超奈奎斯特传输技术。
基金资助:
国家重点研发计划基金资助项目(2018YFB1801104);国家自然科学基金资助项目(62071394);四川省国际科技创新合作基金资助项目(2020YFH0011)

Random access for massive Internet of things:current status, challenges and opportunities

Pingzhi FAN, Li LI, Huan CHEN, Gaofeng CHENG, Linjie YANG, Xiaobo TANG

School of Information Science and Technology, Southwest Jiaotong University, Chengdu 611756, China

Revised:2021-04-08 Online:2021-04-25 Published:2021-04-01
Supported by:
The National Key Research and Development Program of China(2018YFB1801104);The National Natural Science Foundation of China(62071394);Sichuan Science and Technology Program(2020YFH0011)

摘要/Abstract

摘要：

在传统通信系统中，随机接入是终端与网络之间建立无线链路的必经过程，只有在随机接入完成之后，终端与网络之间才能正常进行数据传输。聚焦大规模节点物联网，首先阐述了大规模物联网随机接入的基本特征，分析了传统授权随机接入（RA）方法对于大规模物联网应用的局限性；然后从系统模型、协议框架、算法流程、系统性能等多个角度，讨论免授权RA、半免授权RA、无用户标识RA三大类新型大规模随机接入方法，分析各类方法优缺点，并指出面临的挑战与潜在的机遇；最后对大规模物联网随机接入涉及的关键技术与共性问题进行了总结。

关键词: 大规模物联网, 随机接入, 免授权, 无用户标识RA, 非正交多址

Abstract:

In conventional communication systems, the random access (RA) is a necessary procedure for a user equipment (UE) to establish wireless connection to the network before actual data transmission.Focusing on the massive IoT with large number of nodes, the fundamental characteristics and limitations of conventional grant-based RA were firstly discussed.Then, the grant-free RA, semi-grant-free RA and unsourced RA for massive IoT were addressed in details from multiple perspectives, including their system models, protocol frameworks, algorithm procedures, system performance, related pros and cons, as well as critical challenges and potential opportunities.Finally, some highlights on the related key techniques and common issues in random access for massive IoT were concluded.

Key words: massive Internet of things, random access, grant-free, unsourced random access, non-orthogonal multiple access

中图分类号:

TN929.5

范平志, 李里, 陈欢, 程高峰, 杨林杰, 汤小波. 面向大规模物联网的随机接入：现状、挑战与机遇[J]. 通信学报, 2021, 42(4): 1-21.

Pingzhi FAN, Li LI, Huan CHEN, Gaofeng CHENG, Linjie YANG, Xiaobo TANG. Random access for massive Internet of things:current status, challenges and opportunities[J]. Journal on Communications, 2021, 42(4): 1-21.

图/表 26

图1

图2

图3

表1

ZC序列集与低相关区序列集特性比较"

序列类型	每个子集内序列个数	低相关区内相关值大小	子集个数	可达PRACH数量
ZC	$⌊ \frac{L}{N_{CS}} ⌋$	0	L? 1	$(L - 1) ⌊ \frac{L}{N_{CS}} ⌋$
ZC	$(L - 1) ⌊ \frac{L}{N_{CS}} ⌋$	$\sqrt{L}$	1	$(L - 1) ⌊ \frac{L}{N_{CS}} ⌋$
ZCm	$(L + 1) ⌊ \frac{L}{N_{CS}} ⌋$	$\sqrt{L + 1}$	L? 1	$(L^{2} - 1) ⌊ \frac{L}{N_{CS}} ⌋$
ZCa	$\approx ⌊ \frac{L}{N_{CS}} ⌋$	$\sqrt{L}$	L	$(L^{2} - 1) ⌊ \frac{L}{N_{CS}} ⌋$

表1

图4

表2

图5

图6

图7

表3

表4

图8

图9

图10

图11

图12

表5

图13

图14

表6

图15

图16

图17

图18

图19

图20

参考文献 89

[90]	AROUK O , KSENTINI A , TALEB T . Group paging-based energy saving for massive MTC accesses in LTE and beyond networks[J]. IEEE Journal on Selected Areas in Communications, 2016,34(5): 1086-1102.
[91]	TU C Y , HO C Y , HUANG C Y . Energy-efficient algorithms and evaluations for massive access management in cellular based machine to machine communications[C]// Vehicular Technology Conference. Piscataway:IEEE Press, 2011: 1-5.
[92]	3GPP. Intel corporation,grant-less and non-orthogonal UL transmissions in NR:R1-167698[S].(2016-08)[2021-01-18].
[93]	YANG Z , XU P , HUSSEIN J A ,et al. Adaptive power allocation for uplink non-orthogonal multiple access with semi-grant-free transmission[J]. IEEE Wireless Communications Letters, 2020,9(10): 1725-1729.
[94]	LIU C , NATARAJAN B . Ergodic capacity in D2D underlay networks with varying user distribution[C]// 2016 13th IEEE Annual Consumer Communications ＆ Networking Conference. Piscataway:IEEE Press, 2016: 325-329.
[95]	CHEN R , LIAO X W , ZHU S H ,et al. Capacity analysis of device-to-device resource reusing modes for cellular networks[C]// IEEE International Conference on Communication. Piscataway:IEEE Press, 2012: 64-68.
[96]	MIN H , LEE J , PARK S ,et al. Capacity enhancement using an interference limited area for device-to-device uplink underlaying cellular networks[J]. IEEE Transactions on Wireless Communications, 2011,10(12): 3995-4000.
[97]	WU Y P , GAO X Q , ZHOU S D ,et al. Massive access for future wireless communication systems[J]. IEEE Wireless Communications, 2020,27(4): 148-156.
[98]	ORDENTLICH O , POLYANSKIY Y . Low complexity schemes for the random access Gaussian channel[C]// 2017 IEEE International Symposium on Information Theory. Piscataway:IEEE Press, 2017: 2528-2532.
[99]	GLEBOV A , MATVEEV N , ANDREEV K ,et al. Achievability bounds for T-fold irregular repetition slotted ALOHA scheme in the Gaussian MAC[C]// 2019 IEEE Wireless Communications and Networking Conference. Piscataway:IEEE Press, 2019: 1-6.
[1]	ALEX G , CAMEN L , SYLWIA K . IoT connections forecast:the rise of enterprise[R].(2019-12-16)[2021-01-18].
[2]	张平, 陶运铮, 张治 . 5G 若干关键技术评述[J]. 通信学报, 2016,37(7): 15-29.
[100]	KOWSHIK S S , ANDREEV K , FROLOV A ,et al. Energy efficient random access for the quasi-static fading MAC[C]// 2019 IEEE International Symposium on Information Theory. Piscataway:IEEE Press, 2019: 2768-2772.
[101]	ANDREEV K , KOWSHIK S S , FROLOV A ,et al. Low complexity energy efficient random access scheme for the asynchronous fading MAC[C]// 2019 IEEE 90th Vehicular Technology Conference. Piscataway:IEEE Press, 2019: 1-5.
[2]	ZHANG P , TAO Y Z , ZHANG Z . Survey of several key technologies for 5G[J]. Journal on Communications, 2016,37(7): 15-29.
[3]	尤肖虎, 尹浩, 邬贺铨 . 6G 与广域物联网[J]. 物联网学报, 2020,4(1): 3-11.
[102]	USTINOVA D , GLEBOV A , RYBIN P ,et al. Efficient concatenated same codebook construction for the random access Gaussian MAC[C]// 2019 IEEE 90th Vehicular Technology Conference. Piscataway:IEEE Press, 2019: 1-5.
[103]	GLEBOV A , MEDOVA L , RYBIN P ,et al. On LDPC code based massive random-access scheme for the Gaussian multiple access channel[C]// Internet of Things,Smart Spaces,and Next Generation Networks and Systems. Berlin:Springer, 2018,111（18）: 162-171.
[3]	YOU X H , YIN H , WU H Q . On 6G and wide-area IoT[J]. Chinese Journal on Internet of Things, 2020,4(1): 3-11.
[4]	3GPP. Considerations and evaluation results for IMT-2020 for mMTC connection density:R16-1808080[S].(2018-08)[2021-01-18].
[5]	3GPP. IMT-2020 connection density evaluation results (mMTC):R16-1808866[S].(2018-08)[2021-01-18].
[6]	3GPP. IMT 2020 self-evaluation:mMTC coverage,data rate,latency＆ battery life:R17-1905187[S].(2019-04)[2021-01-18].
[104]	PRADHAN A , AMALLADINNE V , VEM A ,et al. A joint graph based coding scheme for the unsourced random access Gaussian channel[C]// 2019 IEEE Global Communications Conference. Piscataway:IEEE Press, 2019: 1-6.
[105]	ANDREEV K , MARSHAKOV E , FROLOV A . A polar code based TIN-SIC scheme for the unsourced random access in the quasi-static fading MAC[C]// 2020 IEEE International Symposium on Information Theory. Piscataway:IEEE Press, 2020: 3019-3024.
[7]	PALATTELLA M R , DOHLER M , GRIECO A ,et al. Internet of things in the 5G era:enablers,architecture and business models[J]. IEEE Journal on Selected Areas in Communications, 2016,34(3): 510-527.
[8]	3GPP. Considerations and evaluation results for IMT-2020 for mMTC connection density:R1-1903968[S].(2019-04)[2021-01-18].
[106]	MARSHAKOV E , BALITSKIY G , ANDREEV K ,et al. A polar code based unsourced random access for the Gaussian MAC[C]// 2019 IEEE 90th Vehicular Technology Conference. Piscataway:IEEE Press, 2019: 1-5.
[107]	PRADHAN A K , AMALLADINNE V K , NARAYANAN K R ,et al. Polar coding and random spreading for unsourced multiple access[C]// 2020 IEEE International Conference on Communications. Piscataway:IEEE Press, 2020: 1-6.
[9]	ZHANG Z Q , XIAO Y , MA Z ,et al. 6G wireless networks:vision,requirements,architecture,and key technologies[J]. IEEE Vehicular Technology Magazine, 2019,14(3): 28-41.
[10]	3GPP. IMT 2020 self evaluation:mMTC coverage,data rate,latency＆ battery life:R1-1905187[S].(2019-04)[2021-01-18].
[108]	ZHENG M F , WU Y P , ZHANG W J . Polar coding and sparse spreading for massive unsourced random access[C]// 2020 IEEE 92nd Vehicular Technology Conference. Piscataway:IEEE Press,, 2020: 1-5.
[109]	牛凯, 许文俊, 张平 . 面向6G 的极化编码非正交多址接入[J]. 西安电子科技大学学报, 2020,47(6): 5-12,29.
	NIU K , XU W J , ZHANG P . Polar coded non-orthogonal multiple access to 6G wireless systems[J]. Journal of Xidian University, 2020,47(6): 5-12,29.
[110]	DOMMEL J , UTKOVSKI Z , STA?CZAK S ,et al. Joint sourcechannel coding and Bayesian message passing detection for grant-free radio access in IoT[C]// ICASSP 2020 - 2020 IEEE International Conference on Acoustics,Speech and Signal Processing. Piscataway:IEEE Press, 2020: 8574-8578.
[111]	VEM A , NARAYANAN K R , CHAMBERLAND J F ,et al. A user-independent successive interference cancellation based coding scheme for the unsourced random access Gaussian channel[J]. IEEE Transactions on Communications, 2019,67(12): 8258-8272.
[112]	WU Q Q , ZHANG R . Towards smart and reconfigurable environment:intelligent reflecting surface aided wireless network[J]. IEEE Communications Magazine, 2020,58(1): 106-112.
[11]	DE ANDRADE T P C , ASTUDILLO C A , SEKIJIMA L R ,et al. The random access procedure in long term evolution networks for the Internet of things[J]. IEEE Communications Magazine, 2017,55(3): 124-131.
[12]	3GPP. Study on RAN Improvements for machine-type communications:TR 37.868[S].(2011)[2021-01-18].
[13]	DUAN S Y , SHAH-MANSOURI V , WONG V W S . Dynamic access class barring for M2M communications in LTE networks[C]// 2013 IEEE Global Communications Conference. Piscataway:IEEE Press, 2013: 4747-4752.
[14]	CHENG R G , CHEN J , CHEN D W ,et al. Modeling and analysis of an extended access barring algorithm for machine-type communications in LTE-A networks[J]. IEEE Transactions on Wireless Communications, 2015,14(6): 2956-2968.
[15]	JANG H S , JIN H , JUNG B C ,et al. Versatile access control for massive IoT:throughput,latency,and energy efficiency[J]. IEEE Transactions on Mobile Computing, 2020,19(8): 1984-1997.
[16]	DI C , ZHANG B , LIANG Q L ,et al. Learning automata-based access class barring scheme for massive random access in machine-to-machine communications[J]. IEEE Internet of Things Journal, 2019,6(4): 6007-6017.
[17]	SCHEPKER H F , DEKORSY A . Compressive sensing multi-user detection with block-wise orthogonal least squares[C]// Vehicular Technology Conference. Piscataway:IEEE Press, 2013: 1-5.
[18]	田飞燕, 陈晓明, 钟财军 ,等. 6G蜂窝物联网的大规模接入技术[J]. 物联网学报, 2020,4(1): 92-103.
	TIAN F Y , CHEN X M , ZHONG C J ,et al. Massive access technology in 6G cellular Internet of things network[J]. Chinese Journal on Internet of Things, 2020,4(1): 92-103.
[19]	DING Z G , YANG Z , FAN P Z ,et al. On the performance of non-orthogonal multiple access in 5G systems with randomly deployed users[J]. IEEE Signal Processing Letters, 2014,21(12): 1501-1505.
[20]	NIKOPOUR H , BALIGH H . Sparse code multiple access[C]// IEEE International Symposium on Personal Indoor and Mobile Radio Communications. Piscataway:IEEE Press, 2013: 332-336.
[21]	REN B , WANG Y M , DAI X M ,et al. Pattern matrix design of PDMA for 5G UL applications[J]. China Communications, 2016,13(Supplement2): 159-173.
[22]	HU X L , ZHONG C J , CHEN X M ,et al. Cluster grouping and power control for angle-domain mmwave MIMO NOMA systems[J]. IEEE Journal of Selected Topics in Signal Processing, 2019,13(5): 1167-1180.
[23]	DING Z G , SCHOBER R , FAN P Z ,et al. Simple semi-grant-free transmission strategies assisted by non-orthogonal multiple access[J]. IEEE Transactions on Communications, 2019,67(6): 4464-4478.
[24]	TANG W W , KANG S L , REN B ,et al. Uplink grant-free pattern division multiple access (GF-PDMA) for 5G radio access[J]. China Communications, 2018,15(4): 153-163.
[25]	YUAN Z F , YAN C L , YUAN Y F ,et al. Blind multiple user detection for grant-free MUSA without reference signal[C]// 2017 IEEE 86th Vehicular Technology Conference. Piscataway:IEEE Press, 2017: 1-5.
[26]	POLYANSKIY Y , . A perspective on massive random-access[C]// 2017 IEEE International Symposium on Information Theory. Piscataway:IEEE Press, 2017: 2523-2527.
[27]	SESIA S , TOUFIK I , BAKER M . LTE——the UMTS long term evolution from theory to practice[M]. New York: Wiley, 2009.
[28]	WIRIAATMADJA D T , CHOI K W . Hybrid random access and data transmission protocol for machine-to-machine communications in cellular networks[J]. IEEE Transactions on Wireless Communications, 2015,14(1): 33-46.
[29]	DUAN S Y , SHAH-MANSOURI V , WANG Z H ,et al. D-ACB:adaptive congestion control algorithm for bursty M2M traffic in LTE networks[J]. IEEE Transactions on Vehicular Technology, 2016,65(12): 9847-9861.
[30]	WALI P K , DAS D . Optimization of barring factor enabled extended access barring for energy efficiency in LTE-advanced base station[J]. IEEE Transactions on Green Communications and Networking, 2018,2(3): 830-843.
[31]	LIN T M , LEE C H , CHENG J P ,et al. PRADA:prioritized random access with dynamic access barring for MTC in 3GPP LTE-A networks[J]. IEEE Transactions on Vehicular Technology, 2014,63(5): 2467-2472.
[32]	SIM Y , CHO D H . Performance analysis of priority-based access class barring scheme for massive MTC random access[J]. IEEE Systems Journal, 2020,14(4): 5245-5252.
[33]	TELLO-OQUENDO L , PACHECO-PARAMO D , PLA V ,et al. Reinforcement learning-based ACB in LTE-A networks for handling massive M2M and H2H communications[C]// 2018 IEEE International Conference on Communications. Piscataway:IEEE Press, 2018: 1-7.
[34]	CHEN Z Q , SMITH D B . Heterogeneous machine-type communications in cellular networks:random access optimization by deep reinforcement learning[C]// 2018 IEEE International Conference on Communications. Piscataway:IEEE Press, 2018: 1-6.
[35]	JIANG N , DENG Y S , NALLANATHAN A . Deep reinforcement learning for discrete and continuous massive access control optimization[C]// 2020 IEEE International Conference on Communications. Piscataway:IEEE Press, 2020: 1-7.
[36]	JANG H S , JIN H , JUNG B C ,et al. Recursive access class barring for machine type communications with PUSCH resource constraints[C]// 2019 IEEE International Conference on Communications. Piscataway:IEEE Press, 2019: 1-6.
[37]	WANG Z H , WONG V W S . Joint access class barring and timing advance model for machine-type communications[C]// 2014 IEEE International Conference on Communications. Piscataway:IEEE Press, 2014: 2357-2362.
[38]	WANG Z H , WONG V W S . Optimal access class barring for stationary machine type communication devices with timing advance information[J]. IEEE Transactions on Wireless Communications, 2015,14(10): 5374-5387.
[39]	SCHREIBER G , TAVARES M . 5G new radio physical random access preamble design[C]// 2018 IEEE 5G World Forum. Piscataway:IEEE Press, 2018: 215-220.
[40]	PITAVAL R A , POPOVIC B M , BERGGREN F ,et al. Overcoming 5G PRACH capacity shortfall by combining Zadoff-Chu and M-sequences[C]// 2018 IEEE International Conference on Communications. Piscataway:IEEE Press, 2018: 1-6.
[41]	PITAVAL R A , POPOVIC B M , WANG P ,et al. Overcoming 5G PRACH capacity shortfall:supersets of Zadoff-Chu sequences with low-correlation zone[J]. IEEE Transactions on Communications, 2020,68(9): 5673-5688.
[42]	HEATH R W , STROHMER T , PAULRAJ A J . On quasi-orthogonal signatures for CDMA systems[J]. IEEE Transactions on Information Theory, 2006,52(3): 1217-1226.
[43]	3GPP. On NR RACH preamble design:R1-1702065[S].(2017-02)[2021-01-18].
[44]	郭伯仁, 张欣, 杨鸿文 . 基于子前导序列的IoT系统随机接入方案[J]. 北京邮电大学学报, 2018,41(5): 110-114.
	GUO B R , ZHANG X , YANG H W . A random access scheme based on sub-preambles for IoT systems[J]. Journal of Beijing University of Posts and Telecommunications, 2018,41(5): 110-114.
[45]	3GPP. On NR RACH preamble design:R1-1704540[S].(2017-04)[2021-01-18].
[46]	KIM J S , MUNIR D , HASAN S F ,et al. Enhancement of LTE RACH through extended random access process[J]. Electronics Letters, 2014,50(19): 1399-1400.
[47]	SARI R F , HARWAHYU R , CHENG R G . Load estimation and connection request barring for random access in massive C-IoT[J]. IEEE Internet of Things Journal, 2020,7(7): 6539-6549.
[48]	JANG H S , PARK H S , SUNG D K . A non-orthogonal resource allocation scheme in spatial group based random access for cellular M2M communications[J]. IEEE Transactions on Vehicular Technology, 2017,66(5): 4496-4500.
[49]	LIANG Y N , LI X , ZHANG J Y ,et al. Non-orthogonal random access for 5G networks[J]. IEEE Transactions on Wireless Communications, 2017,16(7): 4817-4831.
[50]	KIM T , JUNG B C , SUNG D K . An enhanced random access with distributed pilot orthogonalization for cellular IoT networks[J]. IEEE Transactions on Vehicular Technology, 2020,69(1): 1152-1156.
[51]	KIM T , JUNG B C . An enhanced random access with inter-frame successive interference cancellation for stationary cellular IoT networks[J]. IEEE Wireless Communications Letters, 2020,9(5): 606-610.
[52]	3GPP. Uplink multiple access schemes for NR:R1-165174[S].(2016-05)[2021-01-18].
[53]	BAYESTEH A , YI E , NIKOPOUR H ,et al. Blind detection of SCMA for uplink grant-free multiple-access[C]// 2014 11th International Symposium on Wireless Communications Systems. Piscataway:IEEE Press, 2014: 853-857.
[54]	3GPP. Contention-based non-orthogonal multiple access for UL mMTC:R1-164269[S].(2016-05)[2021-01-18].
[55]	SHAHAB M B , ABBAS R , SHIRVANIMOGHADDAM M ,et al. Grant-free non-orthogonal multiple access for IoT:a survey[J]. IEEE Communications Surveys ＆ Tutorials, 2020,22(3): 1805-1838.
[56]	WANG B C , DAI L L , YUAN Y F ,et al. Compressive sensing based multi-user detection for uplink grant-free non-orthogonal multiple access[C]// 2015 IEEE 82nd Vehicular Technology Conference. Piscataway:IEEE Press, 2015: 1-5.
[57]	DONOHO D L . Compressed sensing[J]. IEEE Transactions on Information Theory, 2006,52(4): 1289-1306.
[58]	CANDèS E J . Compressive sampling[J]. Marta Sanz Solé, 2006,17(2): 1433-1452.
[59]	李佳, 高志荣, 熊承义 ,等. 加权结构组稀疏表示的图像压缩感知重构[J]. 通信学报, 2017,38(2): 196-202.
	LI J , GAO Z R , XIONG C Y ,et al. Image compressive sensing recovery based on weighted structure group sparse representation[J]. Journal on Communications, 2017,38(2): 196-202.
[60]	王金铭, 叶时平, 尉理哲 ,等. 半张量积压缩感知模型的快速重构方法[J]. 通信学报, 2018,39(7): 26-38.
	WANG J M , YE S P , YU L Z ,et al. Fast reconstruction method for compressed sensing model with semi-tensor product[J]. Journal on Communications, 2018,39(7): 26-38.
[61]	袁伟娜, 严秋 . 基于压缩感知的FBMC/OQAM系统信道估计方法[J]. 通信学报, 2019,40(12): 98-104.
	YUAN W N , YAN Q . Channel estimation method based on compressive sensing for FBMC/OQAM system[J]. Journal on Communications, 2019,40(12): 98-104.
[62]	CANDèS E J . The restricted isometry property and its implications for compressed sensing[J]. Comptes Rendus Mathematique, 2008,346(9-10): 589-592.
[63]	DONOHO D L , ELAD M . Optimally sparse representation in general (nonorthogonal) dictionaries via l minimization[J]. Proceedings of the National Academy of Sciences of the United States of America, 2003,100(5): 2197-2202.
[64]	CALDERBANK R , HOWARD S , JAFARPOUR S . Construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property[J]. IEEE Journal of Selected Topics in Signal Processing, 2010,4(2): 358-374.
[65]	NOUASRIA H , ET-TOLBA M . Sensing matrix based on Kasami codes for compressive sensing[J]. IET Signal Processing, 2018,12(8): 1064-1072.
[66]	GU Z , ZHOU Z.C. , YANG Y ,et al. Deterministic compressed sensing matrices from sequences with optimal correlation[J]. IEEE Access, 2019,7: 16704-16710.
[67]	CHEN S S , SAUNDERS D M A . Atomic decomposition by basis pursuit[J]. Siam Review, 2001,43(1): 129-159.
[68]	DAUBECHIES I , DEFRISE M , DE MOL C . An iterative thresholding algorithm for linear inverse problems with a sparsity constraint[J]. Communications on Pure and Applied Mathematics, 2004,57(11): 1413-1457.
[69]	APPLEBAUM L , BAJWA W U , DUARTE M F ,et al. Asynchronous code-division random access using convex optimization[J]. Physical Communication, 2012,5(2): 129-147.
[70]	MALLAT S G , ZHANG Z F . Matching pursuits with time-frequency dictionaries[J]. IEEE Transactions on Signal Processing, 1993,41(12): 3397-3415.
[71]	TROPP J A , GILBERT A C . Signal recovery from random measurements via orthogonal matching pursuit[J]. IEEE Transactions on Information Theory, 2007,53(12): 4655-4666.
[72]	LEE N . MAP support detection for greedy sparse signal recovery algorithms in compressive sensing[J]. IEEE Transactions on Signal Processing, 2016,64(19): 4987-4999.
[73]	DONOHO D L , MALEKI A , MONTANARI A.Message passing algorithms for compressed sensing:I . Motivation and construction[C]// Information Theory Workshop. Piscataway:IEEE Press, 2010: 1-5.
[74]	CHEN Z L , SOHRABI F , YU W . Sparse activity detection for massive connectivity[J]. IEEE Transactions on Signal Processing, 2018,66(7): 1890-1904.
[75]	LIU L , YU W . Massive connectivity with massive MIMO-part I:device activity detection and channel estimation[J]. IEEE Transactions on Signal Processing, 2018,66(11): 2933-2946.
[76]	SENEL K , LARSSON E G . Grant-free massive MTC-enabled massive MIMO:a compressive sensing approach[J]. IEEE Transactions on Communications, 2018,66(12): 6164-6175.
[77]	YANG L J , FAN P Z , LI L ,et al. Cross validation aided approximated message passing algorithm for user identification in mMTC[J]. IEEE Communication Letters,submitted, 2021.
[78]	CHEN X , CHEN T Y , GUO D N . Capacity of Gaussian many-access channels[J]. IEEE Transactions on Information Theory, 2017,63(6): 3516-3539.
[79]	BARANIUK R G . A lecture on compressive sensing[J]. IEEE Signal Processing Magazine, 2007,24(4): 1-9.
[80]	DONOHO D L , MALEKI A , MONTANARI A . Message-passing algorithms for compressed sensing[J]. Proceedings of the National Academy of Sciences of the United States of America, 2009,106(45): 18914-18919.
[81]	张云昊, 徐修强, 范平志 ,等. 一种通信的方法及装置：PCT/CN2020/109865[P].(2020-08-18)[2021-01-18].
	ZHANG Y H , XU X Q , FAN P Z ,et al. A communication scheme and its installation:PCT/CN2020/109865[P].(2020-08-18)[2021-01-18].
[82]	ZHANG C , XU Y , GAO N ,et al. Low complexity decoding scheme of raptor-like LDPC code in sufficient SNR scenarios[C]// 2019 IEEE 90th Vehicular Technology Conference. Piscataway:IEEE Press, 2019: 1-5.
[83]	SHAH-MANSOURI V , DUAN S , CHANG L H ,et al. Compressive sensing based asynchronous random access for wireless networks[C]// Wireless Communications ＆ Networking Conference. Piscataway:IEEE Press, 2013: 884-888.
[84]	LIU C T , SU H J , TAKANO Y . Sparse activity,timing detection and channel estimation for grant-free uplink communications[C]// 2020 IEEE 31st Annual International Symposium on Personal,Indoor and Mobile Radio Communications. Piscataway:IEEE Press, 2020: 1-7.
[85]	SAITO Y , KISHIYAMA Y , BENJEBBOUR A ,et al. Non-orthogonal multiple access (NOMA) for cellular future radio access[C]// 2013 IEEE 77th Vehicular Technology Conference. Piscataway:IEEE Press, 2013: 1-5.
[86]	DING Z G , FAN P Z , POOR H V . Impact of user pairing on 5G non-orthogonal multiple access[J]. IEEE Transactions on Vehicular Technology, 2014,65(8): 6010-6023.
[87]	3GPP. Pull based RAN overload control:R2-104870[S].(2010-08)[2021-01-18].
[88]	ZHAO Q , TONG L . Opportunistic carrier sensing for energy-efficient information retrieval in sensor networks[J]. EURASIP Journal on Wireless Communications and Networking, 2005,2005(2): 1-11.
[89]	BLETSAS A , KHISTI A , REED D P ,et al. A simple cooperative diversity method based on network path selection[J]. IEEE Journal on Selected Areas in Communications, 2006,24(3): 659-672.

策略	技术特点	文献	主要方法	特性分析
碰撞控制	随机选择PUSCH资源	文献[46]	基站为一个前导序列分配多个上行PUSCH资源，用户随机选择一个PUSCH资源来传输L2/L3连接请求消息	PUSCH 资源随机选择策略能在一定程度上降低上行授权资源碰撞概率
碰撞控制	限制连接请求消息传输	文献[47]	基站根据当前可分配PUSCH资源数，广播消息传输限制因子，以此控制用户发送连接请求消息的数量	未知确切前导序列碰撞程度时，设定限制因子会增大基站侧控制开销，易造成PUSCH资源浪费
资源复用	时域非正交技术	文献[48]	根据用户上行到达时间的不同将其划分为不同群组，每个群组复用同一个PUSCH资源	该方法需要估计用户上行到达时间，且每个资源复用组的生成过程增大了接入能耗
资源复用	空域非正交技术	文献[49]	根据空间位置关系识别发生前导序列碰撞的多个用户，并将它们视为一个NOMA组，复用同一个PUSCH资源	对碰撞用户的识别能力有限，限制了其在大规模随机接入场景中的应用
碰撞解调	分布式导频正交化	文献[50]	将L2/L3连接请求消息中包含的参考导频信号正交化，并采用多天线技术对多个L2/L3连接请求消息进行解调	正交参考导频信号个数有限，不足以支撑大量用户碰撞情况
碰撞解调	子帧间串行干扰消除（SIC, successive interference cancellation）技术	文献[51]	在基础侧部署缓存器，用于存储发生碰撞的L2/L3连接请求消息，再利用子帧间SIC技术进行解调	所提子帧间迭代式SIC技术仅适用于少量用户碰撞的情况

所用序列类型	所满足评估准则	所达重构精度	所需硬件条件
Gaussian 随机序列	RIP准则	较高，设为P_correct	高
Bernoulli 随机序列	RIP准则	≈P_correct	低
Kasami序列^[65]	STRIP准则	>P _correct	低
Udaya-Siddiq序列^[66]	相干性准则	>P _correct	低
Rademacher 序列	Spark下界	>Pcorrect	低

重构算法	计算复杂度
BP	O(N ³)
IT	O(N ²)
LASSO	O(NL logN)
MP	O(NlogN)
OMP	O (KNL)
MAP-CoSaMP	O (NL)
AMP	O (NL)

方案名称	配对过程	优缺点
开环方案	1) 基站广播信道增益门限值τ，免授权用户将自身上行信道增益与门限值比较2) 场景1下，信道增益低于τ的任意免授权用户可与授权用户构成NOMA组；场景2下，信道增益高于τ的任意免授权用户可参与构成NOMA组	优点：控制开销低，允许大量免授权用户复用信道资源
开环方案		缺点：复用系统资源的免授权用户数随机波动，数量大时导致多用户检测复杂度极高，传输性能下降
分布式竞争方案	1) 基于开环方案确定可配对的免授权用户范围2) 开启竞争时间窗口，免授权用户根据自身上行信道增益获取回退值τ_m 3) 场景1下，自身信道增益最差的免授权用户可与授权用户构成NOMA组；场景2下，自身信道增益最好的免授权用户可参与构成NOMA组	优点：复用信道资源的免授权用户数量可控，降低多用户检测算法复杂度，保证传输性能
分布式竞争方案		缺点：控制复杂，网络中共存用户总数下降

方案名称	应用场景	典型接入性能	优缺点
无协调免授权	完成大规模随机接入场景中活跃用户的数据传输	使用信道资源个数为30 000，信噪比为3 dB，活跃用户个数为200时，误码率可达0.05	优点：支持总用户数量大，不需要显式的活跃用户身份检测环节，适用于低时延传输场景
无协调免授权	完成大规模随机接入场景中活跃用户的数据传输	使用信道资源个数为30 000，信噪比为3 dB，活跃用户个数为200时，误码率可达0.05	缺点：无前导序列，信道估计困难，译码器复杂度较高
基于压缩感知的免授权^[74-77]	完成大规模随机接入场景中活跃用户身份检测与信道估计	总用户个数为4 000，前导序列长度为800，信噪比为3 dB,活跃用户个数为200时，误码率可达0.012	优点：联合完成活跃用户身份检测与信道估计，天线个数充分多时，检测误差可迫近零
基于压缩感知的免授权^[74-77]	完成大规模随机接入场景中活跃用户身份检测与信道估计	总用户个数为4 000，前导序列长度为800，信噪比为3 dB,活跃用户个数为200时，误码率可达0.012	缺点：前导序列开销较大，支持总用户数受前导序列长度制约

面向大规模物联网的随机接入：现状、挑战与机遇

Random access for massive Internet of things:current status, challenges and opportunities

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 26

参考文献 89

相关文章 15

Metrics

推荐阅读 0

[1]	杨龙, 赵丽, 周雨晨, 贺冰涛, 陈健. 缓存辅助的协作NOMA携能传输[J]. 通信学报, 2023, 44(6): 77-89.
[2]	杨正, 郑云, 余月好, 吴怡, 董志诚, 邢松. 基于自适应功率分裂的协作非正交多址接入无线携能通信网络性能分析[J]. 通信学报, 2023, 44(1): 177-188.
[3]	孙钢灿, 吴新李, 郝万明, 朱政宇. 基于时延线阵列的毫米波NOMA系统混合预编码设计和功率分配[J]. 通信学报, 2022, 43(6): 179-188.
[4]	张钰, 赵雄文, 王晓晴, 耿绥燕, 秦鹏, 周振宇. 多载波NOMA安全通信系统稳健性资源分配算法[J]. 通信学报, 2022, 43(3): 42-52.
[5]	赵赛, 邹章晨, 黄高飞, 唐冬. 智能反射面辅助毫米波NOMA系统的资源分配联合设计方案[J]. 通信学报, 2022, 43(12): 113-122.
[6]	李陶深, 施安妮, 王哲, 何璐. 基于SWIPT的吞吐量最优化NOMA全双工中继选择策略[J]. 通信学报, 2021, 42(5): 87-97.
[7]	张朝阳, 吴佳佳, 王珏, 周楚. 联合时域-波束域非正交多址接入[J]. 通信学报, 2021, 42(4): 76-88.
[8]	孙钢灿, 赵少柯, 郝万明, 朱政宇. 基于短包通信的NOMA下行链路安全传输[J]. 通信学报, 2021, 42(2): 168-176.
[9]	李国权,林金朝,徐勇军,黄正文,刘挺. 无人机辅助的NOMA网络用户分组与功率分配算法[J]. 通信学报, 2020, 41(9): 21-28.
[10]	景小荣,陈怡西,陈前斌. 基于Matern簇过程的NOMA-HetNet覆盖概率分析[J]. 通信学报, 2020, 41(9): 147-159.
[11]	徐朝农,吴建雄,徐勇军. 时延有界的PD-NOMA物联网高可靠接入算法[J]. 通信学报, 2020, 41(9): 210-221.
[12]	赵飞,郝万明,孙钢灿,周一青,王飞,王毅. 基于SWIPT的毫米波大规模MIMO-NOMA系统下安全能效资源优化[J]. 通信学报, 2020, 41(8): 79-86.
[13]	李陶深,宁倩丽,王哲. SWIPT-NOMA机会协作系统的优化方案[J]. 通信学报, 2020, 41(8): 141-154.
[14]	吴伟华,柴冠华,杨清海,刘润滋. 面向不确定CSI随机接入网络的深度稳健资源分配[J]. 通信学报, 2020, 41(7): 29-37.
[15]	徐勇军,谢豪,陈前斌,林金朝,刘期烈. 基于不完美CSI的异构NOMA网络能效优化算法[J]. 通信学报, 2020, 41(7): 131-140.