Patent ID: 9119179
Filing Date: 2015-08-25
Classification: H04B,H04W

Abstract:
1. A method of dynamically planning a network comprising: determining one or more desired network parameters for connecting nodes to a network; determining one or more decision variables regarding one or more of the group of: (a) radios in the network and (b) nodes in the network; determining constraints to narrow possible values of one or more of the group of: (a) the network parameters and (b) the decision variables based on one or more of the group of: (a) values associated with connecting a radio to a node in the network, (b) values associated with connecting two nodes in the network together over a communication link, (c) whether a node can connect to a global information grid (GIG) node and (d) a flow balance in the GIG node; for each possible communication link in the network, minimizing an equation based on the network parameters, constraints and decision variables to determine a plurality of optimal communication links between one or more of the group of: (a) pairs of nodes in the network, (b) pairs of nodes and radios and (c) pairs of radios; and establishing at least one of the optimal communication links in the network; wherein the determining one or more desired network parameters further comprises: determining a cost of creating links between at least one pair of a plurality of nodes on the network, wherein a pair of nodes is represented by m and n, wherein c(m, n, t) represents the cost of a link between each pair of nodes, and wherein t is time; determining a penalty of disconnecting at least one of the plurality of nodes m from the GIG as expressed by C(m, t); and determining for a plurality of radios in the network if at least one radio can connect to another radio, wherein i and j represent a pair of radios in the network, and wherein whether i and j can be connected is expressed by q(m, i, n, j, t).