Designing a fair scheduling mechanism for IEEE 802.11 wireless LANs

A fair scheduling mechanism called distributed elastic round robin (DERR) is proposed in this letter for IEEE 802.11 wireless LANs operated in a distributed manner. To quantify the fairness, we not only derive its fairness bound, but also observe the fairness through ratios of throughput and weight using a simulation approach. By numerical comparisons among DERR, distributed deficit round robin (DDRR), and IEEE 802.11e, we demonstrate that DERR outperforms the other two mechanisms in performance and fairness.