An Improved Random Access Scheme for M2M Communications

被引:4
作者
Yali Wu [1 ,2 ]
Guixia Kang [1 ,2 ]
Yanyan Guo [3 ]
Xia Zhu [1 ]
Ningbo Zhang [1 ,2 ]
机构
[1] Key Laboratory of Universal Wireless Communications, Beijing University of Posts and Telecommunications
[2] Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory
[3] School of Physics and Electronics Engineering, Shanxi University
基金
中国国家自然科学基金;
关键词
machine-to-machine communications; random access; success access; resource allocation;
D O I
暂无
中图分类号
TN929.5 [移动通信]; TP391.44 [];
学科分类号
080402 ; 080904 ; 0810 ; 081001 ; 0811 ; 081101 ; 081104 ; 1405 ;
摘要
In this study, an improved random access(RA) scheme for Machine-to-Machine(M2M) communications is proposed. The improved RA scheme is realized by two steps. First, the improved RA scheme achieves a reasonable resource tradeoff between physical random access channel(PRACH) and physical uplink shared channel(PUSCH). To realize a low-complexity resource allocation between PRACH and PUSCH, a boundary of traffic load is derived to divide the number of active M2 M users(UEs) into multiple intervals. The corresponding resource allocation for these intervals is determined by e NB. Then the resource allocation for other number of UEs can be obtained from the allocation of these intervals with less computation. Second, the access barring on arrival rate of new UEs is introduced in the improved RA scheme to reduce the expected delay. Numerical results show that the proposed improved RA scheme can realize a low-complexity resource allocation between PRACH and PUSCH. Meanwhile, the expected delay can be effectively reduced by access barring on arriving rate of new M2 M UEs.
引用
收藏
页码:12 / 21
页数:10
相关论文
共 2 条
[1]   异构环境下基于3GPP的M2M业务分流算法(英文) [J].
黄铫 ;
田辉 ;
张杰 ;
秦城 .
中国通信, 2013, 10 (09) :65-71
[2]  
Spatial Group Based Random Access for M2M Communications .2 Han Seung Jang,Su Min Kim,Kab Seok Ko,Jiyoung Cha,Dan Keun Sung. IEEE Commun Lett . 2014