Oblivious Routing for Wireless Mesh Networks

Abstract

Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best routing solution, existing work assumes traffic demand is static and known a priori. However, recent studies of wireless network traces show that traffic demand, is highly dynamic and hard to estimate. This paper studies an oblivious routing algorithm that is able to provide the optimal worst-case performance on all possible traffic demands users may impose on the wireless mesh network. To the best of our knowledge, this work is the first attempt that investigates oblivious routing in the context of wireless mesh networks. A trace-driven simulation study demonstrates that our oblivious routing solution performs competitively.