Apparatuses, methods, and systems for closing open loops of a wireless mesh network are disclosed. One method includes determining a representation of a wireless mesh network including nodes, and wireless links between the nodes, identifying end-site nodes of the wireless mesh network, determining open loops of the wireless mesh network that include the identified end-site nodes, generating a list of potential nodes for closing each of the open loops with the identified end-site node, testing one or more of the potential nodes, comprising testing performance of a wireless connection between each end-site node and the one or more potential nodes, wherein the performance includes a number of wireless hops around each closed loop formed including the end-site node and each potential node, selecting a closing node based on the testing, and providing a wireless link connection between one or more of the end-site nodes and the closing node.
|
1. A method, comprising:
determining a representation of a wireless mesh network including nodes, and wireless links between the nodes;
identifying end-site nodes of the wireless mesh network, wherein the end-site nodes have only a single wireless link to the wireless mesh network;
determining open loops of the wireless mesh network that include the identified end-site nodes;
generating a list of potential nodes for closing of the open loops with the identified end-site nodes;
testing one or more of the potential nodes, comprising testing performance of a wireless connection between the end-site nodes and the one or more potential nodes, wherein the performance includes a number of wireless hops around the closing of the open loops formed including the end-site nodes and the one or more potential nodes;
selecting a closing node based on the testing; and
providing a wireless link connection between one or more of the end-site nodes and the closing node.
14. A system, comprising:
a plurality of wireless nodes, wherein wireless links between the plurality of wireless nodes form a wireless mesh network;
a network server, the network server operating to:
determine a representation of the wireless mesh network including nodes, and wireless links between the nodes;
identify end-site nodes of the wireless mesh network, wherein the end-site nodes have only a single wireless link to the wireless mesh network;
determine open loops of the wireless mesh network that include the identified end-site nodes;
generate a list of potential nodes for closing of the open loops with the identified end-site nodes;
test one or more of the potential nodes, comprising testing performance of a wireless connection between the end-site nodes and the one or more potential nodes, wherein the performance includes a number of wireless hops around the closing of the open loops formed including the end-site nodes and the potential nodes;
select a closing node based on the test; and
provide a wireless link connection between one or more of the end-site nodes and the closing node.
2. The method of
3. The method of
4. The method of
5. The method of
6. The method of
7. The method of
8. The method of
9. The method of
10. The method of
11. The method of
12. The method of
13. The method of
15. The system of
16. The system of
17. The system of
18. The system of
19. The system of
20. The system of
|
The described embodiments relate generally to wireless communications. More particularly, the described embodiments relate to systems, methods, and apparatuses for closing open loops of wireless mesh network.
Planning of wireless network is a critical phase that occurs prior to deployment, especially for wireless backhaul networks. A key requirement of the network planning includes high redundancy or network availability of the backhaul network. A typical network planning results in a network that includes end sites that need to be manually closed to improve redundancy. This requires manual intervention and thereby slows down the network design process.
It is desirable to have methods, apparatuses, and systems for closing open loops of wireless mesh networks.
An embodiment includes a method of closing open loops of a wireless mesh network. The method includes determining a representation of a wireless mesh network including nodes, and wireless links between the nodes, identifying end-site nodes of the wireless mesh network, wherein end-site nodes have only a single wireless link to the wireless mesh network, determining open loops of the wireless mesh network that include the identified end-site nodes, generating a list of potential nodes for closing each of the open loops with the identified end-site node, testing one or more of the potential nodes, comprising testing performance of a wireless connection between each end-site node and the one or more potential nodes, wherein the performance includes a number of wireless hops around each closed loop formed including the end-site node and each potential node, selecting a closing node based on the testing, and providing a wireless link connection between one or more of the end-site nodes and the closing node.
Another embodiment includes a system for closing open loops of a wireless mesh network. The system includes a plurality of wireless nodes, wherein wireless links between the plurality of nodes form a wireless mesh network, and a network server. The network server operates to determine a representation of the wireless mesh network including nodes, and wireless links between the nodes, identify end-site nodes of the wireless mesh network, wherein end-site nodes have only a single wireless link to the wireless mesh network, determine open loops of the wireless mesh network that include the identified end-site nodes, generate a list of potential nodes for closing each of the open loops with the identified end-site node, test one or more of the potential nodes, comprising testing performance of a wireless connection between each end-site node and the one or more potential nodes, wherein the performance includes a number of wireless hops around each closed loop formed including the end-site node and each potential node, select a closing node based on the testing, and provide a wireless link connection between one or more of the end-site nodes and the closing node.
Other aspects and advantages of the described embodiments will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, illustrating by way of example the principles of the described embodiments.
The embodiments described include methods, apparatuses, and systems for closing open loops of wireless mesh networks. Open loops are identified by end-site nodes, wherein an end-site node resides at both ends of the open loop. End-site nodes are identified as having only a single wireless link to one other node of the wireless mesh network. To increase the robustness, it is desirable to wirelessly connect both ends of the open loop by adding one additional link to “close” the loop so that each node in the loop has at least two paths (wireless links) to the other nodes. For an embodiment, it may be determined that it is more beneficial to add a wireless link to an end-site node that is between the end-site node and a non-end-site node.
An important feature of a wireless mesh network is redundancy. That is, if a node or a wireless link of the wireless mesh network should fail, it is desirable to have a backup or secondary upstream path available to allow a node to maintain connection to the upstream network. Generally, upstream data is data that flows towards the upstream network, and downstream data is data that flows away from the upstream network.
The portion of the wireless mesh network 100 includes two end-site nodes (Node A, Node F). End-site nodes are nodes that only include a single wireless link to another node of the wireless mesh node. The end-site nodes are more susceptible to failure because the end-site node only has a single wireless link to the wireless mesh network. The failure may be due to the failure of an upstream link or an upstream node. Without a backup wireless link to another node of the wireless mesh network, the end-site node may lose connection to the wireless mesh network.
Redundancy of the portion of the wireless mesh network 100 can be improved by eliminating or reducing the number of end-site nodes. One method of doing this is to identify open loops and then close the open loops with the addition of a wireless link between end-site nodes of the open loops. An open loop can be identified as a path of nodes in which the end nodes of the path of the open loop are end-site nodes.
Again, end-site nodes can be identified as nodes that only have a single wireless link connecting them to other nodes of the wireless mesh network. The wireless mesh network of
For an embodiment, an open loop is only selected if the number of nodes within the open loop is less than a selected threshold. Otherwise, other means for providing wireless link redundancy is utilized. Further, as previously stated, an open loop is only selected if the end-site nodes of the open loop have a direct line-of-sight (LOS) with each other.
Identifying closing links for the open loops formed by nodes Node C, Node D, and by nodes Node D, Node E are more difficult. These open loops further include wireless link blocking due to features, such as, buildings. The building may make the creation of a link between certain nodes impossible or very difficult (poor wireless link quality). As previously stated, for an embodiment, open loops are only closed by a wireless link that includes a direct LOS wireless connection between the end-site nodes of the open loop.
If the closing of an open loop by wirelessly connecting the end-site nodes of the open loop is not possible, the end-site nodes can be selectively connected to non-end-site nodes. For example, end-site node Node C can be wirelessly connected to non-end-site node 207 if a wireless connection to node Node D is not possible or results in a poor quality (link quality threshold lower than a selected threshold).
When the closing of an open loop requires greater than a selected number of nodes (and wireless hops between the end-site nodes), then an embodiment includes using other considerations or factors for wirelessly connecting at least one of the end-site nodes with a non-end-site node. Further, when the closing of an open loop requires selecting a closing link that causes more harm through increased interference or decreased throughput, then an embodiment includes using other consideration for wirelessly connecting at least one of the end-site nodes with a non-end-site node.
For an embodiment, a weighting process is used for selecting a closing node for providing a redundant (second) wireless link to an end-site node. The weighting process can include selecting the closing node as the other end-site node of the open loop that includes the end-site node when the number of wireless hops (wireless links) of the open loop is less than a threshold number. This is a desirable selection because redundancy is provided to two separate end-site nodes at the same time with the additional of only one wireless link to the wireless mesh network. If the identified open loop includes more than the threshold number of wireless hops, then secondary considerations, such as, wireless link qualities, throughput (between the end-site node and the closing node, or throughput through all intervening nodes to a wire connections node), or interference (that is, interference suffered by other nodes of the wireless mesh network due to the addition of the wireless link between the end-site node and the closing node). Other secondary consideration include the number of existing direct wireless links of the closing node, or an angle of a wireless connection of the closing wireless link relative to an existing active wireless link.
For an embodiment, the wireless mesh network is a planned network. For an embodiment, the wireless mesh network is a deployed network.
For an embodiment, the generated list of potential nodes includes identified end-site nodes and non-end-site nodes. For an embodiment, selecting the closing node based on the testing include preferentially weighting identified end-site nodes as the closing node over non-end-site nodes as the closing node. For an embodiment, a non-end-site node is selected as the closing node when the number of wireless hops around each of the closed loops formed including each of the end-site nodes is greater than a preselected number.
For an embodiment, the testing of the one or more potential nodes further includes determining a link quality of a wireless link between each end-site node and the one or more potential nodes. For an embodiment, the link quality is determined by a resulting signal strength between each end-site node and the one or more potential nodes. For an embodiment, the link quality is determined by a packet error rate or a bit error rate of wireless communication through the wireless link.
For an embodiment, the link quality is determined by a resulting throughput between each end-site node and the one or more potential nodes. For an embodiment, the link quality is determined by a resulting throughput between each end-site node and an upstream POP (point of presence) resulting from a wireless link between the end-site node and each of the one or more potential nodes, wherein the POP includes a wired connection to an upstream network.
For an embodiment, the link quality is determined by a resulting interference with other wireless links of the mesh network caused by the wireless link between each end-site node and the one or more potential nodes.
For an embodiment, the link quality is determined by a number or existing active links between neighboring nodes of the one or more potential nodes. That is, as shown in
For an embodiment, the link quality is determined by an angle between the wireless link between each end-site node and the one or more potential nodes, and existing active wireless links of the one or more potential nodes. For an embodiment, as shown in
For an embodiment, providing the wireless link connection between one or more of the end-site nodes and the closing node includes scheduling wireless communication between the one or more end-site nodes and the closing node, wherein each of the one or more end-site nodes and the closing node receive the schedule. That is, the schedule provides each node with timing of when communication between the nodes is to be completed.
For an embodiment, providing the wireless link connection between one or more of the end-site nodes and the closing node comprising scheduling beamforming directions of multiple antennas of the one or more end-site nodes or the closing node to be directed to the other of the one or more end-site nodes and the closing node.
A third step 630 include getting a potential node (also referred to a closing node) the detected open loops for from a potential node list (which includes, for example, proximate non-end-site node having a possible wireless link with the end-site node of better than a quality threshold).
A fourth step 640 includes restriction checking. This can include determining whether adding a wireless link to close an open loop cannot be completed due to the wireless link being below a desired quality threshold or some other closing loop restriction. For an embodiment, adding a wireless link between the end-site node and a potential node to close an open loop is restricted because the potential node may already have a number of direct wireless links to more than a threshold number of adjacent or neighboring nodes.
A fifth step 650 includes adding a new link between end-site nodes of the open loop, or between the end-site node and a non-end-site node. The previously described criteria can be used for determining whether to add the new wireless link to close an open loop or not. As described, it is preferable to close the open loop.
The process is then repeated until all the end-site nodes have been provided with an alternate or secondary wireless link for connecting to the wireless mesh network.
As previously described, for an embodiment, adding a wireless link includes scheduling wireless communication between the nodes the link is being added. With the schedule, each node can support the wireless link. Further, for an embodiment, wireless beams are formed through beamforming patterns that are selected over time based upon schedule wireless communication enabling the establishment of the wireless links.
For an embodiment, the utilization of the multiple links (the existing link and the added new link) include time multiplexing wireless communication between the wireless links. Further, the use may be demand-based. Further, the use of the links may be time multiplexed in coordination with other nodes to optimize throughput through the entire network, and to reduce interference within the wireless mesh network.
However, if the number of wireless hops of the open loop is greater than the first threshold, then other factors may be used in selecting the closing node. A fourth step 740 include determining whether the number of wireless hops of the open loop is greater than the first threshold but less than a second threshold. If less than the second threshold, a fifth step 750 includes selecting the other end-site node or a non-end site node based on the link quality between the other end-site node or a non-end site node. For an embodiment, the link quality is determined based on one or more of a signal power between the end-site node and the other node, a signal to noise parameter between the end-site node and the other node, a throughput between the end-site node and the other node, a throughput between the end-site node and an upstream (multiple wireless hops) throughput between the end-site node and a wire connection node (such as, a POP), or an level of interference caused by the addition of a link between the end-site node and the other node. Based on any combination of the stated candidate selection parameters, a candidate node is selected, and a new link added between the end-site node and the candidate node.
If the number of wireless hops of the open loop is greater than the second threshold, then the other end-site node is not selected as the candidate node, and other non-end-site node are evaluated to determine the proper candidate node for adding the new wireless link.
Although specific embodiments have been described and illustrated, the embodiments are not to be limited to the specific forms or arrangements of parts so described and illustrated. The described embodiments are to only be limited by the claims.
Gomadam, Krishna Srikanth, Huang, Po Han, Bondalapati, Pratheep
Patent | Priority | Assignee | Title |
Patent | Priority | Assignee | Title |
10542330, | May 31 2017 | NetScout Systems, Inc. | Automatic adaptive network planning |
11178662, | Nov 07 2017 | SAMSUNG ELECTRONICS CO , LTD | Network topology initialization protocol for wireless mesh network |
7283478, | Nov 28 2001 | ORCKIT IP, LLC | Traffic engineering in bi-directional ring networks |
9826414, | Oct 12 2015 | T-Mobile USA, Inc | Cellular backhaul coverage algorithms |
9847478, | Mar 09 2012 | Taiwan Semiconductor Manufacturing Company, Ltd | Methods and apparatus for resistive random access memory (RRAM) |
20080250124, | |||
20090175238, | |||
20130223275, | |||
20180302807, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Jun 16 2021 | Meta Platforms, Inc. | (assignment on the face of the patent) | / | |||
Jun 16 2021 | HUANG, PO HAN | Facebook, Inc | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 056698 | /0576 | |
Jun 16 2021 | BONDALAPATI, PRATHEEP | Facebook, Inc | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 056698 | /0576 | |
Jun 20 2021 | GOMADAM, KRISHNA SRIKANTH | Facebook, Inc | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 056698 | /0576 | |
Oct 28 2021 | Facebook, Inc | Meta Platforms, Inc | CHANGE OF NAME SEE DOCUMENT FOR DETAILS | 058495 | /0763 |
Date | Maintenance Fee Events |
Jun 16 2021 | BIG: Entity status set to Undiscounted (note the period is included in the code). |
Date | Maintenance Schedule |
Jan 03 2026 | 4 years fee payment window open |
Jul 03 2026 | 6 months grace period start (w surcharge) |
Jan 03 2027 | patent expiry (for year 4) |
Jan 03 2029 | 2 years to revive unintentionally abandoned end. (for year 4) |
Jan 03 2030 | 8 years fee payment window open |
Jul 03 2030 | 6 months grace period start (w surcharge) |
Jan 03 2031 | patent expiry (for year 8) |
Jan 03 2033 | 2 years to revive unintentionally abandoned end. (for year 8) |
Jan 03 2034 | 12 years fee payment window open |
Jul 03 2034 | 6 months grace period start (w surcharge) |
Jan 03 2035 | patent expiry (for year 12) |
Jan 03 2037 | 2 years to revive unintentionally abandoned end. (for year 12) |