Satellite virtual routing method of constellation distributed grid

By introducing constraints on high-latitude regions and satellite fault areas, as well as a local route endpoint supplementation method, into the local routing algorithm of low-Earth orbit satellite networks, the path selection is optimized, solving the problems of no path to follow or excessive path hops caused by improper path selection in low-Earth orbit satellite networks, thus improving the stability and efficiency of network communication.

CN119030911APending Publication Date: 2024-11-2610TH RES INST OF CETC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411000250.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-24
Publication Date
2024-11-26

AI Technical Summary

Technical Problem

Existing routing algorithms for low-Earth orbit (LEO) satellite networks struggle to effectively avoid the problem of no paths to follow or a significant increase in path hops in highly dynamic LEO satellite networks, especially in high-latitude regions and satellite fault areas, leading to unstable network communication.

Method used

By introducing constraints for high-latitude regions, satellite fault areas, and local route endpoint supplementation methods into the local routing algorithm, path selection is optimized to ensure path selection in high-latitude regions and fault areas, avoiding situations where there is no path to follow or the number of path hops is too high.

Benefits of technology

It effectively solves the problem of no path to follow or excessive path hops caused by improper path selection in distributed routing methods, and improves the communication stability and efficiency of satellite networks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119030911A_ABST
    Figure CN119030911A_ABST
Patent Text Reader

Abstract

The invention discloses a satellite virtual routing method for a constellation distributed grid, which comprises the following steps of: marking a node, mapped to a satellite network, of a source satellite as a source node, marking a node, mapped to the satellite network, of an end point satellite as an end point node, and enabling the source node to reach the end point node through multiple times of local routing of a sensing radius R in the satellite grid; when only the same-orbit inter-satellite chain exists in the high-latitude region, path selection from a source node to a terminal node is realized through constraint conditions of the high-latitude region; when the source node passes through the satellite fault area, path selection from the source node to the terminal node is realized through the constraint condition of the satellite fault area; and when the source node does not have a local end point, path selection from the source node to the end point node is realized through a local routing end point supplementing method. The satellite path can be efficiently planned.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of satellite Internet technology, and in particular to a satellite virtual routing method for a constellation distributed grid. Background Art

[0002] Due to their low orbital altitude, low-orbit satellites have the advantages of low round-trip latency, small satellite-to-ground link loss, and high data transmission rate when communicating with ground nodes. However, due to their short orbital operation period and relatively fast changes in network topology, traditional ground network routing cannot adapt to the highly dynamic low-orbit satellite network.

[0003] The earliest research on LEO satellite network routing technology started from the ATM mechanism, and many algorithms adopted a connection-oriented mechanism. The proposed connection-oriented single-layer LEO satellite network routing algorithms mainly include routing algorithms based on virtual topology and routing algorithms based on coverage domain division. The routing algorithm based on virtual topology divides the constellation period into several time slices by utilizing the periodicity and predictability of the satellite constellation operation, and divides the system network structure into multiple discrete snapshots on the time axis. The network topology in each time slice is regarded as fixed, so that the connection relationship in different time slices is established in advance for each network node based on the predictability of the network structure. The routing algorithm based on coverage domain division is mainly to solve the rerouting problem caused by link switching. The algorithm assumes that the movement of the satellite causes the switching, and then the ground terminal selects the new source satellite and destination satellite after the switching. The space segment no longer performs complete rerouting, but calculates the optimal path according to the adjacency relationship of the satellite coverage area.

[0004] With the development of satellite Internet, the current large-scale low-orbit satellite constellations are mainly based on IP satellite networks, which are connectionless networks. The connectionless single-layer satellite network routing algorithms mainly include data-driven routing algorithms, routing algorithms based on coverage domain division, and routing algorithms based on virtual nodes. The distributed routing algorithm (DRA) is a typical representative of virtual node-based routing algorithms. The algorithm uses the global satellite communication network (Teledesic) as a reference model and minimizes the packet transmission delay as the optimization goal. The geographic coordinates of each satellite in the constellation are represented by a logical address.<P,S> It is represented by , where P represents the number of the orbital plane where the satellite is located in the constellation, and S represents the number of the satellite in the orbit. The logical address changes dynamically during the operation of the satellite. The DRA algorithm mainly includes three stages: direction estimation, direction correction, and congestion handling. In the direction estimation stage, the algorithm assumes that the lengths of all inter-satellite links (ISLs) are equal. According to the logical addresses of the current satellite and the destination satellite, the shortest path between two points on the logical plane is used as the metric cost to determine the next-hop forwarding direction. When the satellite receives the packet, it determines the candidate direction of the next-hop satellite based on its current logical address and the logical address of the destination satellite. In the direction correction stage, the algorithm distinguishes the lengths of the intra-orbit ISL and the inter-orbit ISL, and marks the directions calculated in the direction estimation stage as primary and secondary directions according to the relative position relationship between the logical addresses of the source satellite and the destination satellite, and provides solutions for satellites in polar regions and on both sides of the "gap".

[0005] The DRA algorithm's solution for polar regions and both sides of the "gap" mainly provides a general idea from a theoretical perspective, but does not provide a specific strategy for avoiding it in advance. The distributed routing method uses multiple local optimal calculations to calculate the routing path. In high-latitude areas and regional satellite failure areas, there may be no way to find a way or the number of path hops may increase greatly. Specific avoidance strategies need to be added to enhance the directionality of distributed routing. Summary of the invention

[0006] In view of this, the present invention provides a satellite virtual routing method for a constellation distributed grid, which adds constraints to the local topology routing endpoint screening link of the local routing algorithm based on grid routing, considers three major situations, namely, high-latitude area constraints, regional satellite failure constraints, and local routing endpoint supplementation when no local endpoint is reachable, to achieve routing fault tolerance based on grid routing as a whole.

