LAUSR

Commercial long-term evolution (LTE) systems adopt an access class barring (ACB) mechanism in the initial random access procedure with multiple preambles in order to accommodate bursty traffic arrivals of machine-type communications. In this paper, we propose two Bayesian ACB algorithms that estimate the number of active machine devices based only on the number of idle preambles in each slot. In the commercial LTE systems, eNodeB cannot instantaneously distinguish if a particular preamble is sent from a single device (i.e., success) or multiple devices (i.e., collision). However, the idle preambles can be instantaneously detected at the base station (BS) in each slot. Numerical results show that the proposed algorithms yield quite similar performance with the ideal ACB algorithm, assuming that the exact number of active devices is known to the eNodeB.