A fair scheduling algorithm with traffic classification in wireless networks

communication system, scheduling, wireless network. Wireless channels are characterized by more serious bursty and location-dependent errors. Many packet scheduling algorithms have been proposed for wire-less networks to guarantee fairness and delay bounds. However, most existing schemes do not consider the difference of traffic natures among packet flows. This will cause the delay-weight coupling problem. In par-ticular, serious queuing delays may be incurred for real-time flows. To resolve this problem, we propose a Traffic-Dependent wireless Fair Queuing (TD-FQ) al-gorithm that takes traffic types of flows into considera-tion when scheduling packets. The proposed TD-FQ algorithm not only alleviates queuing delay of real-time flows, but also guarantees bounded delays and fairness for all flows.