Routing in multi-radio, multi-hop wireless mesh networks

Abstract

We present a new metric for routing in multi-radio, multihop wireless networks. We focus on wireless networks with stationary nodes, such as community wireless networks.The goal of the metric is to choose a high-throughput path between a source and a destination. Our metric assigns weights to individual links based on the Expected Transmission Time (ETT) of a packet over the link. The ETT is a function of the loss rate and the bandwidth of the link. The individual link weights are combined into a path metric called Weighted Cumulative ETT (WCETT) that explicitly accounts for the interference among links that use the same channel. The WCETT metric is incorporated into a routing protocol that we call Multi-Radio Link-Quality Source Routing.We studied the performance of our metric by implementing it in a wireless testbed consisting of 23 nodes, each equipped with two 802.11 wireless cards. We find that in a multi-radio environment, our metric significantly outperforms previously-proposed routing metrics by making judicious use of the second radio.

Joint logical topology design, interface assignment, channel allocation, and routing for multi-channel wireless mesh networks

“…The channel allocation algorithms in MC-WMNs can also be classified as static and dynamic. The static algorithms (e.g., [16], [17]) assign a channel to each network interface permanently, while dynamic algorithms (e.g., [1], [18]) allow each network interface to change its channel in some short or long intervals. Unlike the static algorithms, the dynamic channel allocation requires a coordination mechanism to ensure that the sending and the receiving routers/NICs use the same frequency channel at the same time.…”

“…Therefore, the modified problem only has a few integer variables and can be solved easily. Given the sub-optimal topology formation, interface assignment and channel allocation solutions, the routing path from source s to destination d is assigned by traversing the logical topology from source s to destination d, and by choosing the next hop based on the maximum observed value for routing variable a (lines [10][11][12][13][14][15][16][17][18]. The intuitive justification is that if the relaxed a sd mn,i is close to 1, it indicates that it is better to forward the packets from source s to destination d on the logical link (m, n) over channel i.…”

Robot swarm communication networks: Architectures, protocols, and applications

“…Also, link loss ratio is not considered. Draves and Padhye [9] further considered multi-rate capability and combine link capacity and ETX for better performance in multi-radio, multi-hop wireless mesh networks. They propose Weighted Cumulative Expected Transmission Time (WCETT) to account for the interference among links that use the same channel.…”

Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks

“…The multi-hop routing problem for ad hoc networks was investigated thoroughly. One of the commonly used heuristics for routing is based on finding paths with maximum bottlenecks, namely, paths for which the edge with the lowest capacity is maximum [DPZ04]. We used this algorithm in our benchmarks (we call it SHORTP).…”