Uni-source and Multi-source m-Ary Tree Algorithms for Best Effort Service in Wireless MAN
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.
Unable to display preview. Download preview PDF.
- 5.IEEE 802.16c-2002, IEEE Standard for Local and metropolitan area networks-Part 16: Air Interface for Fixed Broadband Wireless Access Systems-Amendment 1: Detailed System Profiles for 10-66 GHz (January 2003)Google Scholar
- 6.Park, J., Shin, W., Ha, J., Choi, C.: Maximal Grant for Resource Request Supporting Best Effort Service in Wireless MAN. In: Proceedings of International Conference on Networking, pp. 356–362 (2004)Google Scholar
- 8.Whetten, B., Steinberg, S., Ferrari, D.: The Packet Starvation Effect in CSMA/CD LANs and a Solution. In: Proceedings of the 19th Conference of Local Computer Networks, pp. 206–217 (1994)Google Scholar