Distributed low earth orbit satellite inter-satellite routing method and device based on minimum hop count path

Abstract

The invention belongs to the technical field of satellite communication, and provides a distributed low earth orbit satellite inter-satellite routing method and device based on a minimum hop count path. The method comprises the following steps of: 1, constructing a low earth orbit satellite inter-satellite network with a topological structure, mapping the dynamically changed low earth orbit satellite inter-satellite network into a logic static network by utilizing a virtual node method, and determining the positions of a source satellite node and a target satellite node of a data packet to be forwarded in the logic static network; 2, determining a minimum hop count path and a path selection domain based on the positions of the source satellite node and the target satellite node; and step 3, starting from the source satellite node, gradually selecting a next-hop routing node of the data packet to be forwarded in the path selection domain according to the load state and survival probability of adjacent routing nodes until the next-hop routing node coincides with the target satellite node. According to the method and the device provided by the invention, the data transmission efficiency and reliability can be improved.

Description

Technical Field

[0001] The present invention belongs to the field of satellite communication technology, and in particular relates to a distributed low-orbit satellite inter-satellite routing method and device based on a minimum hop path. Background Art

[0002] Low-orbit satellites are widely used in military, commercial, and civilian communications due to their global coverage, latency, and flexible deployment. They are particularly effective in rapidly restoring communications and providing services when ground networks are limited or natural disasters occur. However, with the rapid growth in global demand for internet services, data traffic in low-orbit satellite networks continues to increase, leading to frequent network congestion and severely impacting data transmission efficiency and reliability.

[0003] Existing routing algorithms typically address this issue through the lens of path optimization, traffic balancing, and dynamic adjustment. For example, shortest-path algorithms optimize data transmission by selecting the path with the lowest latency. However, due to network load, they can easily lead to link overload. Traffic balancing algorithms distribute traffic to alleviate node pressure, but lack precise path selection, potentially reducing efficiency. Dynamic routing algorithms based on link state, while capable of dynamically adjusting routes, are computationally complex, making them difficult to implement in real time in large-scale satellite networks.

[0004] Furthermore, low-orbit satellite networks have a highly dynamic topology, with satellite nodes frequently moving around. This makes it difficult for routing algorithms to quickly adapt to network changes. Some methods also lack the ability to perceive load conditions, further exacerbating transmission delays and packet loss. Therefore, designing efficient, low-complexity routing algorithms under dynamic topologies is crucial for addressing congestion in low-orbit satellite networks. Summary of the Invention

[0005] To address the above problems, the present invention proposes a distributed low-orbit satellite inter-satellite routing method and device based on a minimum hop path. By establishing a network topology model and taking the minimum forwarding hop count as a necessary condition, the path selection strategy is optimized, the probability of node congestion is reduced, and the data arrival rate is improved.

[0006] In a first aspect, the present invention provides a distributed low-orbit satellite inter-satellite routing method based on a minimum hop path, comprising:

[0007] Step 1: Construct a low-orbit satellite inter-satellite network with a topological structure, map the dynamically changing low-orbit satellite inter-satellite network into a logical static network using a virtual node method, and determine the locations of the source satellite node and the destination satellite node of the data packet to be forwarded in the logical static network;

[0008] Step 2: Based on the locations of the source satellite node and the destination satellite node, determine a minimum hop path and a path selection domain; wherein the path selection domain includes all existing minimum hop paths;

[0009] Step 3: Starting from the source satellite node, according to the load status and survival probability of adjacent routing nodes, gradually select the next hop routing node of the data packet to be forwarded in the path selection domain until the next hop routing node coincides with the destination satellite node;

[0010] The survival probability is determined by the remaining size of the path selection domain.

[0011] Furthermore, the step 1 specifically includes:

[0012] Step 1.1: constructing a low-orbit satellite inter-satellite network with a topological structure based on the Walker inclined orbit constellation model; each satellite in the low-orbit satellite inter-satellite network is connected to two adjacent co-orbit satellites and two off-orbit satellites through inter-satellite links;

