Multihop Wireless Networks With Quality-of-Service: Fluid and Diffusion Approximations

We consider a multihop wireless network. There are multiple source destination pairs. We propose a scheduling algorithm to provide end-to-end mean delay guarantees to the flows. We demonstrate that the algorithm is also throughput optimal. Under heavy traffic, we obtain a Brownian approximation of the network. Furthermore, we also show that the stationary distribution of the scaled process of the network converges to that of the Brownian limit, providing an approximation to the stationary distribution under heavy traffic. Finally simulations further verify our claims.