[0007] The present invention discloses a satellite virtual routing method for a constellation distributed grid, which comprises:

[0008] The source satellite is mapped to the node of the satellite network as the source node, and the destination satellite is mapped to the node of the satellite network as the destination node. The source node reaches the destination node through multiple local routes of the perception radius R in the satellite grid; when there is only the same-orbit intersatellite chain in the high-latitude area, the path selection from the source node to the destination node is realized through the constraints of the high-latitude area; when the source node passes through the satellite fault area, the path selection from the source node to the destination node is realized through the constraints of the satellite fault area; when the source node has no local destination reachable, the path selection from the source node to the destination node is realized through the local routing destination supplement method.

[0009] Furthermore, when there are only intersatellite links in the same orbit in the high-latitude region, there are no intersatellite links in the different orbit planes in the high-latitude region, that is, the mapping grid<m,n> and<m+i,n> The time is unreachable, where i = ±1, n∈{[n N_min ,n N_max ]∪[n S_min ,n S_max ]},|n N_min ,n N_max | is the number n value range of the constellation's northern hemisphere orbital plane without intersatellite chains, |n S_min ,n S_max | is the numbering value range of n for the different orbital planes in the southern hemisphere of the constellation without intersatellite chains, and m is the number of the orbital plane where the satellite is located in the constellation.

[0010] Furthermore, when there is only a co-orbital intersatellite link in the high-latitude region, the path selection from the source node to the terminal node is realized by the high-latitude region constraint condition, including:

[0011] If m F -m≥R,n F -n≥R, let i traverse from 0 to R, i is an integer, and find The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0012] If m F -m≥R,n F -n≥R, let i traverse from 0 to R, i is an integer, and find the value that satisfies n F ∈{[n N_min ,n N_max ]∪[n S_min ,n S_max ]}and The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0013] in, <mF ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane of the satellite in the constellation, n∈{[n N_min , n N_max ]∪[n S_min , n S_max ]}, The range of n values ​​for the constellation's northern hemisphere orbital plane without intersatellite chains, The range of n values ​​for the constellation's southern hemisphere orbital plane without intersatellite chains,<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0014] Furthermore, when there is only a co-orbital intersatellite link in the high-latitude region, the path selection from the source node to the terminal node is realized by the high-latitude region constraint condition, including:

