Chinese Journal on Internet of Things ›› 2021, Vol. 5 ›› Issue (1): 90-98.doi: 10.11959/j.issn.2096-3750.2021.00164

• Theory and Technology • Previous Articles     Next Articles

Large-scale terminal access algorithm based on slot ALOHA and adaptive access class barring

Zhenyu ZHU, Xiaorong ZHU, Yan CAI, Hongbo ZHU   

  1. College of Telecommunications &Information Engineering, Nanjing University of Posts and Telecommunication, Nanjing 210003, China
  • Revised:2020-03-24 Online:2021-03-30 Published:2021-03-01
  • Supported by:
    The National Natural Science Foundation of China(61871237);The Jiangsu Province Key R&D Plan(BE2019017)


In order to solve the problem of high collision rate and low timeliness of large-scale terminals access in the Internet of things, a large-scale terminal access algorithm based on slot ALOHA and adaptive access class barring (ACB) was proposed.Firstly, the services were classified based on the data from each terminal by the volume of the services processed and the requirements for delay.For the services that were not time-sensitive and whose effective data portion was less than 1 000 bit, a slot-based ALOHA-based competitive access method was used.ACB-based random access was used for the services that were time-sensitive or whose data portion was greater than 1 000 bit.On this basis, a method was proposed for predicting the access application volume based on the quantitative estimation, and dynamically adjusting the ACB control parameters based on this predicted value.Simulation results show that compared with other existing access algorithms, the proposed algorithm reduces the collision rate and improves the system access success rate under the premise of ensuring the high priority service delay requirements.

Key words: Internet of things, massive access, time series prediction, adaptive access class barring

CLC Number: 

No Suggested Reading articles found!