Adaptive Distributed Time-Slot Based Scheduling for Fairness in Multi-Hop Wireless Networks


Recent research indicates that multi-hop wireless networks can suffer from extreme imbalances in the throughput achieved by simultaneous competing flows. We address this problem by designing a practical distributed algorithm to compute a time-slot based schedule that provides end-to-end max-min fairness. Our system uses randomized priorities based on local… (More)
DOI: 10.1109/ICDCS.2008.108

8 Figures and Tables


  • Presentations referencing similar topics