Communication network topology determination
First Claim
Patent Images
1. A computer implemented method comprising:
- determining, using at least one data processor, a topology of a communication network by evaluating costs of states each representing a possible assignment of hubs and remote nodes to nodes of the communication network, the hubs connecting to a central network, the remote nodes connecting wirelessly to the hubs and obtaining connectivity to the central network through the hubs; and
using an iterative process to evaluate the states, and at each iteration evaluate states each representing a network topology having more hubs than those represented by states evaluated at a previous iteration;
wherein the cost of each state is determined based on costs for configuring each node as a hub or a remote node, uplink frequencies for sending data from the remote nodes to corresponding hubs, and downlink frequencies for sending data from the hubs to corresponding remote nodes, andwherein when the costs of each state evaluated at an iteration are higher than the lowest cost of states evaluated at a previous iteration, the assignment of hubs and remote nodes represented by the state having the lowest cost in the previous iteration is selected as the final topology for the communication network.
2 Assignments
0 Petitions
Accused Products
Abstract
A communication network topology is determined by evaluating costs of states each representing a possible assignment of hubs and remote nodes to nodes of the communication network. The hubs connect to a central network, the remote nodes connect wirelessly to the hubs and obtain connectivity to the central network through the hubs. The cost of each state is determined based on costs for configuring each node as a hub or a remote node, uplink frequencies for sending data from the remote nodes to corresponding hubs, and downlink frequencies for sending data from the hubs to corresponding remote nodes.
-
Citations
41 Claims
-
1. A computer implemented method comprising:
-
determining, using at least one data processor, a topology of a communication network by evaluating costs of states each representing a possible assignment of hubs and remote nodes to nodes of the communication network, the hubs connecting to a central network, the remote nodes connecting wirelessly to the hubs and obtaining connectivity to the central network through the hubs; and using an iterative process to evaluate the states, and at each iteration evaluate states each representing a network topology having more hubs than those represented by states evaluated at a previous iteration; wherein the cost of each state is determined based on costs for configuring each node as a hub or a remote node, uplink frequencies for sending data from the remote nodes to corresponding hubs, and downlink frequencies for sending data from the hubs to corresponding remote nodes, and wherein when the costs of each state evaluated at an iteration are higher than the lowest cost of states evaluated at a previous iteration, the assignment of hubs and remote nodes represented by the state having the lowest cost in the previous iteration is selected as the final topology for the communication network. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A computer implemented method comprising:
-
determining, using at least one data processor, a topology of a communication network by evaluating costs of states each representing a possible assignment of hubs and remote nodes to nodes of the communication network, the hubs connecting to a central network, the remote nodes connecting wirelessly to the hubs and obtaining connectivity to the central network through the hubs; using an iterative process to evaluate the states, and at each iteration evaluate states each representing a network topology having more hubs than those represented by states evaluated at a previous iteration; and at each iteration evaluating a first subset of states and selecting one of the first subset of states having a lowest cost, and at the next iteration evaluating a second subset of states each derived by taking the lowest-cost state in the first subset and changing one or more of the remote nodes to hubs; wherein the cost of each state is determined based on costs for configuring each node as a hub or a remote node, uplink frequencies for sending data from the remote nodes to corresponding hubs, and downlink frequencies for sending data from the hubs to corresponding remote nodes. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23)
-
-
12. A computer implemented method comprising:
-
determining, using at least one data processor, a topology of a communication network by evaluating costs of states each representing a possible assignment of hubs and remote nodes to nodes of the communication network, the hubs connecting to a central network, the remote nodes connecting wirelessly to the hubs and obtaining connectivity to the central network through the hubs; using an iterative process to evaluate the states, and at each iteration evaluate states each representing a network topology having less hubs than those represented by states evaluated at a previous iteration; and at each iteration evaluating a first subset of states and selecting one of the first subset of states having a lowest cost, and at the next iteration evaluating a second subset of states each derived by taking the lowest-cost state in the first subset and changing one or more of the hubs to remote nodes; wherein the cost of each state is determined based on costs for configuring each node as a hub or a remote node, uplink frequencies for sending data from the remote nodes to corresponding hubs, and downlink frequencies for sending data from the hubs to corresponding remote nodes. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31, 32)
-
-
13. A computer implemented method comprising:
-
determining, using at least one data processor, a topology of a communication network by evaluating costs of states each representing a possible assignment of hubs and remote nodes to nodes of the communication network, the hubs connecting to a central network, the remote nodes connecting wirelessly to the hubs and obtaining connectivity to the central network through the hubs; and using a simulated annealing process to determine a sequence of states to evaluate, including at each step of the process, evaluating one or more neighbor states of a current state and probabilistically determining whether to maintain the current state or evaluate one of the neighbor states, in order to progress generally towards states of lower costs; wherein the cost of each state is determined based on costs for configuring each node as a hub or a remote node, uplink frequencies for sending data from the remote nodes to corresponding hubs, and downlink frequencies for sending data from the hubs to corresponding remote nodes. - View Dependent Claims (14, 33, 34, 35, 36, 37, 38, 39, 40, 41)
-
Specification