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...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.展开更多
基金supported by Key Laboratory of Universal Wireless Communications(Beijing University of Posts and Telecommunications),Ministry of Education,P.R.China,KFKT-2014103)National Science and Technology Major Project of China(No.2013ZX03006001)National Natural Science Foundation of China(61501056)
文摘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.
