Fair Scheduling With Bottleneck Consideration in Wireless Ad-Hoc Networks
Most research work in the area of wireless ad-hoc networks attempts to balance the trade-off between fairness and channel utilization. In this paper, the authors first propose a topology-independent methodology to predict maximum achievable channel utilization under fairness constraint by two performance bounds. Based on the notion of bottlenecks introduced in prediction, they design a centralized and improved fair scheduling algorithm for wireless ad-hoc networks. They capture traffic load characteristics by using a proposed parameter that represents the "Contending power" of nodes in the weighted flow contention graph.