We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jun-Bae Seo ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada ; Leung, V.C.M.

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 random-access 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 that controlling the persistence value as specified in UMTS is effective in both backoff algorithms. The performances with and without access prioritization schemes are presented in terms of throughput, mean, and variance of packet retransmission delay, packet-dropping probability, and system stability. Finally, we consider a dynamic window assignment algorithm that is based on Bayesian broadcasting, in which the base station adaptively controls the window size of the UB algorithm under unsaturated traffic conditions. Results show that the proposed window assignment algorithm outperforms fixed window assignment in static and dynamic traffic conditions under the assumption of perfect orthogonality between random-access codes.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:60 ,  Issue: 8 )