2011
DOI: 10.1109/tvt.2011.2166569
|View full text |Cite
|
Sign up to set email alerts
|

Design and Analysis of Backoff Algorithms for Random Access Channels in UMTS-LTE and IEEE 802.16 Systems

Abstract: Abstract-In this paper, we examine the performance of uniform backoff (UB) and binary exponential backoff (BEB) algorithms with retry limit, which can be used in the randomaccess channels of Universal Mobile Telecommunication System (UMTS)-Long Term Evolution (LTE) and IEEE 802.16 systems under the assumption of finite population under unsaturated traffic conditions. Additionally, we consider access prioritization schemes to provide differential performance by controlling various system parameters. We show tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
34
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 68 publications
(34 citation statements)
references
References 14 publications
0
34
0
Order By: Relevance
“…Among these latencies, some are deterministic processing latency, some are latencies related to signal detection, and others are random access latencies related to business activity [22]. Most projects of current research focus on computing of mean value and variance for random access latency; there are few projects of research that focus on probability density function (PDF) [23][24][25] of random access latency [26][27][28]. With quantity of waiting users and channel busy/idle as state variables, the moment generating function (MGF) for PDF of random access latency is deduced based on Markov process in [25,29,30].…”
Section: Related Workmentioning
confidence: 99%
“…Among these latencies, some are deterministic processing latency, some are latencies related to signal detection, and others are random access latencies related to business activity [22]. Most projects of current research focus on computing of mean value and variance for random access latency; there are few projects of research that focus on probability density function (PDF) [23][24][25] of random access latency [26][27][28]. With quantity of waiting users and channel busy/idle as state variables, the moment generating function (MGF) for PDF of random access latency is deduced based on Markov process in [25,29,30].…”
Section: Related Workmentioning
confidence: 99%
“…Several studies have examined slotted-Aloha-based preamble contention in conjunction with mechanisms that resemble access barring. Seo and Leung [15] (and the closely related model by Yang et al [16]) considered a persistence probability in their Markov-process-based analysis of backoff algorithms. However, in [15], barred UE requests retry the ABC in each subsequent slot.…”
Section: Background and Related Workmentioning
confidence: 99%
“…In [1,2], the authors propose a backoff scheme but only consider the users priority without group priority and the times of unsuccessful sending. Users priority don't be considerd in PUSCH power control proposed in [3,4].…”
Section: Figure 1 Point To Multipoint Group Communication Modelmentioning
confidence: 99%