A fair scheduling algorithm with adaptive compensation in wireless networks

Abstract

In this paper, 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 (tight). In this way, AC-FQ can not only adaptively compensate recovered error-prone flows based on its traffic load, but also does not degrade the QoS of other error-free flows. Simulation results show that, without sacrificing throughput (queuing delay), ACFQ has less queuing delay (higher throughput) than CIF-Q, 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.