[0015] If-R <m F -m <R,n F -n≥R, then let i traverse min{0,m F -m} to max{0,m F -m}, i is an integer, find the The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0016] If-R <m F -m <R,n F -n≥R, then let i traverse min{0,m F -m} to max{0,m F -m}, i is an integer, find the F ∈{[n N_min ,n N_max ]∪[n S_min ,n S_max ]}, and when |i|<|m F -m|, The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0017] in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane of the satellite in the constellation, n∈{[n N_min , nN_max ∪ [n S_min , n S_max}, is the range of the number n value of the constellation's northern hemisphere's non-star interlinking chain on the different orbital plane, is the range of the number n value of the constellation's southern hemisphere's non-star interlinking chain on the different orbital plane. <m′, n′> is the local area end point within the R-hop radius centered on the current source node, and m is the number of the orbital plane where the satellite is located in the constellation.

[0018] Furthermore, when there is only an in-orbit star interlinking chain in the high-latitude region, the path selection from the source node to the end node is achieved through the high-latitude region constraint conditions, including:

[0019] If m F - m ≥ R, - R < n F - n < R, then let i iterate from min{0, n F - n} to max{0, n F - n}, i is an integer, and find the value of i that satisfies . Then substitute it into <m′, n′> = <m + R - i, n + i> to obtain the value of <m′, n′>, which is the next path selection point from the source node to the end node;

[0020] If m F - m ≥ R, - R < n F - n < R, then let i iterate from min{0, n F - n} to max{0, n F - n}, i is an integer, and find the value of i that satisfies n F ∈ {[n N_min , n N_max ∪ [n S_min , n S_max}, and . Then substitute it into <m′, n′> = <m + R - i, n + i> to obtain the value of <m′, n′>. If the corresponding i is not found, substitute j into <m′, n′> = <m, n + j>, j = ±R to obtain the value of <m′, n′>, which is the next path selection point from the source node to the end node;

[0021] Among them, <m F , n F > is the number of the end node mapped to the grid by the end satellite based on its own position in the current time period; m is the number of the orbital plane where the satellite is located in the constellation, n ∈ {[n N_min , n N_max ∪ [n S_min , n S_max}, For the range of the number n of the constellation in the northern hemisphere with no inter-satellite links on different orbits For the range of the number n of the constellation in the southern hemisphere with no inter-satellite links on different orbits, <m′, n′> are the local area end points within the R-hop radius centered on the current source node, and m is the number of the orbit plane where the satellite is located in the constellation.

[0022] Further, when there are only inter-satellite links on the same orbit in the high-latitude region, the path selection from the source node to the end node is achieved through the high-latitude region constraint conditions, including:

[0023] If -R < m F -m < R, -R < n F -n < R, then let <m′, n′> = <m F , n F >, that is, the next path selection point from the source node to the end node is obtained;

[0024] If m F -m ≤ -R, n F -n ≤ -R, then let i iterate from -R to 0, i is an integer, and find the value of i that satisfies , and then substitute it into <m′, n′> = <m + i, n + R - i> to obtain the value of <m′, n′>, that is, the next path selection point from the source node to the end node is obtained;

[0025] If m F -m ≤ -R, n F -n ≤ -R, then let i iterate from -R to 0, i is an integer, and find the value of i that satisfies n F ∈{[n N_min , n N_max ∪ [n S_min , n S_max}, and , and then substitute it into <m′, n′> = <m + i, n + R - i> to obtain the value of <m′, n′>, that is, the next path selection point from the source node to the end node is obtained;

[0026] Among them, <m F , n F > is the number of the end node mapped to the grid by the end satellite based on its own position in the current time period; m is the number of the orbit plane where the satellite is located in the constellation, n ∈ {[n N_min , n N_max ∪ [n S_min , n S_max}, is the range of the number n value of the constellation in the northern hemisphere with no inter-satellite links on different orbits, |n S_min , n S_max| is the range of n values ​​for the constellation's southern hemisphere orbital plane without intersatellite chains,<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0027] Furthermore, when the source node passes through the satellite fault area, the path selection from the source node to the destination node is implemented by the satellite fault area constraint condition, including:

[0028] If m F -m≥R,n F -n≥R, let i traverse from 0 to R, i is an integer, and find the<m′+k,n′> ,k=0,…,m F -m′}∪{ <m F ,n′+l>,l=0,…,n F -n′})∩Ω=φ, and then substitute it into<m′,n′> =<m+i,n+R-i> ,get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0029] If-R <m F -m <R,n F -n≥R, then let i traverse min{0,m F -m} to max{0,m F -m}, i is an integer, find the<m′+k,n′> ,k=0,…,m F -m′}∪{ <m F ,n′+l>,l=0,…,n F -n′})∩Ω=φ, and then substitute it into<m′,n′> =<m+i,n+R-i> ,get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0030] in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0031] Furthermore, when the source node passes through the satellite fault area, the path selection from the source node to the destination node is implemented by the satellite fault area constraint condition, including:

[0032] If m F -m≥R,-R <n F-n < R, then let i iterate from min{0, n F -n} to max{0, n F -n}, where i is an integer, and find the value of i that satisfies ({<m′ + k, n′>, k = 0, …, m F -m′} ∪ {<m F , n′ + l>, l = 0, …, n F -n′}) ∩ Ω = φ. Then substitute it into <m′, n′> = <m + R - i, n + i> to obtain the value of <m′, n′>, which is the next path selection point from the source node to the destination node;

[0033] If -R < m F -m < R, -R < n F -n < R, find the values of m F and n F that satisfy ({<m′ + k, n′>, k = 0, …, m F -m′} ∪ {<m F , n′ + l>, l = 0, …, n F -n′}) ∩ Ω = φ. Let <m′, n′> = <m F , n F > to obtain the value of <m′, n′>, which is the next path selection point from the source node to the destination node;

[0034] If m F -m ≤ -R, n F -n ≤ -R, then let i iterate from -R to 0, where i is an integer, and find the value of i that satisfies ({<m′ + k, n′>, k = 0, …, m F -m′} ∪ {<m F , n′ + l>, l = 0, …, n F -n′}) ∩ Ω = φ. Then substitute it into <m′, n′> = <m + i, n + R - i> to obtain the value of <m′, n′>, which is the next path selection point from the source node to the destination node;

[0035] Among them, <m F , n F > is the number of the destination node mapped to the grid in the current time period by the destination satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, n is the number of the non-inter-satellite-link in the different orbital planes of the constellation, <m′, n′> is the local area destination within the R-hop radius centered on the current source node, and m is the number of the orbital plane where the satellite is located in the constellation.

[0036] Furthermore, when there is no reachable local destination for the source node, the path selection from the source node to the destination node is realized through the local routing destination supplement method, including:

[0037] If m≤m F ,n≤n F , let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n-(R-i)> ,<m-i,n+(R-i)> ,<m-i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0038] If m≥m F ,n≤n F Then let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n+(R-i)> ,<m-i,n+(R-i)> ,<m-i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0039] in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0040] Furthermore, when the source node has no local destination reachable, the path selection from the source node to the destination node is realized through the local routing destination supplement method, including:

[0041] If m≤m F ,n≥n F , let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n+(R-i)> ,<m+i,n-(R-i)> ,<m-i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0042] If m≥m F ,n≥n F , let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n+(R-i)> ,<m-i,n+(R-i)> ,<m+i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0043] in, <m F ,n F> is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0044] Due to the adoption of the above technical solution, the present invention has the following advantages: the present invention can effectively solve the problem that the distributed routing method uses multiple local optimal calculations to calculate the routing path, which may lead to a situation where there is no path to be found or the number of path hops is greatly increased. The present invention can efficiently plan satellite paths. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the embodiments of the present invention. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0046] FIG. 1( a ) is a schematic diagram of an intersatellite chain and grid numbering in a northern high latitude region according to an embodiment of the present invention;

[0047] FIG. 1( b ) is a schematic diagram of basic criteria screening results according to an embodiment of the present invention;

[0048] FIG1( c ) is a schematic diagram of the screening result of the additional high-latitude region constraint condition according to an embodiment of the present invention;

[0049] FIG. 2( a ) is a schematic diagram of basic criteria screening results according to an embodiment of the present invention;

[0050] FIG2( b ) is a schematic diagram of screening results of additional satellite fault region constraint conditions according to an embodiment of the present invention;

[0051] FIG3( a ) is a schematic diagram of screening results of additional satellite fault region constraint conditions according to an embodiment of the present invention;

[0052] FIG. 3( b ) is a schematic diagram of a local routing endpoint supplement result when no local endpoint is reachable according to an embodiment of the present invention. DETAILED DESCRIPTION

[0053] The present invention is further described in conjunction with the accompanying drawings and embodiments, and the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. All other embodiments obtained by ordinary technicians in this field should fall within the scope of protection of the embodiments of the present invention.

[0054] Referring to FIG. 1 , the present invention provides an embodiment of a satellite virtual routing method of a constellation distributed grid, which includes:

