Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks

Abstract

We consider the problem of routing and centralized scheduling for IEEE 802.16 mesh networks. We first fix the routing, which reduces the network to a tree. We then present scheduling algorithms which provide per flow QoS (Quality of Service) guarantees to real and interactive data applications while utilizing the network resources efficiently. Our algorithms are also scalable: they do not require per flow processing and queueing and the computational requirements are minimal. We also discuss admission control policies which ensure that sufficient resources are available. We have verified our algorithms via extensive simulations.