Secondary Access Class Barring for Machine Type Communications with PUSCH Resource Constraints

With the continuous increase of IoT devices, multiple devices desire to use network resources simultaneously during peak hours and overload conditions, leading to collisions and a reduction in the network’s effective throughput. The Access Class Barring (ACB) method has been proposed as the optimal potential solution in LTE communication networks to overcome this problem. However, existing ACB schemes do not fully utilize preamble resources, and most schemes do not consider the situation where PUSCH resources are limited. Therefore, this paper proposes a two-stage ACB algorithm that considers the situation of limited PUSCH resources. This algorithm recycles part of the preamble resources and sets the ACB factor based on the number of PUSCH resources. Simulation results show that our proposed algorithm significantly outperforms traditional schemes in terms of total service time, delay, throughput, and PUSCH resource efficiency.