Optimal contention window assignment for best effort services in IEEE 802.16 systems

Authors:
Chien-Chung Chen;Jean-Lien C. Wu;Chun-Yen Hsu
Affiliations:
National Taiwan University of Science and Technology, Taipei, Taiwan;National Taiwan University of Science and Technology, Taipei, Taiwan;National Taiwan University of Science and Technology, Taipei, Taiwan
Venue:
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
Year:
2007

Citing 3
Cited 0

Performance Analysis of the IEEE 802.16 Wireless Metropolitan Area Network

DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications
The Analysis of the Optimal Contention Period for Broadband Wireless Access Network

PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Queue-Aware Uplink Bandwidth Allocation and Rate Control for Polling Service in IEEE 802.16 Broadband Wireless Networks

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In IEEE 802.16-based networks, the transmission of best effort (BE) traffics is basically controlled by the contention-window size. Subscriber stations (SSs) contend for bandwidth request to allocate uplink bandwidth for BE traffics. The truncated binary exponential backoff algorithm is used to schedule for bandwidth-request retransmissions in IEEE 802.16-2004 standard. In this paper, we propose a contention-window size assignment scheme for the base station. The contention-window size is updated dynamically according to the arrival rate of BE traffics and the number of SSs which encountered transmission collision for bandwidth-request. Simulation results show that the proposed scheme indeed can improve throughput and delay in the transmission of bandwidth-request. Moreover, the proposed scheme offers optimal throughput for BE traffics.