[0013] Step 1.2: Divide the earth's surface into K logical areas, and map each satellite in the low-orbit satellite intersatellite network to a corresponding logical area to obtain a logical stationary network.

[0014] Furthermore, the hop count calculation formula of the minimum hop count path is as follows:

[0015] H=d x +d y

[0016] Where H represents the number of hops in the minimum hop path, d x Indicates the number of hops in the same track direction, d y Indicates the number of hops in the off-track direction;

[0017] d x =min{|x d -x s |,N-|x d -x s |}

[0018] d y =min{|y d -y s |,M-|y d -y s |}

[0019] Among them, (x s ,y s ) represents the coordinates of the source satellite node in the logical stationary network, (x d ,y d) represents the coordinates of the destination satellite node in the logical geostationary network, N represents the number of satellite orbits in the logical geostationary network, and M represents the number of satellites on each orbit in the logical geostationary network.

[0020] Furthermore, the path selection domain is a minimum rectangular grid area, and the height and width are respectively determined by the number of co-orbital and heterogeneous hops between the source satellite node and the destination satellite node.

[0021] Furthermore, the calculation formula for the number of minimum hop paths included in the path selection domain is as follows:

[0022]

[0023] Among them, d x Indicates the number of hops in the same track direction of the path selection domain, d y Indicates the number of hops in the different track direction of the routing domain.

[0024] Furthermore, the survival probability is the number of minimum-hop paths included in the remaining area in the path selection domain.

[0025] Furthermore, the stepwise selection of the next-hop routing node in the path selection domain according to the load status and survival probability of the adjacent routing nodes includes:

[0026] In response to the current routing node having an adjacent routing node,

[0027] If the load state of the adjacent routing node is not less than the congestion threshold, the transmission is terminated and the packet loss is recorded;

[0028] If the load status of the adjacent routing node is less than the congestion threshold, the adjacent routing node is determined as the next-hop routing node.

[0029] Furthermore, the stepwise selection of the next-hop routing node in the path selection domain according to the load status and survival probability of the adjacent routing nodes further includes:

[0030] In response to the current routing node having two adjacent routing nodes,

[0031] If the load status of the adjacent routing node in a certain direction is not less than the congestion threshold, the adjacent routing node in the other direction is selected as the next hop routing node;

[0032] If the load status of adjacent routing nodes in both directions is not less than the congestion threshold, the transmission is terminated and the packet loss is recorded;

[0033] If the load status of adjacent routing nodes in both directions is less than the congestion threshold, the adjacent routing node with a high survival probability is selected as the next-hop routing node.

[0034] Furthermore, if the load status of the adjacent routing nodes in both directions is less than the congestion threshold, selecting the adjacent routing node with a high survival probability as the next hop routing node also includes:

[0035] If the survival probabilities in the two directions are the same, the adjacent routing node with a smaller load status is selected as the next-hop routing node.

[0036] In a second aspect, the present invention provides a distributed low-orbit satellite inter-satellite routing device based on a minimum hop path, comprising:

[0037] a logical static network construction module, configured to construct a low-orbit satellite inter-satellite network having a topological structure, map the dynamically changing low-orbit satellite inter-satellite network into a logical static network using a virtual node method, and determine the locations of source and destination satellite nodes for forwarding data packets in the logical static network;

[0038] a minimum hop path and path selection domain determination module, which determines a minimum hop path and a path selection domain based on the locations of the source satellite node and the destination satellite node; wherein the path selection domain includes all existing minimum hop paths;

[0039] a data packet routing module, configured to, starting from the source satellite node, gradually select a next-hop routing node for the data packet to be forwarded in the path selection domain according to the load status and survival probability of adjacent routing nodes, until the next-hop routing node coincides with the destination satellite node;

