CS-WFQ: a wireless fair scheduling algorithm for error-prone wireless channels

Wireless environment properties, such as fading, multipath and interference, mean that the capacity is time-varying and the errors are location dependent. This makes it difficult to directly extend algorithms developed for wire-line networks to wireless networks. In order to support relatively differentiated QoS requirements over a time-varying shared wireless medium with location-dependent errors, we propose in this paper a wireless fair scheduling algorithm which tries both to provide short-term fairness in the rate proportional guarantee sense and to maintain a reasonable system throughput. We present both the numerical and simulation results in this paper to verify that CS-WFQ (channel-state independent wireless fair queueing) has improved the short-term fairness property in error-prone wireless environments.