Fair Scheduling in Wireless Multi-Hop Self-backhaul Networks

In this paper, we provide guidelines for high throughput wireless multi-hop self-backhaul networks which at the same time retain fairness. Based on the theoretical analysis results, we propose two fair scheduling strategies: static independent fair scheduling and dynamic joint fair scheduling. Simulations verify that, both schemes can achieve maximum throughput and exhibits fairness between base stations in a multi-hop self-backhaul chain. Moreover, dynamic joint fair scheduling method achieves improved performance in throughput and exhibits better fairness in network environments where asymmetric services are presented.