[0040] The survival probability is determined by the remaining size of the path selection domain.

[0041] The beneficial effects of the present invention are:

[0042] Under dynamic topology conditions, the present invention shields topology changes through the virtual node method, thereby improving the stability and real-time performance of routing calculations. By taking the minimum hop path as a necessary condition for path selection, the path selection domain is limited, significantly reducing the complexity of routing calculations. The routing strategy is optimized based on path survival probability and dynamic load information, effectively avoiding network congestion and reducing data packet loss rates.

[0043] Experimental results show that the method provided by the present invention exhibits excellent performance under different transmission rates and load conditions, can significantly reduce end-to-end transmission delay, improve data transmission efficiency and reliability, and is particularly suitable for efficient routing optimization in large-scale low-orbit satellite networks. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 A schematic flow chart of a distributed low-orbit satellite inter-satellite routing method based on a minimum-hop path provided by an embodiment of the present invention;

[0045] Figure 2 A schematic diagram of a low-orbit satellite constellation provided by an embodiment of the present invention;

[0046] Figure 3 A schematic diagram of an intersatellite link provided in an embodiment of the present invention;

[0047] Figure 4 A schematic diagram of a path selection domain provided by an embodiment of the present invention;

[0048] Figure 5 A schematic diagram of the remaining path selection domain provided by an embodiment of the present invention;

[0049] Figure 6 A schematic diagram of the next-hop routing selection algorithm provided in an embodiment of the present invention;

[0050] Figure 7 A schematic diagram of an algorithm example provided in an embodiment of the present invention;

[0051] Figure 8 A schematic diagram of delay distribution results at different transmission rates provided by an embodiment of the present invention;

[0052] Figure 9 A comparison chart of average delays provided by an embodiment of the present invention;

[0053] Figure 10 A comparison chart of packet loss rates provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0054] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly described below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present invention.

[0055] like Figure 1 As shown, an embodiment of the present invention provides a distributed low-orbit satellite inter-satellite routing method based on a minimum hop path, including:

[0056] Step 1: Construct a low-orbit satellite inter-satellite network with a topological structure, use the virtual node method to map the dynamically changing low-orbit satellite inter-satellite network into a logical static network, and determine the locations of the source satellite nodes and destination satellite nodes for forwarding data packets in the logical static network.

[0057] Step 2: Based on the locations of the source and destination satellite nodes, determine the minimum hop path and the path selection domain, where the path selection domain contains all existing minimum hop paths.

[0058] Specifically, if Figure 2 As shown in Figure 1, when a direct link cannot be established between the source and destination satellite nodes, the minimum hop path is used as the basic criterion for routing decisions. The path hop count is defined as the number of relays a data packet undergoes when transmitting from the source satellite node to the destination satellite node. The minimum hop path satisfies:

[0059] H=d x +d y

[0060] Where H represents the number of hops in the minimum hop path, d x Indicates the number of hops in the same track direction, d y Indicates the number of hops in the off-track direction;

[0061] d x =min{|x d -x s |,N-|x d -x s |}

[0062] d y =min{|y d -y s |,M-|y d -y s |}

[0063] Among them, (x s ,y s ) represents the coordinates of the source satellite node in the logical stationary network, (x d ,y d ) represents the coordinates of the destination satellite node in the logical geostationary network, N represents the number of satellite orbits in the logical geostationary network, and M represents the number of satellites on each orbit in the logical geostationary network.

[0064] like Figure 2 As shown in the figure, the source satellite node and the destination satellite node determine the path selection domain, which is the minimum rectangular grid area. Its height and width are respectively determined by the number of co-track hops d between the source satellite node and the destination satellite node. x and the number of off-track hops d y The boundary of the path selection domain clarifies the optimal path set, reduces the search space, and lays the foundation for the calculation of path generation probability.

