Continuous state routing algorithm of satellite link network

Abstract

The invention discloses a continuous state routing algorithm of a satellite link network, which comprises the following steps: (1) registering the time of switching between a link connected state and a link unconnected state within the entire simulation time, and establishing a link state switching table; (2) searching and recording paths within the entire simulation time; (3) filtering the pathsand storing the optimal one; and (4) performing full-path integration by using the Dijkstra shortest path algorithm. The routing algorithm disclosed by the invention is different from the traditionalsatellite link network routing algorithm in that: the routing algorithm continuously records and uses the time-varying dynamic topology of the satellite link network within the entire simulation timewithout simplifying the topology into discrete static topology by dividing time intervals. The routing algorithm stores the most complete network dynamic information, thus the best routing design result can be provided; and moreover, the numerical form is simple, the paths are filtered in the path registration process, thus the workload of full-path integration is reduced.

Description

technical field

[0001] The invention relates to a satellite link network routing algorithm and belongs to the technical field of satellite constellation communication routing. Background technique

[0002] Routing algorithm is a method for planning paths in the network according to certain indicators. Routing design is the process of using routing algorithms to obtain the optimal path in the network, also known as routing optimization. The satellite constellation forms a link network after realizing the inter-satellite link. This network is different from the general ground transportation network and computer network in that its topological structure is time-varying and dynamic, which is manifested in the link between satellites and the link between satellites and ground terminals. Limited link lifetime means that the link has a finite duration of connectivity, and thus the link switches between connected and non-connected states. The time-varying characteristic of the sat...

Examples

Embodiment

[0063] Embodiment: Take a small LEO rose constellation as an example. The configuration parameter of the constellation is 42°:32 / 4 / 1, the orbit height is 7728 kilometers; the minimum communication angle is 10°, and each star has two intra-orbit inter-satellite links and two inter-orbit inter-satellite links, There are no mandatory closures. The simulation time is 2 hours long. The geographic locations of the two ground terminals of the line are A (0°E, 20°N) and B (120°E, 50°N). The number of handovers is used as the routing optimization index.

[0064] Step 1: Establish a link state switching table. Compute the connected interval of the link in 2 hours of simulation time.

[0065] ...

[0066] L A，28 =Link A，28 {S A , S 28 ,0.0,'1',174.235,'-1',6480.908,'1',7127.136,'-1'}

[0067] ...

[0068] L B，10 =Link B，10 {S B , S 10 ,0.0,'1',385.135,'-1',6572.708,'1',7200.0,'-1'}

[0069] ...

[0070] L 3，10 =Link 3，10 {S 3 , S 10 ,0,'1',3600,'-1'}

[0071] ...

...

technical field

[0001] The invention relates to a satellite link network routing algorithm and belongs to the technical field of satellite constellation communication routing. Background technique

[0002] Routing algorithm is a method for planning paths in the network according to certain indicators. Routing design is the process of using routing algorithms to obtain the optimal path in the network, also known as routing optimization. The satellite constellation forms a link network after realizing the inter-satellite link. This network is different from the general ground transportation network and computer network in that its topological structure is time-varying and dynamic, which is manifested in the link between satellites and the link between satellites and ground terminals. Limited link lifetime means that the link has a finite duration of connectivity, and thus the link switches between connected and non-connected states. The time-varying characteristic of the sat...

Examples

Embodiment

[0063] Embodiment: Take a small LEO rose constellation as an example. The configuration parameter of the constellation is 42°:32 / 4 / 1, the orbit height is 7728 kilometers; the minimum communication angle is 10°, and each star has two intra-orbit inter-satellite links and two inter-orbit inter-satellite links, There are no mandatory closures. The simulation time is 2 hours long. The geographic locations of the two ground terminals of the line are A (0°E, 20°N) and B (120°E, 50°N). The number of handovers is used as the routing optimization index.

[0064] Step 1: Establish a link state switching table. Compute the connected interval of the link in 2 hours of simulation time.

[0065] ...

[0066] L A，28 =Link A，28 {S A , S 28 ,0.0,'1',174.235,'-1',6480.908,'1',7127.136,'-1'}

[0067] ...

[0068] L B，10 =Link B，10 {S B , S 10 ,0.0,'1',385.135,'-1',6572.708,'1',7200.0,'-1'}

[0069] ...

[0070] L 3，10 =Link 3，10 {S 3 , S 10 ,0,'1',3600,'-1'}

[0071] ...

...

Images