Uni- source and multi-source m-ary tree algorithms for best effort service in wireless MAN

  • Authors:

  • Jin Kyung Park;Woo Cheol Shin;Jun Ha;Cheon Won Choi

  • Affiliations:

  • Dankook University, Seoul, Korea;Dankook University, Seoul, Korea;Dankook University, Seoul, Korea;Dankook University, Seoul, Korea

  • Venue:
  • ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

IEEE 802.16 WirelessMAN standard specifies the air interface of broadband wireless access systems providing multiple services. In the wireless MAN, the best effort service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. In such a MAC scheme, a collision of resource requests is unavoidable so that wireless MAN standard adopted a truncated binary exponential backoff algorithm to arbitrate request attempts. However, it was revealed that a truncated binary exponential backoff algorithm may deteriorate delay and throughput performance due to its capture or starvation effect. Aiming at improving such performance, we propose uni-source and multi-source m-ary tree algorithms as alternatives to resolve request collisions in a wireless MAN. For the uni-source m-ary tree algorithm, we first develop an analytical method to calculate the maximum throughput. Secondly, using the analytical method as well as simulation method, we evaluate maximum throughput, mean and variance of MAC PDU delay. From numerical results, we confirm that proposed algorithms invoke superior delay and throughput performance to a truncated binary exponential backoff algorithm.