Wireless mesh network transit link topology optimization method and system
First Claim
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.
2 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.
25 Citations
19 Claims
-
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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
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. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
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.
-
Specification