Efficient routing method for orthogonal circular orbit configuration satellite constellation

Abstract

The invention discloses an efficient routing method for an orthogonal circular orbit configuration satellite constellation. According to the invention, the method comprises the steps: proposing a principle of proximity, a principle of approach and an equatorial orbit satellite active periodic updating mechanism according to a constellation link model to ensure the rationality and the cheapness ofa network link; proposing a link priority algorithm based on hop count prediction on the basis of the link model; enabling a satellite to send out a data packet according to the priority of each linkthrough sequential decisions of a link actual on-off state, a link pseudo-off state caused by a non-backhaul strategy, a destination node direction, a link congestion degree and a link propagation delay factor; carrying out discussion in four situations according to the categories of the source satellite node and the destination satellite node, and providing a hop count prediction method for sending data packets from different links for each situation according to satellite numbers and state information.

Description

technical field [0001] The invention belongs to the field of satellite networking, in particular to an efficient routing method for satellite constellations with orthogonal circular orbit configurations. Background technique [0002] With the wide application of Internet technology and the rapid development of the aerospace industry, the use of satellite networks to carry out Internet services has become a hot issue, and inter-satellite routing technology is the key. According to the implementation mechanism, these routing methods can be divided into three categories: routing algorithms based on virtual topology, routing algorithms based on virtual nodes, and dynamic topology update routing algorithms. [0003] The basic idea of ​​the routing algorithm based on virtual topology is to divide the constellation period into several small time segments according to the periodicity of satellite operation. Highly dynamic topological properties of satellites. Generally, the routin...

AI Technical Summary

Problems solved by technology

However, the existing satellite dynamic topology update algorithms are generally modified and adapted on the basis of ground routing algorithms. The exchange of network information between satellite nodes is too frequent, and the utilization of constellation topology is too little, and the communication satellites are not fully utilized. The advantage of the strong regularity of the constellation

Another problem with the existing algorithms is that the designed routing algorithms are generally complex and are not applicable in satellite systems with scarce resources.

Images