Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A method of generating a routing topology for a wireless network, the method comprising: determining, by a computer system, a plurality of potential paths through the wireless network from an originating node to an edge node, wherein the wireless network comprises one or more internal nodes, each of the one or more internal nodes having at least one transit link, each potential path comprising at least one hop, wherein determining each potential path comprises: (a) temporarily eliminating a transit link having a worst radio frequency parameter value for an internal node; (b) determining whether the internal node meets connectivity requirements; (c) responsive to determining that the internal node meets connectivity requirements, permanently eliminating the transit link; and repeating steps (a), (b), and (c) for each internal node until no transit links remain eligible for elimination; calculating, by the computer system, a metric for each potential path, the metric for each potential path based on at least one radio frequency parameter measured for each hop in the respective potential path; determining, by the computer system, based on the calculated metric, a preferred path of the plurality of potential paths through the wireless network from the originating node to the edge node; and configuring, by the computer system, the wireless network to route traffic from the originating node to the edge node using the preferred path, wherein said configuring the wireless network comprises blocking one or more wireless links between nodes in the wireless network.
A computer system optimizes routing in a wireless mesh network by finding the best path from a source node to a destination node. It identifies multiple possible paths through the network, which includes intermediate nodes. To find these paths, the system iteratively removes the weakest wireless link of each intermediate node based on a radio frequency parameter. After each removal, it checks if the node can still maintain connectivity. If connectivity is maintained, the link is permanently removed. This continues until no more links are eligible for removal. Each potential path is then evaluated using a metric based on radio frequency signal strength. The best path, based on this metric, is selected, and the network is configured to use that path, which may involve blocking other wireless links to enforce the selected route.
2. The method of claim 1 , wherein determining the plurality of potential paths comprises eliminating potential paths having a hop count greater than a predetermined maximum hop count.
The wireless mesh network routing optimization method described previously also limits the number of hops in potential paths. When finding possible routes from the source to destination, any path exceeding a pre-defined maximum number of hops is automatically discarded, in addition to the link elimination and metric calculations described before. This prevents excessively long routes from being considered, improving overall network performance and reducing latency.
3. The method of claim 1 , wherein the metric for each potential path is based on at least one received signal strength indication (RSSI).
In the wireless mesh network routing optimization method, the metric used to evaluate potential paths is based on the Received Signal Strength Indication (RSSI) for each hop along the path. This means that when calculating the quality of a potential route, the signal strength between each node in the path is considered, with stronger signals generally leading to a better overall path metric. This RSSI value contributes to the overall score that determines the preferred path.
4. The method of claim 3 , wherein the metric for each potential path is based on a RSSI in a forward direction and a RSSI in a reverse direction for each hop in the respective potential path.
Building upon the RSSI-based path metric, the wireless mesh network routing optimization method considers RSSI in both the forward and reverse directions for each hop. Instead of just evaluating signal strength from one node to the next, it also considers the signal strength in the opposite direction. This provides a more complete picture of the link quality and accounts for potential asymmetry in signal strength between nodes, leading to a more robust path selection.
5. The method of claim 4 , further comprising normalizing the RSSI in the forward direction and the RSSI in the reverse direction to generate a normalized RSSI for each hop of each potential path.
The wireless mesh network routing optimization method refines the RSSI measurements by normalizing the forward and reverse RSSI values for each hop before using them in the path metric calculation. This normalization process aims to reduce the impact of any individual high or low RSSI readings and provide a more consistent measure of link quality, improving the accuracy of the overall path evaluation.
6. The method of claim 5 , wherein generating the normalized RSSI for each hop comprises multiplying the RSSI in the forward direction by the RSSI in the reverse direction for each hop.
The normalization of the forward and reverse RSSI values involves multiplying the RSSI values for each direction to generate a single normalized RSSI value for each hop. This single value represents the overall quality of the link, and it is incorporated into the path metric calculation, making the selection of the preferred path more accurate by accounting for the combined signal strength in both directions.
7. The method of claim 4 , wherein determining the plurality of potential paths through the wireless network comprises: creating an ordered list using a random arrangement of internal nodes; performing a link elimination process using the ordered list to produce a potential path; and responsive to determining that the potential path is unique, storing the potential path in an array.
The wireless mesh network routing optimization method determines potential paths by first creating a randomized order of the intermediate nodes. Then, it runs the link elimination process using this specific node order to create a potential path. If that resulting path is not a duplicate of a previously found path, it is stored. This randomization and uniqueness check helps ensure that a diverse set of potential paths are explored.
8. The method of claim 1 , wherein determining whether the internal node meets connectivity requirements comprises: determining that the internal node includes only two transit links; and determining that the potential path being determined from the originating node to the edge node is at most three hops long.
This invention relates to network routing, specifically ensuring reliable connectivity in a network by evaluating internal nodes based on their transit links and path length. The problem addressed is maintaining robust network paths while minimizing unnecessary complexity or redundancy. The method involves assessing whether an internal node meets connectivity requirements by checking two key conditions. First, it verifies that the internal node has only two transit links, ensuring it is not overburdened with connections. Second, it confirms that the potential path from an originating node to an edge node is at most three hops long, balancing efficiency with reliability. These checks help optimize network performance by avoiding overly complex or fragile paths while ensuring sufficient redundancy. The method is part of a broader approach to network path determination, where nodes and links are evaluated to establish optimal routes. By enforcing these constraints, the invention aims to improve network resilience and efficiency without compromising connectivity.
9. The method of claim 1 , wherein determining the plurality of potential paths through the wireless network comprises: creating an ordered list using a random arrangement of internal nodes; performing a link elimination process using the ordered list to produce a potential path; and responsive to determining that the potential path is unique, storing the potential path in an array.
The wireless mesh network routing optimization method determines potential paths by first creating a randomized order of the intermediate nodes. Then, it runs the link elimination process using this specific node order to create a potential path. If that resulting path is not a duplicate of a previously found path, it is stored. This randomization and uniqueness check helps ensure that a diverse set of potential paths are explored.
10. A configuration manager for a wireless network, the configuration manager comprising: a wireless communication interface configured to communicate with one or more internal nodes of the wireless network, each of the one or more internal nodes having at least one transit link; and a routing topology generator configured to: determine a plurality of potential paths through the wireless network from an originating node to an edge node, each potential path comprising at least one hop, wherein determining each potential path comprises: (a) temporarily eliminating a transit link having a worst radio frequency parameter value for an internal node; (b) determining whether the internal node meets connectivity requirements; (c) responsive to determining that the internal node meets connectivity requirements, permanently eliminating the transit link; and repeating steps (a), (b), and (c) for each internal node until no transit links remain eligible for elimination; calculate a metric for each potential path, the metric for each potential path based on at least one radio frequency parameter measured for each hop in the respective potential path; determine, based on the calculated metric, a preferred path of the plurality of potential paths through the wireless network from the originating node to the edge node; and configure the wireless network to route traffic from the originating node to the edge node using the preferred path, wherein said configuring the wireless network comprises blocking one or more wireless links between nodes in the wireless network.
A configuration manager device optimizes routing in a wireless mesh network by finding the best path from a source node to a destination node using its components: a wireless communication interface and a routing topology generator. The routing topology generator identifies multiple possible paths through intermediate nodes. It iteratively removes the weakest wireless link of each intermediate node based on a radio frequency parameter. After each removal, it checks if the node can still maintain connectivity. If connectivity is maintained, the link is permanently removed. This continues until no more links are eligible for removal. Each potential path is then evaluated using a metric based on radio frequency signal strength. The best path, based on this metric, is selected, and the network is configured via the wireless communication interface to use that path, which may involve blocking other wireless links to enforce the selected route.
11. The configuration manager of claim 10 , wherein the routing topology generator operates to determine the plurality of potential paths by eliminating potential paths having a hop count greater than a predetermined maximum hop count.
The configuration manager for wireless mesh network routing optimization, also limits the number of hops in potential paths. When finding possible routes from the source to destination, any path exceeding a pre-defined maximum number of hops is automatically discarded, in addition to the link elimination and metric calculations performed by the routing topology generator. This prevents excessively long routes from being considered, improving overall network performance and reducing latency.
12. The configuration manager of claim 10 , wherein the metric for each potential path is based on at least one received signal strength indication (RSSI).
In the configuration manager for wireless mesh network routing optimization, the metric used by the routing topology generator to evaluate potential paths is based on the Received Signal Strength Indication (RSSI) for each hop along the path. This means that when calculating the quality of a potential route, the signal strength between each node in the path is considered, with stronger signals generally leading to a better overall path metric. This RSSI value contributes to the overall score that determines the preferred path.
13. The configuration manager of claim 12 , wherein the metric for each potential path is based on a RSSI in a forward direction and a RSSI in a reverse direction for each hop in the respective potential path.
Building upon the RSSI-based path metric, the routing topology generator within the configuration manager considers RSSI in both the forward and reverse directions for each hop. Instead of just evaluating signal strength from one node to the next, it also considers the signal strength in the opposite direction. This provides a more complete picture of the link quality and accounts for potential asymmetry in signal strength between nodes, leading to a more robust path selection.
14. The configuration manager of claim 13 , wherein the routing topology generator operates to normalize the RSSI in the forward direction and the RSSI in the reverse direction to generate a normalized RSSI for each hop of each potential path.
The routing topology generator within the configuration manager refines the RSSI measurements by normalizing the forward and reverse RSSI values for each hop before using them in the path metric calculation. This normalization process aims to reduce the impact of any individual high or low RSSI readings and provide a more consistent measure of link quality, improving the accuracy of the overall path evaluation.
15. The configuration manager of claim 14 , wherein the routing topology generator operates to generate the normalized RSSI for each hop by multiplying the RSSI in the forward direction by the RSSI in the reverse direction for each hop.
The normalization of the forward and reverse RSSI values by the routing topology generator involves multiplying the RSSI values for each direction to generate a single normalized RSSI value for each hop. This single value represents the overall quality of the link, and it is incorporated into the path metric calculation, making the selection of the preferred path more accurate by accounting for the combined signal strength in both directions.
16. The configuration manager of claim 13 , wherein the routing topology manager operates to determine the plurality of potential paths through the wireless network by: creating an ordered list using a random arrangement of internal nodes; performing a link elimination process using the ordered list to produce a potential path; and responsive to determining that the potential path is unique, storing the potential path in an array.
The routing topology generator within the configuration manager determines potential paths by first creating a randomized order of the intermediate nodes. Then, it runs the link elimination process using this specific node order to create a potential path. If that resulting path is not a duplicate of a previously found path, it is stored. This randomization and uniqueness check helps ensure that a diverse set of potential paths are explored.
17. The configuration manager of claim 10 , wherein determining whether the internal node meets connectivity requirements comprises: determining that the internal node includes only two transit links; and determining that the potential path being determined from the originating node to the edge node is at most three hops long.
When determining whether an intermediate node meets connectivity requirements, the configuration manager considers two factors: the node must have at least two remaining wireless links, and the potential path from source to destination should not exceed three hops in length. These two constraints ensures a certain degree of redundancy and prevents paths from becoming too long and inefficient.
18. The configuration manager of claim 10 , wherein the routing topology generator operates to determine the plurality of potential paths through the wireless network by: creating an ordered list using a random arrangement of internal nodes; performing a link elimination process using the ordered list to produce a potential path; and responsive to determining that the potential path is unique, storing the potential path in an array.
The routing topology generator within the configuration manager determines potential paths by first creating a randomized order of the intermediate nodes. Then, it runs the link elimination process using this specific node order to create a potential path. If that resulting path is not a duplicate of a previously found path, it is stored. This randomization and uniqueness check helps ensure that a diverse set of potential paths are explored.
19. A non-transitory, computer accessible memory medium storing program instructions for generating a routing topology for a wireless network, wherein the program instructions are executable by a processor to: determine a plurality of potential paths through the wireless network from an originating node to an edge node, wherein the wireless network comprises one or more internal nodes, each of the one or more internal nodes having at least one transit link, each potential path comprising at least one hop, wherein determining each potential path comprises: (a) temporarily eliminating a transit link having a worst radio frequency parameter value for an internal node; (b) determining whether the internal node meets connectivity requirements; (c) responsive to determining that the internal node meets connectivity requirements, permanently eliminating the transit link; and repeating steps (a), (b), and (c) for each internal node until no transit links remain eligible for elimination; calculate a metric for each potential path, the metric for each potential path based on at least one radio frequency parameter measured for each hop in the respective potential path; determine, based on the calculated metric, a preferred path of the plurality of potential paths through the wireless network from the originating node to the edge node; and configure the wireless network to route traffic from the originating node to the edge node using the preferred path, wherein said configuring the wireless network comprises blocking one or more wireless links between nodes in the wireless network.
A computer-readable memory stores instructions that, when executed, cause a computer to optimize routing in a wireless mesh network by finding the best path from a source node to a destination node. It identifies multiple possible paths through the network, which includes intermediate nodes. To find these paths, the system iteratively removes the weakest wireless link of each intermediate node based on a radio frequency parameter. After each removal, it checks if the node can still maintain connectivity. If connectivity is maintained, the link is permanently removed. This continues until no more links are eligible for removal. Each potential path is then evaluated using a metric based on radio frequency signal strength. The best path, based on this metric, is selected, and the network is configured to use that path, which may involve blocking other wireless links to enforce the selected route.
Unknown
November 11, 2014
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.