Cross-layer design techniques for interference-aware routing configuration in wireless mesh networks
Methods, apparatuses and systems directed to facilitating increased throughput in wireless mesh networks. Generally, according to one implementation of the present invention, routing nodes in a wireless mesh network combine metrics corresponding to the link and network layers to select a route to a root node in the wireless mesh network. In one implementation, for each neighbor, a given routing node computes a routing metric, which is based on the computed route cost and hop count, and selects a preferred neighbor as the parent routing node based on the best routing metric.
1. A routing node operative to communicate with neighboring routing nodes in a wireless network, the routing node comprising:
one or more wireless network interfaces;
one or more processors;
a memory comprising a receive queue and a transmit queue; and
a routing node application, physically stored in the memory, comprising instructions configured, when executed, to cause the one or more processors and the routing node to
receive a route cost and a hop count from one or more neighboring routing nodes;
compute a hop cost, wherein the hop cost is based at least in part on a queued packet delivery ratio and a transmitted packet delivery ratio observed at the routing node, wherein the transmitted packet delivery ratio is a number of successfully transmitted packets over a number of packet transmission attempts, and wherein the queued packet delivery ratio is a number of packets written onto the transmit queue over a number of packets written on to the receive queue; and
select a neighboring routing node for upstream packet transmissions to a destination node based at least in part on the route cost and hop count corresponding to one or more neighboring routing nodes, and the hop cost.
2. The routing node of claim 1 wherein the routing node application further comprises instructions configured, when executed, to cause the one or more processors and the routing node to
compute, for each neighboring routing node in the one or more neighboring routing nodes, a second route cost based the hop cost and the route cost of the respective neighboring routing node.
3. The routing node of claim 2 wherein the routing node application further comprises instructions configured, when executed, to cause the one or more processors and the routing node to
compute, for each neighboring routing node in the one or more neighboring routing nodes, a second hop count based on the hop count of the respective neighboring routing node.
4. The routing node of claim 3 wherein the routing node application further comprises instructions configured, when executed, to cause the one or more processors and the routing node to
compute, for each neighboring routing node in the one or more neighboring routing nodes, a routing metric based on the product of the second route cost and the second hop count corresponding to a respective neighboring routing node.
5. The routing node of claim 4 wherein the routing node application further comprises instructions configured, when executed, to cause the one or more processors and the routing node to
advertise the second route cost and the second hop count corresponding to the selected neighboring routing node to other neighboring routing nodes.
6. The routing node of claim 3 wherein the second route cost and the second hop count are weighted such that a selected one of the second route cost and the second hop count has greater influence in the resulting value of a routing metric.
7. The routing node of claim 1 wherein the destination node is a root node in a hierarchical wireless mesh network.
8. In a routing node operative to communicate with neighboring routing nodes in a wireless network, a method comprising:
receiving packets into a receive queue of the routing node and transmitting the received packets from a transmit queue of the routing node;
receiving, at the routing node, a route cost and a hop count from one or more neighboring routing nodes;
computing, at the routing node, a hop cost, wherein the hop cost is based at least in part on a queued packet delivery ratio and a transmitted packet delivery ratio observed at the routing node, wherein the transmitted packet delivery ratio is a number of successfully transmitted packets over a number of packet transmission attempts, and wherein the queued packet delivery ratio is a number of packets written onto the transmit queue over a number of packets written on to the receive queue; and
selecting, at the routing node, a neighboring routing node for upstream packet transmissions to a destination node based at least in part on the route cost and hop count corresponding to one or more neighboring routing nodes, and the hop cost.
9. The method of claim 8 further comprising computing, for each neighboring routing node in the one or more neighboring routing nodes, a second route cost based the hop cost and the route cost of the respective neighboring routing node.
10. The method of claim 9 further comprising computing, for each neighboring routing node in the one or more neighboring routing nodes, a second hop count based on the hop count of the respective neighboring routing node.
11. The method of claim 10 further comprising computing, for each neighboring routing node in the one or more neighboring routing nodes, a routing metric based on the product of the second route cost and the second hop count corresponding to a respective neighboring routing node.
12. The method of claim 11 further comprising advertising the second route cost and the second hop count corresponding to the selected neighboring routing node to other neighboring routing nodes.
13. The method of claim 10 wherein the second route cost and the second hop count are weighted such that a selected one of the second route cost and the second hop count has greater influence in the resulting value of a routing metric.
14. The routing node of claim 1 wherein the number of packet transmission attempts is estimated based on a sum of the number of packets successfully transmitted by the routing number and the product of a maximum packet transmission retry limit and a number of packets dropped from the transmit queue.
15. The routing node of claim 1 wherein the hop cost is a product of the queued packet delivery ratio and the transmitted packet delivery ratio.
16. The method of claim 8 wherein the number of packet transmission attempts is estimated based on a sum of the number of packets successfully transmitted by the routing number and the product of a maximum packet transmission retry limit and a number of packets dropped from the transmit queue.