On the throughput-optimal distributed scheduling schemes with delay analysis in multi-hop wireless networks

摘要

With K-hop interference model, especially when K ≥ 2, the throughput-optimal centralized scheduler needs to solve a NP-Hard problem. It leads to the desire of a distributed, low-complexity but throughput-optimal scheduling algorithm. We generalize a randomized scheduling framework for a K-hop interference model and develop two randomized distributed scheduling algorithms which can be integrated into this framework. The delay performance of our scheme is also characterized.