An Improved Backoff Algorithm for the Random Access Protocol for the Ranging Subchannel of IEEE 802.16 Networks 


Vol. 32,  No. 12, pp. 1267-1275, Dec.  2007


PDF
  Abstract

An improved backoff algorithm for retransmission randomization for OFDMA/CDMA/slotted ALOHA used in the ranging subchannel of IEEE 802.16 network is proposed. Exploiting the fact that a base station coordinates channel access using UL-/DL-MAP in the IEEE 802.16 networks, we propose a minor modification of the existing IEEE 802.16 in order to increase throughput, decrease delay variation and achieve a graceful performance degradation in case of overload channel condition of the random access protocol. The algorithm basically estimates the number of backlogged users and arrival rate using which, the BS calculates retransmission probability for the subscriber stations involved in a collision. Computer simulation is performed to demonstrate the effectiveness of the proposed algorithm and to compare the performance with existing binary exponential backoff algorithm.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kwon, H. Lee, C. Cho, "An Improved Backoff Algorithm for the Random Access Protocol for the Ranging Subchannel of IEEE 802.16 Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 12, pp. 1267-1275, 2007. DOI: .

[ACM Style]

Jeong-Min Kwon, Hyong-Woo Lee, and Choong-Ho Cho. 2007. An Improved Backoff Algorithm for the Random Access Protocol for the Ranging Subchannel of IEEE 802.16 Networks. The Journal of Korean Institute of Communications and Information Sciences, 32, 12, (2007), 1267-1275. DOI: .

[KICS Style]

Jeong-Min Kwon, Hyong-Woo Lee, Choong-Ho Cho, "An Improved Backoff Algorithm for the Random Access Protocol for the Ranging Subchannel of IEEE 802.16 Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 12, pp. 1267-1275, 12. 2007.