# US 8,279,842 B2 · Route selection system and method for promoting route distributions among multiple devices in a wireless mesh network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 8,279,842 B2
- Document ID: US8279842B2
- Status: Granted
- Kind: B2
- Application number: 12/467,530
- Filed: 2009-05-18
- Published: 2010-11-18
- Granted: 2012-10-02
- Earliest claimed: 2009-05-18
- Assignees: Digi International Inc.
- Inventors: Damon M. Stewart
- Web page: https://patentgrep.com/patent/US8279842B2

## CPC

- H04W 40/04: based on wireless node resources
- H04W 40/12: based on transmission quality or channel quality
- H04W 4/06: Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
- H04W 24/00: Supervisory, monitoring or testing arrangements
- H04W 40/28: for reactive routing
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

In a mesh network having a plurality of wireless nodes, including a first, second, third and fourth node, wherein each node includes a routing table, a method of route discovery. A first route request message is broadcasted from the first node and received at the second and third nodes. In the second node, a link quality metric is calculated as a function of link quality of the link to the first node and as a function of capacity in the routing table of the second node. In the third node, a link quality metric is calculated as a function of link quality of the link to the first node and as a function of capacity in the routing table of the third node. A second route request message is broadcasted from the second node and received by the fourth node, wherein the second route request message includes the link quality metric calculated by the second node. A third route request message is broadcasted from the third node and received by the fourth node, wherein the third route request message includes the link quality metric calculated by the third node. A route path is selected as a function of the link quality metric calculated by the second node and the link quality metric calculated by the third node.

## Claims

### Claim 1

In a mesh network having a plurality of wireless nodes, including a first, second, third and fourth node, wherein each node includes a routing table, a method of route discovery, comprising:
broadcasting a first route request message from the first node;
receiving the first route request message at the second and third nodes;
calculating, in the second node, a link quality metric as a function of link quality of the link to the first node and as a function of capacity in the routing table of the second node;
calculating, in the third node, a link quality metric as a function of link quality of the link to the first node and as a function of capacity in the routing table of the third node;
broadcasting a second route request message from the second node, wherein the second route request message includes the link quality metric calculated by the second node;
broadcasting a third route request message from the third node, wherein the third route request message includes the link quality metric calculated by the third node;
receiving, at the fourth node, the second and third route request messages; and
selecting a route path as a function of the link quality metric calculated by the second node and the link quality metric calculated by the third node.

### Claim 2 (depends on 1)

The method of claim 1, wherein the link quality metric is a function of the received signal strength (RSSI) of the first route request message.

### Claim 3 (depends on 1)

The method of claim 1, wherein the link quality metric is a function of the silence value associated with the first route request message.

### Claim 4 (depends on 1)

The method of claim 1, wherein calculating a link quality metric at the second node includes determining a link quality value reflective of the link quality of the link to the first node and modifying that link quality value as a function of a parameter that changes as a function of the number of empty slots in the routing table.

### Claim 5 (depends on 4)

The method of claim 4, wherein the link quality metric is a function of the received signal strength (RSSI) of the first route request message.

### Claim 6 (depends on 4)

The method of claim 4, wherein the link quality metric is a function of the silence value associated with the first route request message.

### Claim 7 (depends on 1)

The method of claim 1, wherein calculating a link quality metric at the second node includes determining a link quality value reflective of the link quality of the link to the first node and modifying that link quality value as a. function of a parameter that changes as a function of the number of empty slots in the routing table, wherein the parameter is selected to encourage distribution of routes across multiple nodes.

### Claim 8 (depends on 1)

The method of claim 1, wherein the link quality metric at the second node includes a first and a second metric value, wherein determining the first metric value includes determining a link quality value reflective of the link quality of the link to the first node and wherein determining the second metric value includes determining a parameter that changes as a function of the number of empty slots in the routing table.

### Claim 9 (depends on 8)

The method of claim 8, wherein the first metric value is a function of the received signal strength (RSSI) of the first route request message.

### Claim 10 (depends on 8)

The method of claim 8, wherein the first metric value is a function of the silence value associated with the first route request message.

### Claim 11 (depends on 1)

An article comprising a non-transitory computer readable medium having instructions thereon, wherein the instructions, when executed by a machine, create a system for executing the method of claim 1.

### Claim 12

A system, comprising:
a plurality of wireless devices, wherein each wireless device includes a radio transmitter, a radio receiver and a routing table;
wherein the wireless devices form a routing-table-based mesh network;
wherein each wireless device includes means for calculating a link quality metric as a function of link quality of a link between the radio receiver of the wireless device and a radio transmitter on another wireless device and further as a function of capacity in the routing table of the particular wireless device; and
wherein route discovery is performed as a function of the link quality metric.

### Claim 13 (depends on 12)

The system of claim 12, wherein the routing-table-based mesh network is an ad-hoc on-demand distance vector (AODV)-based network.

### Claim 14 (depends on 12)

The system of claim 12, wherein the link quality metric is a function of the received signal strength (RSSI) of a route request message received from another wireless device.

### Claim 15 (depends on 12)

The system of claim 12, wherein the link quality metric is a function of the silence value of a route request message received from another wireless device.

### Claim 16 (depends on 12)

The system of claim 12, wherein the means for calculating a link quality metric includes means for determining a link quality value reflective of the link quality of the link to the other node and means for modifying that link quality value as a function of a parameter that changes as a function of the number of empty slots in the routing table of the wireless device.

### Claim 17 (depends on 16)

The system of claim 16, wherein the link quality metric is a function of the received signal strength (RSSI) of a route request message received from another wireless device.

### Claim 18 (depends on 16)

The system of claim 16, wherein the link quality metric is a function of the silence value of a route request message received from another wireless device.