[0055] The source satellite is mapped to the node of the satellite network as the source node, and the destination satellite is mapped to the node of the satellite network as the destination node. The source node reaches the destination node through multiple local routes of the perception radius R in the satellite grid; when there is only the same-orbit intersatellite chain in the high-latitude area, the path selection from the source node to the destination node is realized through the constraints of the high-latitude area; when the source node passes through the satellite fault area, the path selection from the source node to the destination node is realized through the constraints of the satellite fault area; when the source node has no local destination reachable, the path selection from the source node to the destination node is realized through the local routing destination supplement method.

[0056] In one embodiment, when there is only a co-orbital intersatellite link in the high-latitude region, there is no intersatellite link in the different-orbital plane in the high-latitude region, that is, the mapping grid<m,n> and<m+i,n> The time is unreachable, where i = ±1, n∈{[n N_min ,n N_max ]∪[n S_min ,n S_max ]}, The range of n values ​​for the constellation's northern hemisphere orbital plane without intersatellite chains, is the range of n values ​​for the different orbital planes in the southern hemisphere of the constellation without intersatellite chains, and m is the number of the orbital plane where the satellite is located in the constellation.

[0057] In one embodiment, when there is only a co-orbital intersatellite link in the high-latitude region, the path selection from the source node to the terminal node is implemented by the high-latitude region constraint condition, including:

[0058] If m F -m≥R,n F -n≥R, let i traverse from 0 to R, i is an integer, and find The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0059] If m F -m≥R,n F -n≥R, let i traverse from 0 to R, i is an integer, and find the value that satisfies n F ∈{[n N_min ,n N_max ]∪[n S_min ,n S_max ]}and The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0060] in, <m F ,n F> is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane of the satellite in the constellation, n∈{[n N_min , n N_max ]∪[n S_min , n S_max ]}, The range of n values ​​for the constellation's northern hemisphere orbital plane without intersatellite chains, The range of n values ​​for the constellation's southern hemisphere orbital plane without intersatellite chains,<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0061] In one embodiment, when there is only a co-orbital intersatellite link in the high-latitude region, the path selection from the source node to the terminal node is implemented by the high-latitude region constraint condition, including:

[0062] If-R <m F -m <R,n F -n≥R, then let i traverse min{0,m F -m} to max{0,m F -m}, i is an integer, find the The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0063] If-R <m F -m <R,n F -n≥R, then let i traverse min{0,m F -m} to max{0,m F -m}, i is an integer, find the F ∈{[n N_min ,n N_max ]∪[n S_min ,n S_max ]}, and when |i|<|m F -m|, The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0064] in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane of the satellite in the constellation, n∈{[n N_min , n N_max ]∪[nS_min , n S_max} is the range of the number n of the constellation's northern hemisphere's non - inter - satellite - link on the non - co - orbital plane, is the range of the number n of the constellation's southern hemisphere's non - inter - satellite - link on the non - co - orbital plane. <m′, n′> is the end point of the local area within the R - hop radius centered on the current source node, and m is the number of the orbital plane where the satellite is located in the constellation.

[0065] In one embodiment, when there is only an in - orbit inter - satellite link in the high - latitude region, the path selection from the source node to the end node is achieved through the high - latitude region constraint conditions, including:

[0066] If m F −m ≥ R, −R < n F −n < R, then let i iterate from min{0, n F −n} to max{0, n F −n}, where i is an integer, and find the value of i that satisfies , and then substitute it into <m′, n′> = <m + R - i, n + i> to obtain the value of <m′, n′>, which is the next path selection point from the source node to the end node;

[0067] If m F −m ≥ R, −R < n F −n < R, then let i iterate from min{0, n F −n} to max{0, n F −n}, where i is an integer, and find the value of i that satisfies n F ∈{[n N_min , n N_max ∪ [n S_min , n S_max}, and , and then substitute it into <m′, n′> = <m + R - i, n + i> to obtain the value of <m′, n′>. If the corresponding i is not found, then substitute j into <m′, n′> = <m, n + j>, j = ±R to obtain the value of <m′, n′>, which is the next path selection point from the source node to the end node;

[0068] Among them, <m F , n F > is the number of the end node mapped to the grid by the end - point satellite based on its own position in the current time period; m is the number of the orbital plane where the satellite is located in the constellation, n ∈ {[n N_min , n N_max ∪ [n S_min , n S_max}, is the range of the number n of the constellation's northern hemisphere's non - inter - satellite - link on the non - co - orbital plane, For the range of the number n value of the inter-satellite link without stars on the different orbits in the southern hemisphere of the constellation, <m′,n′> is the local area end point within the R-hop radius centered on the current source node, and m is the number of the orbit plane where the satellite is located in the constellation.

[0069] In one embodiment, when there is only an in-orbit inter-satellite link in the high-latitude region, the path selection from the source node to the end node is realized through the high-latitude region constraint condition, including:

[0070] If -R < m F -m < R, -R < n F -n < R, then let <m′,n′> = <m F ,n F >, that is, the next path selection point from the source node to the end node is obtained;

[0071] If m F -m ≤ -R, n F -n ≤ -R, then let i traverse from -R to 0, i is an integer, and find the value of i that satisfies , and then substitute it into <m′,n′> = <m + i, n + R - i> to obtain the value of <m′,n′>, that is, the next path selection point from the source node to the end node is obtained;

[0072] If m F -m ≤ -R, n F -n ≤ -R, then let i traverse from -R to 0, i is an integer, and find the value of i that satisfies n F ∈{[n N_min ,n N_max ∪[n S_min ,n S_max} and , and then substitute it into <m′,n′> = <m + i, n + R - i> to obtain the value of <m′,n′>, that is, the next path selection point from the source node to the end node is obtained;

[0073] Among them, <m F ,n F > is the number of the end node mapped to the grid by the end satellite based on its own position in the current time period; m is the number of the orbit plane where the satellite is located in the constellation, n ∈ {[n N_min ,n N_max ∪[n S_min ,n S_max}, is the range of the number n value of the inter-satellite link without stars on the different orbits in the northern hemisphere of the constellation, is the range of the number n value of the inter-satellite link without stars on the different orbits in the southern hemisphere of the constellation, <m′,n′> is the local area end point within the R-hop radius centered on the current source node, and m is the number of the orbit plane where the satellite is located in the constellation.

[0074] In one embodiment, when the source node passes through the satellite fault area, the path selection from the source node to the end node is realized through the satellite fault area constraint condition, including:

[0075] If m F -m≥R,n F -n≥R, then let i traverse from 0 to R, where i is an integer, and find the value of i that satisfies ({<m′+k,n′>,k = 0,…,m F -m′}∪{<m F ,n′+l>,l = 0,…,n F -n′})∩Ω=φ, and then substitute it into <m′,n′>=<m+i,n+R-i> to obtain the value of <m′,n′>, that is, the next path selection point from the source node to the end node;

[0076] If -R<m F -m<R,n F -n≥R, then let i traverse from min{0,m F -m} to max{0,m F -m}, where i is an integer, and find the value of i that satisfies ({<m′+k,n′>,k = 0,…,m F -m′}∪{<m F ,n′+l>,l = 0,…,n F -n′})∩Ω=φ, and then substitute it into <m′,n′>=<m+i,n+R-i> to obtain the value of <m′,n′>, that is, the next path selection point from the source node to the end node;

[0077] Among them, <m F ,n F > is the number of the end node mapped to the grid in the current time period by the end satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, n is the number of the constellation's off-orbit planes without inter-satellite links, <m′,n′> is the local area end point within the R-hop radius centered on the current source node, and m is the number of the orbital plane where the satellite is located in the constellation.

[0078] In one embodiment, when the source node passes through the satellite fault area, the path selection from the source node to the end node is realized through the satellite fault area constraint condition, including:

[0079] If m F -m≥R,-R<n F -n<R, then let i traverse from min{0,n F -n} to max{0,n F-n}, where i is an integer, find the value of i that satisfies ({<m′+k,n′>, k = 0, …, m F -m′} ∪ {<m F ,n′+l>, l = 0, …, n F -n′}) ∩ Ω = φ, then substitute it into <m′,n′> = <m+R-i,n+i> to obtain the value of <m′,n′>, that is, obtain the next path selection point from the source node to the destination node;

[0080] If -R < m F -m < R, -R < n F -n < R, find the values of m F and n that satisfy ({<m′+k,n′>, k = 0, …, m F ,n′+l>, l = 0, …, n F -n′}) ∩ Ω = φ, and let <m′,n′> = <m F ,n F >, then obtain the value of <m′,n′>, that is, obtain the next path selection point from the source node to the destination node; F ,n F > to obtain the value of <m′,n′>, that is, obtain the next path selection point from the source node to the destination node;

[0081] If m F -m ≤ -R, n F -n ≤ -R, then let i iterate from -R to 0, where i is an integer, find the value of i that satisfies ({<m′+k,n′>, k = 0, …, m F -m′} ∪ {<m F ,n′+l>, l = 0, …, n F -n′}) ∩ Ω = φ, and then substitute it into <m′,n′> = <m+i,n+R-i> to obtain the value of <m′,n′>, that is, obtain the next path selection point from the source node to the destination node;

[0082] Among them, <m F ,n F > is the number of the destination node mapped to the grid by the destination satellite based on its own position in the current time period; m is the number of the orbital plane where the satellite is located in the constellation, n is the number of the constellation's off-orbit planes without inter-satellite links, <m′,n′> is the local area destination within the R-hop radius centered on the current source node, and m is the number of the orbital plane where the satellite is located in the constellation.

[0083] In one embodiment, when there is no reachable local destination for the source node, the path selection from the source node to the destination node is implemented through the local routing destination supplement method, including:

[0084] If m ≤ m F ,n ≤ n F, let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n-(R-i)> ,<m-i,n+(R-i)> ,<m-i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0085] If m≥m F ,n≤n F Then let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n+(R-i)> ,<m-i,n+(R-i)> ,<m-i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0086] in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0087] In one embodiment, when the source node has no local destination reachable, the path selection from the source node to the destination node is implemented through the local routing destination supplement method, including:

[0088] If m≤m F ,n≥n F , let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n+(R-i)> ,<m+i,n-(R-i)> ,<m-i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0089] If m≥m F ,n≥n F , let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n+(R-i)> ,<m-i,n+(R-i)> ,<m+i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node;

[0090] in, <m F ,n F> is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0091] For ease of understanding, the present invention provides a more specific embodiment:

[0092] Example 1

[0093] This embodiment provides a specific implementation process example of a method for selecting local topological routing endpoints in a constellation distributed routing grid pathfinding through a high-latitude area with a different orbital plane and no intersatellite links. A 60×60 low-orbit satellite constellation, each satellite has an intersatellite link with the two satellites in front and behind it in the same orbit and the two closest satellites in the adjacent orbit. Due to the high relative dynamics in high-latitude areas, there are only intersatellite links in the same orbit. The grid graph structure for auxiliary distributed routing calculation is shown in 1(a). Any grid point<m,n> , where m is between 1 and 60, and n is between 1 and 60. N_min is 27, n N_max is 34.

[0094] If the current satellite A calculates the number of the grid it maps to in the current time period based on its own position,<m,n> = <57,25>, as shown in Figure 1(b) and Figure 1(c), the destination IP address corresponds to the number of the grid mapped to the current time period of satellite F. <m F ,n F >=<58,28>, the radius R of the local routing screening endpoint is 2 hops.

[0095] The local routing endpoints selected based on the basic criteria are shown in Figure 1(b) as m′,n′>∈{57,27>,<58,26>}. The basic criterion is to select the local endpoints in the direction close to the target grid number, that is, the local endpoint grid number<m′,n′> The two parameters are always in the current source number<m,n> and the destination grid number <m F ,n F > value. For the local endpoints {57,27>, <58,26>} selected by the basic criteria, if the local optimal path algorithm calculates that <57,27> is the best path, then there will be no path to be found or the number of path hops will be greatly increased.

[0096] Add high-latitude area constraints to screen the local routing endpoints. The specific steps are as follows:

[0097] Step 1: Determine m F -m,n F-n and R, and determine the value of nF and {[n N_min ,n N_max ]∪[n S_min ,n S_max ]}, it is judged that -R <m F -m=1 <R,n F -n=3>R,

[0098] Step 2: Calculate the i value that meets the conditions, since m F -m=1, then min{0,m F -m}≤i≤max{0,m F -m}, the i value is 0 and 1, and since the i value is 0, |i|<|m F -m|, we need to further judge n+Ri and {[n N_min ,n N_max ]∪[n S_min ,n S_max ]}, after judging Therefore, the i value that meets the conditions is 1;

[0099] Step 3: Calculation<m′,n′> =<m+i,n+R-i> =<58,26>.

[0100] in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0101] As shown in Figure 1(c), the end point of the additional high-latitude region constraint screening is<m′,n′> = <58,26>, excluding <57,27> from the candidate set, thus avoiding the situation where there is no path to be found or the number of path hops is greatly increased.

[0102] Example 2

[0103] This embodiment provides a specific implementation process example of a method for selecting a local topology routing endpoint for constellation distributed routing grid pathfinding through a satellite fault area. A 60×60 low-orbit satellite constellation has a fault area Ω = {<55, 9>, <56, 9>, <57, 9>, <55, 10>, <56, 10>, <57, 10>, <55, 11>, <56, 11>, <57, 11>}.

[0104] If the current satellite A calculates the number of the grid it maps to in the current time period based on its own position,<m,n> = <54,8>, as shown in Figure 2(a) and Figure 2(b), the destination IP address corresponds to the number of the grid mapped to the current time period of satellite F. <m F ,n F >=<58,10>, the radius R of the local routing screening endpoint is 2 hops.

[0105] The local routing endpoint selected based on the basic criteria is shown in Figure 2(a).<m′,n′> ∈{<54,10>,<56,8>}. The basic criterion is to select the local endpoint in the direction close to the target grid number, that is, the local endpoint grid number<m′,n′> The two parameters are always in the current source number<m,n> and the destination grid number <m F ,n F > value. For the local endpoints {<54,10>, <56,8>} selected by the basic criteria, if the local optimal path algorithm calculates that <54,10> is the best path, then there will be no path to be found or the number of path hops will be greatly increased.

[0106] Additional satellite fault area constraints are added to screen the local routing endpoints. The specific steps are as follows:

[0107] Step 1: Determine m F -m,n F -n and R, and m is obtained by judging F -m=3>R,n F -n=2=R;

[0108] Step 2: Calculate the i value that meets the conditions;

[0109] Step 201: Let i = 0, calculate<m′,n′> =<54+i,8+2-i>=<54,10>, calculate

[0110] ({<m′+k,n′> , k=0,…,m F -m′}∪{ <m F ,n′+l>,l=0,…,n F -n′})∩Ω

[0111] =({<54,10>,<55,10>,<56,10>,<57,10>,<58,10>}∪{<58,10>})∩Ω

[0112] ={<54,10>,<55,10>,<56,10>,<57,10>,<58,10>}∩Ω≠φ

[0113] Then i=0 does not meet the condition;

[0114] Step 202: Let i = 1, calculate<m′,n′> =<54+i,8+2-i>=<55,9>, calculate

[0115] ({<m′+k,n′> , k=0,…,m F -m′}∪{ <m F ,n′+l>,l=0,…,n F -n′})∩Ω

[0116] =({<55,9>,<56,9>,<57,9>,<58,9>}∪{<58,9>,<58,10>})∩Ω

[0117] ={<55,9>,<56,9>,<57,9>,<58,9>,<58,10>}∩Ω≠φ

[0118] Then i=1 does not meet the condition;

[0119] Step 203: Let i = 2, calculate<m′,n′> =<54+i,8+2-i>=<56,8>, calculate

[0120] ({<m′+k,n′> , k=0,…,m F -m′}∪{ <m F ,n′+l>,l=0,…,n F -n′})∩Ω

[0121] =({<56,8>,<57,8>,<58,8>}∪{58,8>,<58,9>,<58,10>})∩Ω

[0122] ={<56,8>,<57,8>,<58,8>,<58,9>,<58,10>}∩Ω=φ

[0123] Then i=2 satisfies the condition;

[0124] Step 3: Order<m′,n′> =<54+2,8+2-2>=<56,8>.

[0125] in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0126] As shown in Figure 2(b), the end point of the additional satellite fault area constraint screening is<m′,n′> = <56,8>, excluding <54,10> from the candidate set, thus avoiding the situation where there is no path to be found or the number of path hops is greatly increased.

[0127] Example 3

[0128] This embodiment provides a specific implementation example of the local route endpoint supplement method when no local endpoint is reachable. The current satellite A calculates the number of the grid mapped to itself in the current time period based on its own position.<m,n> =<55,8>, the destination IP address corresponds to the number of the grid mapped to the current time period of satellite F. <m F ,n F >=<58,10>, the radius R of the local routing screening endpoint is 2 hops. There is a fault area between A and F

[0129]

[0130] The use of additional satellite fault area constraints to screen local routing endpoints cannot screen out endpoints that meet the requirements, as shown in Figure 3(a). The local routing endpoint supplement method is used when no local endpoint is reachable, as shown in Figure 3(b). The specific steps are as follows:

[0131] Step 1: Determine whether m, n and m are F ,n F The size of m <m F ,n <n F ;

[0132] Step 2: Supplement the conditions that meet the requirements<m′,n′> :

[0133] Step 201: Let i = 0, Ψ = φ, calculate

[0134] {<m+i,n-(R-i)> ,<m-i,n+(R-i)> ,<m-i,n-(R-i)>}

[0135] ={<55+0,8-(2-0)>,<55-0,8+(2-0)>,<55-0,8-(2-0)>}

[0136] ={<55,6>,<55,10>}

[0137] Then Ψ=φ∪{<55,6>,<55,10>}={<55,6>,<55,10>}.

[0138] Step 202: Let i = 1, calculate

[0139] {<m+i,n-(R-i)> ,<m-i,n+(R-i)> ,<m-i,n-(R-i)>}

[0140] ={>55+1,8-(2-1)>,<55-1,8+(2-1)>,<55-1,8-(2-1)>}

[0141] ={>56,7>,<54,9>,<54,7>}

[0142] but

[0143] Step 203: Let i = 2, calculate

[0144] {>m+i,n-(Ri)>,<m-i,n+(R-i)> ,<m-i,n-(R-i)>}

[0145] ={>55+2,8-(2-2)>,<55-2,8+(2-2)>,<55-2,8-(2-2)>}

[0146] ={>57,8>,<53,8>}

[0147] but

[0148] Step 3: Calculate the points that fall into the fault region:

[0149]

[0150] Step 4: Exclude the points that fall into the fault area from Ψ to obtain the supplementary node set:

[0151] <m′,n′> ∈{55,6>,<54,7>,<53,8>}

[0152] in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

[0153] 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 above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. A satellite virtual routing method for a constellation distributed grid, characterized in that: include: The source satellite is mapped to the node of the satellite network as the source node, and the destination satellite is mapped to the node of the satellite network as the destination node. The source node reaches the destination node through multiple local routes of the perception radius R in the satellite grid; when there is only the same-orbit intersatellite chain in the high-latitude area, the path selection from the source node to the destination node is realized through the constraints of the high-latitude area; when the source node passes through the satellite fault area, the path selection from the source node to the destination node is realized through the constraints of the satellite fault area; when the source node has no local destination reachable, the path selection from the source node to the destination node is realized through the local routing destination supplement method.

2. The method according to claim 1, characterized in that When there are only intersatellite links on the same orbit in high latitudes, there are no intersatellite links on the different orbit planes in high latitudes, that is, the mapping grid<m,n> and<m+i,n> The time is unreachable, where i = ±1, n∈{[n N_min ,n N_max ]∪[n S_min ,n S_max ]},|n N_min ,n N_max | is the number n value range of the constellation's northern hemisphere orbital plane without intersatellite chains, |n S_min ,n S_max | is the numbering value range of n for the different orbital planes in the southern hemisphere of the constellation without intersatellite chains, and m is the number of the orbital plane where the satellite is located in the constellation.

3. The method according to claim 1, characterized in that: When there is only a co-orbital intersatellite link in the high-latitude region, the path selection from the source node to the terminal node is realized by the high-latitude region constraint condition, including: If m F -m≥R,n F -n≥R, let i traverse from 0 to R, i is an integer, and find The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node; If m F -m≥R,n F -n≥R, let i traverse from 0 to R, i is an integer, and find the value that satisfies n F ∈{[n N_min ,n N_max ]∪[n S_min ,n S_max ]}and The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node; in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane of the satellite in the constellation, n∈{[n N_min , n N_max ]∪[n S_min , n S_max ]}, The range of n values ​​for the constellation's northern hemisphere orbital plane without intersatellite chains, The range of n values ​​for the constellation's southern hemisphere orbital plane without intersatellite chains,<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

4. The method according to claim 1, characterized in that: When there is only a co-orbital intersatellite link in the high-latitude region, the path selection from the source node to the terminal node is realized by the high-latitude region constraint condition, including: If-R <m F -m <R,n F -n≥R, then let i traverse min{0,m F -m} to max{0,m F -m}, i is an integer, find the The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node; If-R <m F -m <R,n F -n≥R, then let i traverse min{0,m F -m} to max{0,m F -m}, i is an integer, find the F ∈{[n N_min ,n N_max ]∪pn S_min ,n S_max ]}, and when |i|<|m F -m|, The value of i is then substituted into<m′,n′> =<m+i,n+R-i> In, get<m′,n′> The value of is the next path selection point from the source node to the end node; in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane of the satellite in the constellation, n∈{[n N_min , n N_max ]∪[n S_min , n S_max ]}, The range of n values ​​for the constellation's northern hemisphere orbital plane without intersatellite chains, The range of n values ​​for the constellation's southern hemisphere orbital plane without intersatellite chains,<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

5. The method according to claim 1, characterized in that When there is only a co-orbital intersatellite link in the high-latitude region, the path selection from the source node to the terminal node is realized by the high-latitude region constraint condition, including: If m F -m≥R, -R < n F -n < R, then let i iterate from min{0, n F -n} to max{0, n F -n}, where i is an integer, find the value of i that satisfies , and then substitute it into <m′, n′> = <m + R - i, n + i> to obtain the value of <m′, n′>, which is the next path selection point from the source node to the destination node; If m F -m ≥ R, -R < n F -n < R, then let i iterate from min{0, n F -n} to max{0, n F -n}, where i is an integer, and find the value of i that satisfies n F ∈{[n N_min , n N_max ∪ [n S_min , n S_max}, and substitute it into <m′, n′> = <m + R - i, n + i> to obtain the value of <m′, n′>. If the corresponding i is not found, substitute j into <m′, n′> = <m, n + j>, j = ±R to obtain the value of <m′, n′>, that is, obtain the next path selection point from the source node to the destination node; in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane of the satellite in the constellation, n∈{[n N_min , n N_max ]∪[n S_min , n S_max ]}, The range of n values ​​for the constellation's northern hemisphere orbital plane without intersatellite chains, The range of n values ​​for the constellation's southern hemisphere orbital plane without intersatellite chains,<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

6. The method according to claim 1, characterized in that When there is only a co-orbital intersatellite link in the high-latitude region, the path selection from the source node to the terminal node is realized by the high-latitude region constraint condition, including: If -R < m F -m < R, -R < n F -n < R, then let <m′, n′> = <m F , n F >, that is, obtain the next path selection point from the source node to the destination node; If m F -m≤-R,n F -n≤-R, then let i traverse from -R to 0, i is an integer, and find The value of i is then substituted into<m′,n′> =<m+i,n+R-i> ,get<m′,n′> The value of is the next path selection point from the source node to the end node; If m F -m≤-R,n F -n≤-R, let i traverse -R to 0, i is an integer, and find the value that satisfies n F ∈{{n N_min ,n N_max }∪[n S_min ,n S_max ]}and The value of i is then substituted into<m′,n′> =<m+i,n+R-i> ,get<m′,n′> The value of is the next path selection point from the source node to the end node; in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane of the satellite in the constellation, n∈{[n N_min , n N_max ]∪[n S_min , n S_max ]}, The range of n values ​​for the constellation's northern hemisphere orbital plane without intersatellite chains, The range of n values ​​for the constellation's southern hemisphere orbital plane without intersatellite chains,<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

7. The method according to claim 1, characterized in that When the source node passes through the satellite fault area, the path selection from the source node to the terminal node is realized by the satellite fault area constraint condition, including: If m F -m≥R,n F -n≥R, let i traverse from 0 to R, i is an integer, and find the<m′+k,n′> ,k=0,…,m F -m′}∪{ <m F ,n′+l>,l=0,…,n F -n′})∩Ω=φ, and then substitute it into<m′,n′> =<m+i,n+R-i> ,get<m′,n′> The value of is the next path selection point from the source node to the end node; If-R <m F -m <R,n F -n≥R, then let i traverse min{0,m F -m} to max{0,m F -m}, i is an integer, find the<m′+k,n′> ,k=0,…,m F -m′}∪{ <m F ,n′+l>,l=0,…,n F -n′})∩Ω=φ, and then substitute it into<m′,n′> =<m+i,n+R-i> ,get<m′,n′> The value of is the next path selection point from the source node to the end node; in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