[0065] Step 3: Starting from the source satellite node, the next-hop routing node for the packet to be forwarded is gradually selected in the path selection domain based on the load status and survival probability of adjacent routing nodes, until the next-hop routing node coincides with the destination satellite node. The survival probability is related to the residual size of the path selection domain.

[0066] The method provided by an embodiment of the present invention uses a virtual node method to map a dynamically changing network into a logically static network, reducing the impact of the dynamic network topology on routing calculations. It also uses a minimum hop path as the basic criterion for routing decisions to optimize data transmission paths in low-orbit satellite networks, improving data transmission efficiency and reliability. Furthermore, it uses a routing strategy that combines survival probability and node load status to reduce the probability of node congestion. This invention can be applied to global internet access services, terrestrial communication supplementary networks, and distributed intersatellite communication systems, and is particularly suitable for low-orbit satellite networks operating in high-load dynamic environments.

[0067] Based on the above embodiment, the specific implementation of step 1 is as follows:

[0068] Step 1.1: Based on the Walker inclined orbit constellation model, a low-orbit satellite inter-satellite network with a topological structure is constructed. Each satellite in the low-orbit satellite inter-satellite network is connected to two adjacent co-orbit satellites and two off-orbit satellites through inter-satellite links.

[0069] Specifically, if Figure 3 As shown, the embodiment of the present invention adopts a single-layer low-orbit satellite intersatellite network, whose structure satisfies the Walker inclined orbit constellation model and consists of multiple inclined orbits and evenly distributed satellites. Each satellite communicates with two adjacent co-orbit satellites and two off-orbit satellites via inter-satellite links to ensure network connectivity and form a grid structure. The specific link distribution is as follows Figure 4 As shown, in the embodiment of the present invention, the number of satellite orbits is set to N, the number of satellites on each orbit is M, and the jth satellite on the i-th orbit is S i,j express.

[0070] Step 1.2: Divide the Earth's surface into K logical regions, and map each satellite in the low-orbit intersatellite network to the corresponding region to obtain a logical stationary network.

[0071] Specifically, the topology of intersatellite networks in low-orbit satellite orbits changes dynamically due to the high-speed motion of satellites. To address this issue, a virtual node approach is used to divide the Earth's surface into K logical regions. Each satellite node is mapped to its corresponding region, making the satellite nodes and logical regions relatively static. This shields the topology from dynamics and simplifies the routing calculation process in subsequent steps.

[0072] Based on the above embodiment, a method for calculating the number of minimum-hop paths included in a path selection domain is provided. The specific formula is as follows:

[0073]

[0074] Among them, C pathIndicates the number of minimum hop paths within the path selection domain. When d x and d y When both are greater than zero, there are multiple minimum hop paths in the path selection domain, the path selection space for the data packet increases, and the path survival probability increases. The embodiment of the present invention defines the survival probability P survival The number of minimum-hop paths contained in the remaining area of the path selection domain is as follows:

[0075]

[0076] Among them, P survival represents the survival probability. Figure 5 As shown in FIG, if data packets are forwarded along the same track, the size of the remaining path selection domain is △N×(△M-1); if data packets are forwarded along different tracks, the size of the remaining path selection domain is (△N-1)×△M.

[0077] Based on the above embodiment, in step 3, the next hop routing node is selected specifically by the following method:

[0078] In response to the current routing node having an adjacent routing node,

[0079] If the load status of the adjacent routing node is not less than the congestion threshold, the transmission is terminated and the packet loss is recorded;

[0080] If the load status of the adjacent routing node is less than the congestion threshold, the adjacent routing node is determined as the next-hop routing node.

[0081] In response to the current routing node having two adjacent routing nodes,

[0082] If the load status of the adjacent routing node in a certain direction is not less than the congestion threshold, the adjacent routing node in the other direction is selected as the next hop routing node;

[0083] If the load status of adjacent routing nodes in both directions is not less than the congestion threshold, the transmission is terminated and the packet loss is recorded;

