Association in line-of-sight communication networks
First Claim
Patent Images
1. A computer-implemented method in a first node for establishing a connection with a backbone in a network, comprising:
- determining initial values for a ranking of the first node, the ranking of the first node comprising;
a first ranking part reflecting a communication distance to a node having connectivity with the backbone; and
a second ranking part reflecting a communication distance to one or more nodes in a first subnetwork of the network, wherein the first subnetwork includes the first node and the one or more nodes;
receiving ranking information from a peer node, the ranking information including a ranking for the peer node, the ranking for the peer node relating to connectivity of the peer node with the backbone for preventing isolation of the first node from the network, the ranking for the peer node including;
a first ranking part reflecting a communication distance to a node having connectivity with the backbone; and
a second ranking part reflecting a communication distance to one or more nodes in a second subnetwork of the network, wherein the second subnetwork includes the peer node and the one or more nodes;
attempting by the first node to establish communication with the peer node, based on the ranking information, via Line-of-Sight (LOS) communication;
establishing, by the first node, communications with the peer node;
updating a first value in the first node'"'"'s first ranking part, the first value being the same value as the peer node'"'"'s first ranking part; and
updating a second value in the first node'"'"'s second ranking part, the second value generated from an arithmetic operation applied to the peer node'"'"'s second ranking part.
2 Assignments
0 Petitions
Accused Products
Abstract
Various of the disclosed embodiments relate to line-of-sight (LOS), e.g., optical, based networks. Systems and methods are provided for connecting nodes based on their topological position in a line-of-sight communication network. Some embodiments may represent each node by a “backbone” and a “subnetwork” rank. The determination of a node'"'"'s rank can prevent the formation of isolated “islands” of nodes, cut off from the backbone. The ranking can also provide a total ordering of nodes relative to the “fiberpop” node which can be used for healing and routing behaviors.
51 Citations
32 Claims
-
1. A computer-implemented method in a first node for establishing a connection with a backbone in a network, comprising:
-
determining initial values for a ranking of the first node, the ranking of the first node comprising; a first ranking part reflecting a communication distance to a node having connectivity with the backbone; and a second ranking part reflecting a communication distance to one or more nodes in a first subnetwork of the network, wherein the first subnetwork includes the first node and the one or more nodes; receiving ranking information from a peer node, the ranking information including a ranking for the peer node, the ranking for the peer node relating to connectivity of the peer node with the backbone for preventing isolation of the first node from the network, the ranking for the peer node including; a first ranking part reflecting a communication distance to a node having connectivity with the backbone; and a second ranking part reflecting a communication distance to one or more nodes in a second subnetwork of the network, wherein the second subnetwork includes the peer node and the one or more nodes; attempting by the first node to establish communication with the peer node, based on the ranking information, via Line-of-Sight (LOS) communication; establishing, by the first node, communications with the peer node; updating a first value in the first node'"'"'s first ranking part, the first value being the same value as the peer node'"'"'s first ranking part; and updating a second value in the first node'"'"'s second ranking part, the second value generated from an arithmetic operation applied to the peer node'"'"'s second ranking part. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A non-transitory computer-readable storage medium storing instructions configured to cause a computer system to perform a method comprising:
-
determining initial values for a ranking of a first node, the ranking of the first node comprising; a first ranking part reflecting a communication distance to a node having connectivity with a backbone in a network; and a second ranking part reflecting a communication distance to one or more nodes in a first subnetwork of the network, wherein the first subnetwork includes the first node and the one or more nodes; receiving ranking information from a peer node, the ranking information including a ranking for the peer node, the ranking for the peer node relating to connectivity of the peer node with the backbone for preventing isolation of the first node from the network, the ranking for the peer node including; a first ranking part reflecting a communication distance to a node having connectivity with the backbone; a second ranking part reflecting a communication distance to one or more nodes in a second subnetwork of the network, wherein the second subnetwork includes the peer node and the one or more nodes; attempting by the first node to establish communication with the peer node, based on the ranking information, via Line-of-Sight (LOS) communication; establishing, by the first node, communications with the peer node; updating a first value in the first node'"'"'s first ranking part, the first value the same value as the peer node'"'"'s first ranking part; and updating a second value in the first node'"'"'s second ranking part, the second value generated from an arithmetic operation applied to the peer node'"'"'s second ranking part. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer system comprising:
-
at least one processor; at least one memory comprising instructions configured to cause the at least one processor to perform a method comprising; determining initial values for a ranking of a first node, the ranking of the first node comprising; a first ranking part reflecting a communication distance to a node having connectivity with a backbone in a network; and a second ranking part reflecting a communication distance to one or more nodes in a first subnetwork of the network, wherein the first subnetwork includes the first node and the one or more nodes; receiving ranking information from a peer node, the ranking information including a ranking for the peer node, the ranking for the peer node relating to connectivity of the peer node with the backbone for preventing isolation of the first node from the network, the ranking for the peer node including; a first ranking part reflecting a communication distance to a node having connectivity with the backbone; and a second ranking part reflecting a relationship to one or more nodes in a second subnetwork of the network, wherein the second subnetwork includes the peer node and the one or more nodes; attempting by the first node to establish communication with the peer node, based on the ranking information, via Line-of-Sight (LOS) communication, establishing, by the first node, communications with the peer node; updating a first value in the first node'"'"'s first ranking part, the first value the same value as the peer node'"'"'s first ranking part; and updating a second value in the first node'"'"'s second ranking part, the second value generated from an arithmetic operation applied to the peer node'"'"'s second ranking part. - View Dependent Claims (18, 19, 20, 21, 22, 23)
-
-
24. A computer-implemented method of maintaining connectivity in a communication network including a plurality of geographically distributed nodes, the method comprising:
-
selecting a random value as a self-assigned rank at a non-backbone node, the non-backbone node included in the plurality of geographically distributed nodes, wherein the non-backbone node lacks a backbone network connection, wherein each node in the plurality of geographically distributed nodes is aware of a geographic location of each node, wherein each node in the plurality of geographically distributed nodes maintains a respective lookup table; and iteratively performing, at the non-backbone node, the operations of; receiving a list specifying ranks of nodes that are neighbors of the non-backbone node; updating a lookup table associated with the non-backbone node based upon information in the list, the updating comprising; searching the list for (i) a first node associated with a lower rank than the self-assigned rank of the non-backbone node and (ii) a second node associated with a higher rank than the self-assigned rank of the non-backbone node, wherein the first node and the second node are included in the plurality of geographically distributed nodes, attempting to communicate routing information associated with the non-backbone node to the first node and the second node, wherein the routing information includes the geographic location of the non-backbone node, wherein the routing information includes a ranking of peer nodes of the non-backbone node, the ranking of peer nodes relating to connectivity of the non-backbone node with a backbone node that is connected to the backbone network for preventing isolation of the non-backbone node from the network, and upon establishment of successful communication between the non-backbone node and the first node, adjusting, by the non-backbone node, the self-assigned rank of the non-backbone node. - View Dependent Claims (25, 26, 27, 28, 29, 30, 31, 32)
-
Specification