8. The method according to claim 1, characterized in that When the source node passes through the satellite fault area, the path selection from the source node to the terminal node is realized by the satellite fault area constraint condition, including: If m F -m ≥ R, -R < n F -n < R, then let i iterate from min{0, n F -n} to max{0, n F -n}, where i is an integer, and find the value of i that satisfies (({<m′ + k, n′>, k = 0, …, m F -m′} ∪ {<m F , n′ + l>, l = 0, …, n F -n′}) ∩ Ω = φ. Then substitute it into <m′, n′> = <m + R - i, n + i> to obtain the value of <m′, n′>, which is the next path selection point from the source node to the destination node; If -R < m F -m < R, -R < n F -n < R, find the m that satisfies ({<m'+k, n'>, k = 0, …, m F -m'} ∪ {<m F , n'+l>, l = 0, …, n F -n'}) ∩ Ω = φ F and n F , let <m', n'> = <m F , n F >, obtain the value of <m', n'>, which is the next path selection point from the source node to the destination node; If m F -m≤-R,n F -n≤-R, then let i traverse -R to 0, i is an integer, and find the<m′+k,n′> ,k=0,…,m F -m′}∪{ <m F ,n′+l>,l=0,…,n F -n′})∩Ω=φ, and then substitute it into<m′,n′> =<m+i,n+R-i> ,get<m′,n′> The value of is the next path selection point from the source node to the end node; in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

9. The method according to claim 1, characterized in that: When the source node has no local destination reachable, the path selection from the source node to the destination node is realized through the local routing destination supplement method, including: If m≤m F ,n≤n F , let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n-(R-i)> ,<m-i,n+(R-i)> ,<m-i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node; If m≥m F ,n≤n F Then let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n+(R-i)> ,<m-i,n+(R-i)> ,<m-i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node; in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.

10. The method according to claim 1, characterized in that When the source node has no local destination reachable, the path selection from the source node to the destination node is realized through the local routing destination supplement method, including: If m≤m F ,n≥n F , let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n+(R-i)> ,<m+i,n-(R-i)> ,<m-i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node; If m≥m F ,n≥n F , let i traverse from 0 to R, i is an integer, and substitute i into<m′,n′> ∈{<m+i,n+(R-i)> ,<m-i,n+(R-i)> ,<m+i,n-(R-i)>}, we get<m′,n′> The value of is the next path selection point from the source node to the end node; in, <m F ,n F > is the number of the terminal node mapped to the grid in the current time period calculated by the terminal satellite based on its own position; m is the number of the orbital plane where the satellite is located in the constellation, and n is the number of the constellation's non-orbital plane without an intersatellite chain.<m′,n′> is the local end point of the area within the R-hop radius centered on the current source node, and m is the number of the orbital plane of the satellite in the constellation.