[0084] If the load status of adjacent routing nodes in both directions is less than the congestion threshold, the adjacent routing node with a higher survival probability is selected as the next-hop routing node; if the survival probabilities in both directions are the same, the adjacent routing node with a smaller load status is selected as the next-hop routing node.

[0085] The routing forwarding strategy in step 3 above specifically includes path selection criteria and congestion status judgment:

[0086] Path selection criteria:

[0087] During the forwarding process of the data packet, if the remaining area hop count direction d of the path selection domain xor d y If d is 0, the path is unique and the data packet is forwarded along this unique direction. x ≠0 and d y ≠0, according to the survival probability of the path selection domain, give priority to the C in the remaining path selection domain path The packet is forwarded in the direction with the largest number of nodes. When the packet selects the next hop node, the path selection domain shrinks, and the number of remaining paths determines the subsequent survival probability. The survival probability is dynamically updated as the path selection domain shrinks.

[0088] Congestion status judgment:

[0089] Considering the load status of adjacent satellite nodes, the path selection needs to be judged based on the congestion status. i,j The load state is L i,j , if L i,j <L threshold If the congestion threshold is lower than the threshold, the node can be used as the next hop node. The specific decision-making basis is as follows:

[0090] If both the same track direction and the different track direction are not congested, compare d x and d y When d x <d y When d x >d y When d x =d y When the load is lighter, the direction with the lighter load is selected for forwarding.

[0091] If the nodes in a certain direction are congested, the non-congested direction is selected for forwarding.

[0092] If all alternative directions are congested, the data packet transmission is terminated and the packet loss rate is calculated.

[0093] After each packet selects the next hop routing node and completes a jump, the size of the path selection domain (d x ,d y ) and the size C of the remaining area of the path selection domain path The update formula for the remaining area of the path selection domain is as follows:

[0094] d x =d x -Δ x ,d y =d y -Δ y

[0095] Among them, Δ x and Δ yThey are the path step values of the current jump direction in the same track and different track directions, and the step value is 1.

[0096] For ease of understanding, Figure 6 As shown, the above step 3 can be expressed as the following steps:

[0097] Step 3.1: Determine the number of co-orbital paths △M and the number of heterogeneous paths △N of the remaining paths based on the current routing node coordinates S(N1, M1) and the destination satellite node coordinates S(N2, M2), and forward data packets based on △M and △N.

[0098] Specifically, △M and △N are calculated as follows:

[0099] △N=min{|N1-N2|,N-|N1-N2|}

[0100] △M=min{|M1-M2|,N-|M1-M2|}

[0101] Step 3.2: Determine whether ΔM=0 and ΔN=0 are satisfied. If so, it means that the current node coincides with the destination node and the data packet is forwarded. If not, proceed to step 3.3.

[0102] Step 3.3: Determine whether △M≠0 and △N≠0 are satisfied. If not, proceed to step 3.31. If so, proceed to step 3.4.

[0103] Step 3.31: Determine whether the remaining forwarding directions are congested. If so, perform packet loss processing and terminate routing forwarding; otherwise, determine that the forwarding direction is non-congested and proceed to step 3.6.

[0104] Step 3.4: Determine whether there is congestion. If so, proceed to step 3.41; otherwise, proceed to step 3.5.

[0105] Step 3.41: Determine whether there is congestion in both forwarding directions. If so, perform packet loss processing. Otherwise, determine to forward in the non-congested direction and proceed to step 3.5.

[0106] Step 3.5: Compare △M and △N, determine the forwarding direction, and proceed to step 3.6;

[0107] Specifically, if ΔN<ΔM, forwarding is determined to be in the same track direction; if ΔN=ΔM, forwarding is determined to be in the direction with less congestion; if ΔN>ΔM, forwarding is determined to be in the different track direction.

[0108] Step 3.6: Forward to the next satellite node, update the current satellite number, and execute step 3.1.

