Scheduling in multihop wireless networks without back-pressure

This paper focuses on scheduling in multihop wireless networks. The well-known back-pressure scheduling algorithm is throughput optimal, but requires constant exchange of queue-length information among neighboring nodes for calculating the “back-pressure”. In this paper, we propose a self-regulated MaxWeight scheduling, which does not require back-pressure calculation. We prove that the self-regulated MaxWeight scheduling is throughput optimal when the traffic flows are associated with fixed routes and deterministic arrivals.