| Abstract: |
Wireless mesh networks are a promising way to provide Internet access to fixed and mobile wireless devices. In mesh networks, traffic between mesh nodes and the Internet is routed over mesh
gateways. On the forward path, i.e., from mesh nodes to Internet nodes, for all mesh nodes only route information for one destination, the gateways, needs to be maintained. However, on the
backward path from the Internet to mesh nodes, an individual route for every mesh node is required. In this paper we investigate protocols for backward path routing in wireless mesh networks.
Using simulation experiments with realistic mobility patterns of pedestrians and cars in cities, we compare three protocols, each of which represents a routing protocol family: (i) AODV with an
extension for mesh networks, a reactive routing protocol, (ii) FBR, a proactive routing protocol, and (iii) GSR, a source routing protocol. Our results indicate that FBR has the highest packet
delivery ratio but is not scalable to the network size. The extended AODV seems to be neither scalable nor does it achieve a high packet delivery ratio. A good compromise is provided by GSR,
which is the most scalable to the network size and still achieves a high packet delivery ratio. |
