Construction and maintenance of satellite-to-ground and inter-satellite laser communication network based on ants colony algorithm

摘要

#$%^&*AU2020102041A420201008.pdf#####Abstract This invention provides a model building and ant colony solving algorithm for satellite-to-ground laser communication network link establishment and maintenance. This invention includes: propose mission, modeling based on the construction and maintenance of satellite-to-ground laser communication links and construct optimized ants colony algorithm model. The novel ants colony algorithm model is applied to the dynamic and large space-time scale characteristics of satellite-ground laser communication network in order to meet the requirements of satellite-ground and inter-satellite node visibility, link length, transmission system, link establishment and maintenance. After the algorithm simulation, we can find that the simulation results are good enough. From the results of the simulation, this invention innovatively introduces optimized ants colony algorithm into mission planning of satellite and ground data in order to improve the efficiency of link construction and maintenance of space laser communication satellite, which improves the applicability of link construction and maintenance of satellite laser communication and provides reference for other relevant researches in the future. 1Analysis of construction and maintenance of satellite-to-ground and inter-satellite laser communication Problem assumptions and simplification Modeling based on the construction and maintenance of satellite-to-ground and inter-satellite laser communication links Deduce ants algorithm model Initialize tasks Initialize satellite-to-ground and intersatellite resources' nodes Transfer or search Figure 1 1Obtain the topology of the satellite network under the current time slice of the satellite Initialize the parameters Set the source node as the current node of the ant. Add it into the tabu table. The number of cycles N=N+1 Select the next node. Add it into the tabu table. NN Current node is the Fi destination node? N Set(allowed) uof the current 2node is empty? 1 i Y Sort the found paths according Fai to the goodness. Update pheromone. 4NNmax? Y Output the optimal solution Figure 2 2