[0109] like Figure 7FIG. 1 is a schematic diagram of a path using the next-hop routing node selection method provided by an embodiment of the present invention.

[0110] Based on the above embodiment, an embodiment of the present invention further provides a distributed low-orbit satellite inter-satellite routing device based on a minimum hop path, comprising:

[0111] A logical static network construction module is used to construct a low-orbit satellite inter-satellite network with a topological structure, map the dynamically changing low-orbit satellite inter-satellite network into a logical static network using a virtual node method, and determine the locations of the source and destination satellite nodes of the data packets to be forwarded in the logical static network;

[0112] A minimum hop path and path selection domain determination module determines a minimum hop path and a path selection domain based on the locations of the source satellite node and the destination satellite node; wherein the path selection domain includes all existing minimum hop paths;

[0113] The data packet routing module is used to start from the source satellite node and gradually select the next hop routing node for the data packet to be forwarded in the path selection domain based on the load status and survival probability of adjacent routing nodes until the next hop routing node coincides with the destination satellite node; the survival probability is determined by the remaining size of the path selection domain.

[0114] To verify the performance of the proposed method, simulation experiments were conducted. The experimental setup employed satellite constellation parameters including N = 32 orbits, M = 50 satellites per orbit, a satellite altitude of 550 km, an 8 kb packet size, and a transmission rate of 60-160 Mb / s. The experimental comparison algorithms included the Minimum Delay Path (MDP) algorithm, the Evenly Distributed Path (ATDP) algorithm, and the Routing Algorithm Based on Link State (RAISLS).

[0115] 1. Latency Distribution

[0116] The end-to-end delay is calculated by the following formula:

[0117] T=T send +T queue +T link +T process

[0118] Among them, T send Indicates the packet sending delay, T queue represents the queuing delay, T link is the link propagation delay, T process is the node processing delay. Figure 8 and Figure 9 As shown, the end-to-end delay of the method provided by the present invention at different transmission rates is significantly lower than that of other algorithms, especially under high load conditions, the delay increase is small.

[0119] 2. Packet loss rate

[0120] The packet loss rate is calculated as follows:

[0121]

[0122] Among them, N loss Indicates the number of lost packets, N total Indicates the total number of packets sent. Figure 10 As shown, the packet loss rate of the embodiment of the present invention is always lower than that of the MDP and ATDP algorithms, showing excellent congestion control capability.

[0123] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A distributed low-orbit satellite inter-satellite routing method based on a minimum hop path, characterized in that: include: Step 1: Construct a low-orbit satellite inter-satellite network with a topological structure, map the dynamically changing low-orbit satellite inter-satellite network into a logical static network using a virtual node method, and determine the locations of the source satellite node and the destination satellite node of the data packet to be forwarded in the logical static network; Step 2: Determine a minimum hop path and a path selection domain based on the locations of the source satellite node and the destination satellite node; The path selection domain includes all existing minimum hop paths; Step 3: Starting from the source satellite node, according to the load status and survival probability of adjacent routing nodes, gradually select the next hop routing node of the data packet to be forwarded in the path selection domain until the next hop routing node coincides with the destination satellite node; The survival probability is determined by the remaining size of the path selection domain.

2. The distributed low-orbit satellite inter-satellite routing method based on minimum hop path according to claim 1, characterized in that: The step 1 specifically includes: Step 1.1: constructing a low-orbit satellite inter-satellite network with a topological structure based on the Walker inclined orbit constellation model; each satellite in the low-orbit satellite inter-satellite network is connected to two adjacent co-orbit satellites and two off-orbit satellites through inter-satellite links; Step 1.2: Divide the earth's surface into K logical areas, and map each satellite in the low-orbit satellite intersatellite network to a corresponding logical area to obtain a logical stationary network.

