On the Reliability of LTE Random Access: Performance Bounds for Machine-to-Machine Burst Resolution Time

by   Mikhail Vilgelm, et al.

Random Access Channel (RACH) has been identified as one of the major bottlenecks for accommodating massive number of machine-to-machine (M2M) users in LTE networks, especially for the case of burst arrival of connection requests. As a consequence, the burst resolution problem has sparked a large number of works in the area, analyzing and optimizing the average performance of RACH. However, the understanding of what are the probabilistic performance limits of RACH is still missing. To address this limitation, in the paper, we investigate the reliability of RACH with access class barring (ACB). We model RACH as a queuing system, and apply stochastic network calculus to derive probabilistic performance bounds for burst resolution time, i.e., the worst case time it takes to connect a burst of M2M devices to the base station. We illustrate the accuracy of the proposed methodology and its potential applications in performance assessment and system dimensioning.


page 1

page 2

page 3

page 4


Grant-Free Massive Random Access With a Massive MIMO Receiver

We consider the problem of unsourced random access (U-RA), a grant-free ...

Modeling and Analysis of mMTC Traffic in 5G Base Stations

Massive Machine-Type Communications (mMTC) are one of the three types of...

Active User Identification in Fast Fading Massive Random Access Channels

Reliable and prompt identification of active users is critical for enabl...

Dynamic Binary Countdown for Massive IoT Random Access in Dense 5G Networks

Massive connectivity for Internet of Things applications is expected to ...

A Probabilistic Approach to Model SIC based RACH mechanism for Massive Machine Type Communications in Cellular Networks

In a cellular Internet of Things, burst transmissions from millions of m...

Please sign up or login with your details

Forgot password? Click here to reset