A fair scheduling algorithm with adaptive compensation in wireless networks

We propose a fair scheduling algorithm with adaptive compensation (AC-FQ) for wireless networks, which can achieve fairness as well as graceful QoS degradation. AC-FQ changes a flow´s weight according to its queue length. A flow with large (small) queue length means its traffic load is heavy (light). In this way, AC-FQ not only can adaptively compensate recovered error-prone flows based on the traffic load, but also does not degrade the QoS of other error-free flows. Simulation results show that, without sacrificing throughput (queuing delay), AC-FQ has less queuing delay (higher throughput) than CIF-Q (channel-condition independent fair queuing) (see Ng, T.S.E. et al., 1998), which also adopted a compensation mechanism for real time (non-real time) applications. Theoretical analysis of AC-FQ supports that our algorithm has bounds on fairness and throughput