Wireless mesh network transit link topology optimization method and system
First Claim
1. A method for generating a routing topology for a wireless mesh network, the wireless mesh network having a plurality of internal nodes, at least one edge node, and at least one originating device, each internal node including at least one transit link having a forward direction and a reverse direction, the method comprising:
- determining a plurality of potential routing solutions containing a plurality of paths through the wireless mesh network from the at least one originating device to the at least one edge node such that data communicated from the at least one originating device reaches the at least one edge node in no more than a predetermined quantity of hops, each potential routing solution based on at least one measured wireless communication parameter between internal nodes, determining the plurality of potential routing solutions through the wireless mesh network including;
creating an ordered list using a random arrangement of the internal nodes;
performing a link elimination process using the ordered list to produce a routing solution; and
responsive to determining that the routing solution is unique, storing the routing solution in an array;
evaluating metric calculations for each potential routing solution to determine a preferred routing solution; and
configuring the wireless mesh network to route traffic using the preferred routing solution; and
the link elimination process including;
a) receiving a received signal strength indication (“
RSSI”
) value for both the forward direction and the reverse direction for each transit link of each internal node in the plurality of internal nodes;
b) normalizing the RSSI values for each transit link to produce normalized RSSI values;
c) temporarily eliminating the transit link having the lowest normalized RSSI value on the internal node;
d) verifying that the internal node meets connectivity requirements;
e) responsive to verifying that the internal node meets connectivity requirements, permanently eliminating the transit link; and
f) repeating steps c) through e) for each internal node according an order arranged by the ordered list until no transit links remain eligible for elimination.
3 Assignments
0 Petitions
Accused Products
Abstract
A method and configuration manager generates a routing topology for a wireless mesh network. The wireless mesh network has a plurality of internal nodes, at least one edge node, and at least one originating device. A plurality of potential routing solutions is determined which contain a plurality of paths through the wireless mesh network from the at least one originating device to the at least one edge node such that data communicated from the at least one originating device reaches the at least one edge node in no more than a predetermined number of hops. Each potential routing solution is based on at least one measured wireless communication parameter between internal nodes. Metric calculations for each potential routing solution are computed to determine a preferred routing solution. The wireless mesh network is configured to route traffic using the preferred routing solution.
3 Citations
19 Claims
-
1. A method for generating a routing topology for a wireless mesh network, the wireless mesh network having a plurality of internal nodes, at least one edge node, and at least one originating device, each internal node including at least one transit link having a forward direction and a reverse direction, the method comprising:
-
determining a plurality of potential routing solutions containing a plurality of paths through the wireless mesh network from the at least one originating device to the at least one edge node such that data communicated from the at least one originating device reaches the at least one edge node in no more than a predetermined quantity of hops, each potential routing solution based on at least one measured wireless communication parameter between internal nodes, determining the plurality of potential routing solutions through the wireless mesh network including; creating an ordered list using a random arrangement of the internal nodes; performing a link elimination process using the ordered list to produce a routing solution; and responsive to determining that the routing solution is unique, storing the routing solution in an array; evaluating metric calculations for each potential routing solution to determine a preferred routing solution; and configuring the wireless mesh network to route traffic using the preferred routing solution; and the link elimination process including; a) receiving a received signal strength indication (“
RSSI”
) value for both the forward direction and the reverse direction for each transit link of each internal node in the plurality of internal nodes;b) normalizing the RSSI values for each transit link to produce normalized RSSI values; c) temporarily eliminating the transit link having the lowest normalized RSSI value on the internal node; d) verifying that the internal node meets connectivity requirements; e) responsive to verifying that the internal node meets connectivity requirements, permanently eliminating the transit link; and f) repeating steps c) through e) for each internal node according an order arranged by the ordered list until no transit links remain eligible for elimination. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A configuration manager for configuring a wireless mesh network, the wireless mesh network having a plurality of internal nodes and at least one edge node, each internal node including at least one transit link having a forward direction and a reverse direction, the configuration manager comprising:
-
a wireless communication interface, the wireless communication interface facilitating wireless communication between the configuration manager and the plurality of internal nodes and for communication between the configuration manager and the at least one edge node; and a routing topology generator communicatively coupled to the wireless communication interface, the routing topology generator; determining a plurality of potential routing solutions containing a plurality of paths through the wireless mesh network from the at least one originating device to the at least one edge node such that data communicated from the at least one originating device reaches the at least one edge node in no more than a predetermined quantity of hops, each potential routing solution based on at least one measured wireless communication parameter between internal nodes, determining the plurality of potential routing solutions through the wireless mesh network including; creating an ordered list using a random arrangement of the internal nodes; performing a link elimination process using the ordered list to produce a potential routing solution; and responsive to determining that the potential routing solution is unique, storing the potential routing solution in an array; evaluating metric calculations for each potential routing solution to determine a preferred routing solution; and configuring the wireless mesh network to route traffic using the preferred routing solution; and the link elimination process including; a) receiving a received signal strength indication (“
RSSI”
) value for both the forward direction and the reverse direction for each transit link of each internal node in the plurality of internal nodes;b) normalizing the RSSI values for each transit link to produce normalized RSSI values; c) temporarily eliminating the transit link having the lowest normalized RSSI value on the internal node; d) verifying that the internal node meets connectivity requirements; e) responsive to verifying that the internal node meets connectivity requirements, permanently eliminating the transit link; and f) repeating steps c) through e) for each internal node according an order arranged by the ordered list until no transit links remain eligible for elimination.
-
-
13. A method of generating a routing topology in a wireless network having a plurality of internal nodes, at least one edge node, and at least one originating node, the method comprising:
-
generating a normalized received signal strength indicator (RSSI) associated with each of a plurality of transit links of an internal node; and for each internal node, iteratively eliminating a transit link with a lowest normalized RSSI until a minimum topology is reached such that all edge nodes are reachable from any internal node within a predetermined number of hops. - View Dependent Claims (14, 15, 16, 17, 18, 19)
-
Specification