Fairness-based scheduling algorithm for TDD mode IEEE 802.16 broadband wireless access systems

Authors:
Sheng-Tzong Cheng;Bafu Chen
Affiliations:
National Cheng Kung University, Tainan, Taiwan, R.O.C.;National Cheng Kung University, Tainan, Taiwan, R.O.C.
Venue:
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Year:
2008

Citing 4
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Ensuring the QoS requirements in 802.16 scheduling

Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
A Scheduling-Based Medium Access Control Protocol for Supporting Multi-class Services in Wireless Networks

The Computer Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

IEEE 802.16 standards specify four types of services, while how to design an efficient scheduling algorithm remains an open issue. Manufacturers can implement their own scheduling algorithms depending on their specific requirements. There are a lot of scheduling algorithms proposed in the literature. Several scheduling algorithms propose hierarchical structures with strict priority or one-level scheduling mechanism. They are based conceptually on the round-robin approaches. However, they don't consider an important factor: fairness. In this paper we propose a fairness strategy algorithm for IEEE 802.16 broadband wireless access networks. The proposed algorithm applies a fairness strategy to utilize the system bandwidth, to achieve the QoS requirements of high priority service flows, and to reduce starvations of low priority service flows. The simulation studies show that the proposed scheduling algorithm provides a flexible way to utilize the system bandwidth.