Modeling and Analysis of an Extended Access Barring Algorithm for Machine-Type Communications in LTE-A Networks

Cheng, Ray-Guang; Chen, Jenhui; Chen, Dan-Wu; Wei, Chia-Hung

doi:10.1109/twc.2015.2398858

Cited by 105 publications

(87 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hard constraint can be enforced by substituting the term M (1 − p i /M )n i in Eqn. (20), representing the expected number of idle preambles, with the observed value M I i . Later, upon completion of the contention round (line 11 of the pseudocode), gNB observes the number of successful outcomes s i and updates the backlog estimation.…”

Section: Ues Undergo Bccr and (If Successful) Transmit Msg3smentioning

confidence: 99%

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

Vilgelm

Linares

Kellerer

2019

IEEE Internet Things J.

View full text Add to dashboard Cite

Massive connectivity for Internet of Things applications is expected to challenge the way access reservation protocols are designed in 5G networks. Since the number of devices and their density are envisioned to be orders of magnitude larger, state-of-the-art access reservation, Random Access (RA) procedure, might be a bottleneck for end-to-end delay. This would be especially challenging for burst arrival scenarios: Semisynchronous triggering of a large number of devices due to a common event (blackout, emergency alarm, etc.). In this article, to improve RA procedure scalability, we propose to combine Binary Countdown Contention Resolution (BCCR) with the state-of-theart Access Class Barring (ACB). We present a joint analysis of ACB and BCCR and apply a framework for treating RA as a biobjective optimization, minimizing the resource consumption and maximizing the throughput of the procedure in every contention round. We use this framework to devise dynamic load-adaptive algorithm and simulatively illustrate that the proposed algorithm reduces the burst resolution delay while consuming less resources compared to the state-of-the-art techniques.

show abstract

Section: Ues Undergo Bccr and (If Successful) Transmit Msg3smentioning

confidence: 99%

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

Vilgelm

Linares

Kellerer

2019

IEEE Internet Things J.

View full text Add to dashboard Cite

show abstract

“…To solve the congestion problem, several mechanisms have been proposed [7]. In [8], a mechanism has been proposed to determine when access control is enabled or disabled.…”

Section: Related Workmentioning

confidence: 99%

Efficient Data Forwarding for Machine Type Communications in Internet of Things Networks

Lim

Park

2017

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The MTC (Machine Type Communications) system is one of the most promising technologies to provide IoT (Internet of Things) applications. The MTC system suffers from congestion due to limited data transmission capacity and burst traffic. The congestion disturbs data delivery, results in an increase of energy consumption due to data retransmission, and finally poses a threat to the providers of IoT applications. In this paper, we focus on the congestion problem and present an efficient data forwarding mechanism to regulate the burst channel access from a large number of MTC devices. To regulate the communication channel access from the devices, we predict the number of devices by separating traffic load into the prediction of the number of devices that newly attempt to have access and the prediction of the number of devices that retry to access the channel. Through simulations, we show that our mechanism improves access success probability and reduces collision probability and access delay.

show abstract

“…For a system with L power levels, to compute the probability of failure in the decoding of MTCD L 's data/scheduled-request at the eNB, denoted by q K L , we continue as follows. Define K L as a set of all vectors satisfying condition Equation 15 (see the study of Khoshnevis and Khalaj 21 ):…”

Section: Model 2: Sir-based Modelmentioning

confidence: 99%

“…is the binomial probability mass function. Since q K L is the probability of all vectors like k which satisfying condition Equation 15, this probability is equivalent to the sum of q k as…”

Section: Model 2: Sir-based Modelmentioning

confidence: 99%

A multiple power level random access method for M2M communications in LTE‐A network

Alavikia

Ghasemi

2016

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

Access control is an effective way to protect the radio access part of Long‐Term Evolution–Advanced (LTE‐A) network from the overload caused by a huge number of Machine‐Type Communication Devices (MTCDs). A class of access control mechanisms is the Access Class Barring (ACB), which regulates the Machine‐to‐Machine (M2M) traffic in accordance with the available Random Access (RA) resources. In this paper, we extend the single power level ACB scheme to a multiple power level method to increase the number of successfully transmitted requests in the case of overload. Our analysis is based on the capture effect in the third step of RA procedure of the LTE‐A system in which one of the transmitted requests by 2 or more co‐tagged MTCDs, MTCDs which use the same preamble in the first step, can be decoded by the evolved–Node B (eNB). We first formulate the power level selection as an optimization problem assuming the perfect capture model without considering MTCDs' energy budget. Then, to take into account MTCDs' energy consumption, the scenario is extended for the signal‐to‐interference ratio–based capture model. In addition, we investigate the advantages of the proposed multiple power level RA method on discriminating the access of MTCDs with different priorities. The numerical results show that using the optimal parameters, the RA throughput can be improved in comparison with the single power level system at the cost of slightly increasing MTCDs' energy consumption and the complexity of RA procedure.

show abstract

Modeling and Analysis of an Extended Access Barring Algorithm for Machine-Type Communications in LTE-A Networks

Cited by 105 publications

References 8 publications

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

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

Efficient Data Forwarding for Machine Type Communications in Internet of Things Networks

A multiple power level random access method for M2M communications in LTE‐A network

Contact Info

Product

Resources

About