Selective greedy routing: exploring the path diversity in backbone mesh networks

Abstract

This paper proposes a new routing protocol for IEEE 802.11s wireless mesh network to overcome the problems associated with the conventional proactive and reactive routing approaches. The proposed `Selective Greedy' (SelG) routing protocol operates in two phases. In the first phase it exploits the proactive mode of Hybrid Wireless Mesh Protocol, the standard routing protocol for IEEE 802.11s mesh, and constructs a set of potential forwarders for every mesh point, that can act as the next-hop relay. In the second phase, during the actual data communication, a candidate is selected from the set of potential forwarders based on a local optimization. The optimization procedure considers the statistical effect of local link quality fluctuation and interference over the global routing path selection. This way the SelG protocol reduces the control packet flooding in the network (a major drawback for reactive protocols). At the same time, the optimization procedure captures the network dynamics, and thus avoids the possibility of routing based on stale information (a drawback for proactive protocols). The routing properties and the correctness of the SelG protocol is established theoretically, and the performance of the protocol is analyzed through simulation results. The proposed protocol is implemented in an indoor wireless mesh testbed, and the performance is evaluated and compared with other traditional approaches.