Studying Practical Any-to-Any Backpressure Routing in Wi-Fi Mesh Networks From a Lyapunov Optimization Perspective
This paper studies practical backpressure routing strategies in WiFi-based Mesh Networks (WMN). It is practical in the sense that, unlike previous theoretical centralized algorithms, the authors present a distributed implementation of the algorithm with low queue complexity (i.e., one finite data queue at each node) to deal with any-to-any communications. To their knowledge, this is the first practical study based on Neely's Lyapunov optimization framework for WMNs. In fact, they propose a scalable and distributed routing policy that takes control actions based on Lyapunov's drift-plus-penalty minimization combining local queue backlog and 1-hop geographic information.