Research On Multi-constrained Resource Reorganization Methods Of Local Facility Failure Network

The degree of informationization of modern warfare is gradually increasing,and Information interaction between combat units is becoming more frequent.More and more technologies are being carried out to accurately strike nodes and links in enemy communication networks.When the local facilities in the tactical communication network are destroyed,it will inevitably lead to the reduction o f network connectivity,and even form a number of disconnected network silos,which will seriously affect the data transmission and command communication in the information warfare.Therefore,it has become an increasingly urgent task to research the reliability optimization of tactical communication network and the repair methods after local facilities damage.In order to solve the above problems,this thesis has carried on the research from the following aspects.The first aspect is optimization before the network damaged.In order to prevent the danger in the future,when the network topo logy is constructed,the anti-destruction of the network should be fully considered.In this thesis,a disjoint path algorithm is used to construct a physical network topolog y that satisfies reliability constraints,and a virtual backbone network is constru cted on the basis of physical topology to further ensure the reliability of important data transmission in the network.In the construction methods of virtual backbone network,a centralized algorithm based on growth tree technique is adopted,and compared with the distributed algorithm proposed by the research group.It effectively improves the construction efficiency and reduces the scale of the virtual backbone network.The next aspect is the repair after the network damaged.When the network topology is partially damaged,it will cause the connectivity of the entire network to decrease.At this time,we use the topology repair algorithm based on enhanced node-protecting cycles to repair the network connectivity without using the new microwave stations and relay stations.When the network is severely damaged,it would formed a number of disconnected network silos.At this time we proposed the backup microwave stations heuristic placing station algorithm based on the rough degree.After testing,the algorithm can realize the function of repairing the network,and has certain advantages compared with the traditional algorithm to improve the convergence speed and reduce the amount of backup microwave stations usage.Finally,a distributed multipath routing algorithm based on Lyapunov stabilit y theory is proposed.Through Lyapunov stability theory,the queue backlog of nodes is modeled,Lyapunov function is constructed,and the upper limit of Lyapunov drift is obtained,and the problem is turned into the optimization problem of minizing the upper limit of Lyapunov drift.After testing,the algorithm can dredge the traffic and stabilize the network more quickly by comparing the Dijkstra algorithm.