Robust and Efficient Routing in Wireless Mesh Networks

Abstract

Wireless Mesh Networks have proven immensely valuable in extending the reach, speed of deployment and flexibility of networks. Routing in wireless mesh networks is complicated by channel interference, multi-hop pathways and the highly unpredictable nature of traffic demands, due to mobile clients and diversity of services. The goal of this dissertation is a routing strategy which provides the best possible worst-case performance while achieving a balance with the average case. We establish a baseline of a robust worst-case using oblivious routing, which uses no knowledge of traffic demand. We extend this using a series of demand models with increasing focus and time-awareness and incorporate them into our solution to enhance the average case with minimal risk to the worst-case. Finally, we accommodate multichannel and multiradio models to provide practical routings for realistic networks.