3. The distributed low-orbit satellite inter-satellite routing method based on minimum hop path according to claim 1, characterized in that: The formula for calculating the number of hops of the minimum hop path is as follows: H=d x +d y Where H represents the number of hops in the minimum hop path, d x Indicates the number of hops in the same track direction, d y Indicates the number of hops in the off-track direction; d x =min{|x d -x s |,N-|x d -x s |} d y =min{|y d -y s |,M-|y d -y s |} Among them, (x s ,y s ) represents the coordinates of the source satellite node in the logical stationary network, (x d ,y d ) represents the coordinates of the destination satellite node in the logical geostationary network, N represents the number of satellite orbits in the logical geostationary network, and M represents the number of satellites on each orbit in the logical geostationary network.

4. The distributed low-orbit satellite inter-satellite routing method based on minimum hop path according to claim 1, characterized in that: The path selection domain is a minimum rectangular grid area, and the height and width are respectively determined by the number of co-orbital and heterogeneous hops between the source satellite node and the destination satellite node.

5. The distributed low-orbit satellite inter-satellite routing method based on minimum hop path according to claim 3, characterized in that: The formula for calculating the number of minimum hop paths included in the path selection domain is as follows: Among them, d x Indicates the number of hops in the same track direction of the path selection domain, d y Indicates the number of hops in the different track direction of the routing domain.

6. The distributed low-orbit satellite inter-satellite routing method based on minimum hop path according to claim 5, characterized in that: The survival probability is the number of minimum-hop paths contained in the remaining area in the path selection domain.

7. The distributed low-orbit satellite inter-satellite routing method based on minimum hop path according to claim 1, characterized in that: The step of gradually selecting a next-hop routing node in the path selection domain according to the load status and survival probability of the adjacent routing nodes includes: In response to the current routing node having an adjacent routing node, If the load state of the adjacent routing node is not less than the congestion threshold, the transmission is terminated and the packet loss is recorded; If the load status of the adjacent routing node is less than the congestion threshold, the adjacent routing node is determined as the next-hop routing node.

8. The distributed low-orbit satellite inter-satellite routing method based on minimum hop path according to claim 7, characterized in that: The step of gradually selecting a next-hop routing node in the path selection domain according to the load status and survival probability of the adjacent routing nodes further includes: In response to the current routing node having two adjacent routing nodes, If the load status of the adjacent routing node in a certain direction is not less than the congestion threshold, the adjacent routing node in the other direction is selected as the next hop routing node; If the load status of adjacent routing nodes in both directions is not less than the congestion threshold, the transmission is terminated and the packet loss is recorded; If the load status of adjacent routing nodes in both directions is less than the congestion threshold, the adjacent routing node with a high survival probability is selected as the next-hop routing node.

9. The distributed low-orbit satellite inter-satellite routing method based on minimum hop path according to claim 8, characterized in that: If the load status of the adjacent routing nodes in both directions is less than the congestion threshold, the adjacent routing node with a high survival probability is selected as the next hop routing node, further comprising: If the survival probabilities in the two directions are the same, the adjacent routing node with a smaller load status is selected as the next-hop routing node.

10. A distributed low-orbit satellite inter-satellite routing device based on a minimum hop path, characterized in that: include: a logical static network construction module, configured to construct a low-orbit satellite inter-satellite network having a topological structure, map the dynamically changing low-orbit satellite inter-satellite network into a logical static network using a virtual node method, and determine the locations of source and destination satellite nodes for forwarding data packets in the logical static network; a minimum hop path and path selection domain determination module, which determines a minimum hop path and a path selection domain based on the locations of the source satellite node and the destination satellite node; The path selection domain includes all existing minimum hop paths; a data packet routing module, configured to, starting from the source satellite node, gradually select a next-hop routing node for the data packet to be forwarded in the path selection domain according to the load status and survival probability of adjacent routing nodes, until the next-hop routing node coincides with the destination satellite node; The survival probability is determined by the remaining size of the path selection domain.

Images