CN113765575A - Remote sensing constellation routing algorithm based on inter-satellite link - Google Patents
Remote sensing constellation routing algorithm based on inter-satellite link Download PDFInfo
- Publication number
- CN113765575A CN113765575A CN202110941636.6A CN202110941636A CN113765575A CN 113765575 A CN113765575 A CN 113765575A CN 202110941636 A CN202110941636 A CN 202110941636A CN 113765575 A CN113765575 A CN 113765575A
- Authority
- CN
- China
- Prior art keywords
- satellite
- remote sensing
- inter
- link
- ground
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/18521—Systems of inter linked satellites, i.e. inter satellite service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18513—Transmission in a satellite or space-based system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a remote sensing constellation routing algorithm based on inter-satellite links, which comprises the following steps: s1, constructing a walker constellation satellite remote sensing system, and simultaneously establishing an inter-satellite link and a satellite-ground link; s2, generating a primary mesh topological structure along the longitude and latitude direction of the intersatellite link constructed based on S1; s3, selecting an area, and determining a ground data transmission station which can cover the whole area in the area; s4, constructing a secondary mesh topological structure based on the remote sensing satellite of S1 and the ground transmission station of S3, and time slicing the secondary mesh topological structure; s5, routing in each time slice; s6, constructing an undirected graph G (V, E) based on the S5 pair of secondary mesh topological structures, wherein V comprises all remote sensing satellite nodes, and E comprises edges between each node and the nodes; the invention obviously improves the underground transmission capability of the whole remote sensing constellation data through reasonable topological network structure design and based on the remote sensing constellation routing algorithm of the inter-satellite link.
Description
Technical Field
The invention relates to the technical field of satellite data transmission, in particular to a remote sensing constellation routing algorithm based on an inter-satellite link.
Background
With the development of aerospace technology, the layout of space satellites is improved more and more, however, data transmission of satellites and remote sensing control of the satellites are mostly independent control and data transmission of a single satellite, even if networking is carried out, ground fitting is still carried out through a plurality of bottom surface data transmission stations, the aerial satellites are still in an independent state, the control cost, the data transmission cost and the operation and maintenance cost are greatly increased in the mode, and therefore a remote sensing constellation routing algorithm based on inter-satellite links is provided.
Disclosure of Invention
The invention aims to provide a remote sensing constellation routing algorithm based on an inter-satellite link so as to solve the problems in the background technology.
In order to achieve the purpose, the invention provides the following technical scheme:
the remote sensing constellation routing algorithm based on the inter-satellite link comprises the following steps:
s1, constructing a walker constellation satellite remote sensing system, and simultaneously establishing an inter-satellite link and a satellite-ground link;
s2, generating a primary mesh topological structure along the longitude and latitude direction of the intersatellite link constructed based on S1;
s3, selecting an area, and determining a ground data transmission station which can cover the whole area in the area;
s4, constructing a secondary mesh topological structure based on the remote sensing satellite of S1 and the ground transmission station of S3, and time slicing the secondary mesh topological structure;
s5, routing in each time slice;
and S6, constructing an undirected graph G (V, E) based on the S5 pair of two-level mesh topology, wherein V comprises all remote sensing satellite nodes, and E comprises each node and edges between the nodes.
Preferably, the specific construction steps of the walker constellation satellite remote sensing system are as follows:
s101, presetting that the height of a track is 562.22km, the inclination angle of the track is 97.65 degrees, constructing 9 track surfaces, and respectively setting the ascension angles of the ascending intersections to be 0 degree, 24 degrees, 48 degrees, 72 degrees, 96 degrees, 120 degrees, 144 degrees, 168 degrees and 192 degrees;
s102, 8 remote sensing satellites are uniformly distributed on each orbital plane, Sar satellites and optical satellites are distributed in a crossed mode, and the phase difference of the satellites at the same position of adjacent orbital planes is 5 degrees;
s103, each satellite is provided with four inter-satellite link antennas and one satellite-ground link antenna:
establishing inter-satellite connection between four adjacent satellites based on an inter-satellite link antenna, wherein the four adjacent satellites are respectively two satellites before and after the same orbit and two satellites on the left and right of the different orbit;
and establishing satellite-ground connection between the corresponding satellite and the ground data transmission station based on the satellite-ground link antenna.
Preferably, the specific steps of the primary mesh topology structure are as follows:
s201, stability of relative positions and relative angles can be kept among satellites based on the same orbit, and then inter-satellite links are kept for a long time;
s202, the relative angle, the relative speed and the relative distance among the satellites based on the different orbits are in a continuous change state, so that when the satellites run to a high-altitude area, inter-satellite links are interrupted;
s203, a primary mesh topology structure is formed based on the mutual combination of S201 and S202.
Preferably, the specific steps selected by the ground data transmission station are as follows:
s301, carrying out simulation calculation based on the STK, and acquiring the rail passing opportunity distribution of the data transmission station in the area;
and S302, selecting two ground data transmission stations with the most opportunities based on the rail passing opportunity distribution of the ground data transmission stations obtained in the S301, and realizing the coverage rate of the selected area.
Preferably, the specific steps of the secondary mesh topology and the time slicing thereof are as follows:
s401, forming a secondary network topological structure based on the 72 remote sensing satellites in the S1 and the two ground data transmission stations in the S3;
s402, constructing time slices, and dividing the change period of the secondary network topology structure;
s403, acquiring an inter-satellite link connection state and a satellite-to-ground link connection state in a secondary network topology structure in each time slice;
s404, dividing a two-stage network topological structure in each time slice into a relatively stable part and a variable part, wherein the relatively stable part is an inter-satellite link and a satellite-ground link in the same orbit, and the variable part is an inter-satellite link in different orbits.
Preferably, the routing in each time slice includes:
s501, obtaining and determining a secondary network topological structure in any time slice in S4, and setting the same output cost of each hop of an intra-rail link, an inter-rail link and a satellite-to-ground link;
s502, defining the set of all remote sensing satellites with data to be downloaded in each time slice as S, and setting the data quantity of each remote sensing satellite in the set of S as SiMatrix in units of Mbit, SiThe matrix is initialized data and is determined by the initial data volume to be transmitted of each satellite of the remote sensing constellation;
s503, defining the set of all remote sensing satellites capable of transmitting data underground as D, and setting the total data volume capable of transmitting data underground in the current time slice of each remote sensing satellite in the set D as DjMatrix in units of Mbit, where Dj=TjV. V is the downlink link rate of the satellite to the ground data transmission station, and the unit is Mbps; t isjThe unit of the downloadable time of the remote sensing satellite i to the ground data transmission station in the current time slice is s.
Preferably, the operation of the undirected graph G ═ (V, E) of the two-stage network topology structure configuration is as follows:
s601, constructing an undirected graph G (V, E), wherein V comprises all remote sensing satellite nodes, E comprises edges between each node and each node, the weight of the edge between each node and each node is defaulted to be 1 when an inter-satellite link is available, and the weight of the edge between each node and each node is defaulted to be infinite when the inter-satellite link is interrupted;
s602, traversing the satellite nodes j in the set D, and firstly judging whether j exists in the set S;
s603, if j exists in the set S based on S602, which indicates that the satellite capable of transmitting data underground also has data to transmit, the satellite firstly transmits the data by itself, and the actual underground transmission data measurement S in the time slice is obtainediAnd DjUpdating the matrix formed by the S set and the matrix formed by the D set;
s604, based on the S602, if j does not exist in the set S, circularly traversing the satellite node i in the set S, taking the node i as an information source and the node j as an information sink, and finding out a path with the minimum weight by using a shortest path first algorithm (G, i, j), wherein the path is the shortest path;
s605, if the shortest path exists, the node j sets the amount of the underground transmission data for the node i to min (S)i, DjT 100) where t is the time slice length and passes through the data volume S to be downloadedi=SiIteration of the downloaded data volume and the downloadable data volume Dj=Dj-iteration of downloading data volume, updating the matrix formed by the S set and the matrix formed by the D set, and deleting the path in the network topology map, updating undirected graph G ═ V, E;
s606, based on the undirected graph G updated in S605 being (V, E), the next loop is performed until the data amount D of the node j reachesjWhen 0, the loop ends.
Compared with the prior art, the invention has the beneficial effects that: the invention obviously improves the underground transmission capability of the whole remote sensing constellation data through reasonable topological network structure design and based on the remote sensing constellation routing algorithm of the inter-satellite link.
Drawings
FIG. 1 is a schematic diagram of a planar distribution structure of a walker constellation remote sensing satellite according to the present invention;
FIG. 2 is a schematic diagram of a matlab simulation routing result of the present invention;
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Examples
Referring to fig. 1-2, the present invention provides a technical solution: the remote sensing constellation routing algorithm based on the inter-satellite link comprises the following steps:
s1, constructing a walker constellation satellite remote sensing system, and simultaneously establishing an inter-satellite link and a satellite-ground link;
s2, generating a primary mesh topological structure along the longitude and latitude direction of the intersatellite link constructed based on S1;
s3, selecting an area, and determining a ground data transmission station which can cover the whole area in the area;
s4, constructing a secondary mesh topological structure based on the remote sensing satellite of S1 and the ground transmission station of S3, and time slicing the secondary mesh topological structure;
s5, routing in each time slice;
and S6, constructing an undirected graph G (V, E) based on the S5 pair of two-level mesh topology, wherein V comprises all remote sensing satellite nodes, and E comprises each node and edges between the nodes.
Specifically, the specific construction steps of the walker constellation satellite remote sensing system are as follows:
s101, presetting that the height of a track is 562.22km, the inclination angle of the track is 97.65 degrees, constructing 9 track surfaces, and respectively setting the ascension angles of the ascending intersections to be 0 degree, 24 degrees, 48 degrees, 72 degrees, 96 degrees, 120 degrees, 144 degrees, 168 degrees and 192 degrees;
s102, 8 remote sensing satellites are uniformly distributed on each orbital plane, Sar satellites and optical satellites are distributed in a crossed mode, and the phase difference of the satellites at the same position of adjacent orbital planes is 5 degrees;
s103, each satellite is provided with four inter-satellite link antennas and one satellite-ground link antenna:
establishing inter-satellite connection between four adjacent satellites based on an inter-satellite link antenna, wherein the four adjacent satellites are respectively two satellites before and after the same orbit and two satellites on the left and right of the different orbit;
and establishing satellite-ground connection between the corresponding satellite and the ground data transmission station based on the satellite-ground link antenna.
Specifically, the first-level mesh topology structure comprises the following specific steps:
s201, stability of relative positions and relative angles can be kept among satellites based on the same orbit, and then inter-satellite links are kept for a long time;
s202, the relative angle, the relative speed and the relative distance among the satellites based on the different orbits are in a continuous change state, so that when the satellites run to a high-altitude area, inter-satellite links are interrupted;
s203, a primary mesh topology structure is formed based on the mutual combination of S201 and S202.
Specifically, the specific steps selected by the ground data transmission station are as follows:
s301, carrying out simulation calculation based on the STK, and acquiring the rail passing opportunity distribution of the data transmission station in the area;
and S302, selecting two ground data transmission stations with the most opportunities based on the rail passing opportunity distribution of the ground data transmission stations obtained in the S301, and realizing the coverage rate of the selected area.
Specifically, the specific steps of the secondary mesh topology and its time slicing are as follows:
s401, forming a secondary network topological structure based on the 72 remote sensing satellites in the S1 and the two ground data transmission stations in the S3;
s402, constructing time slices, and dividing the change period of the secondary network topology structure;
s403, acquiring an inter-satellite link connection state and a satellite-to-ground link connection state in a secondary network topology structure in each time slice;
s404, dividing a two-stage network topological structure in each time slice into a relatively stable part and a variable part, wherein the relatively stable part is an inter-satellite link and a satellite-ground link in the same orbit, and the variable part is an inter-satellite link in different orbits.
Specifically, the routing in each time slice includes:
s501, obtaining and determining a secondary network topological structure in any time slice in S4, and setting the same output cost of each hop of an intra-rail link, an inter-rail link and a satellite-to-ground link;
s502, defining the set of all remote sensing satellites with data to be downloaded in each time slice as S, and setting the data quantity of each remote sensing satellite in the set of S as SiMatrix in units of Mbit, SiThe matrix is initialized data and is determined by the initial data volume to be transmitted of each satellite of the remote sensing constellation;
s503, defining the set of all remote sensing satellites capable of transmitting data underground as D, and setting the total data volume capable of transmitting data underground in the current time slice of each remote sensing satellite in the set D as DjMatrix in units of Mbit, where Dj=TjV. V is the downlink link rate of the satellite to the ground data transmission station, and the unit is Mbps; t isjThe unit of the downloadable time of the remote sensing satellite i to the ground data transmission station in the current time slice is s.
Specifically, the working steps of the undirected graph G ═ V, E of the two-level network topology construction are as follows:
s601, constructing an undirected graph G (V, E), wherein V comprises all remote sensing satellite nodes, E comprises edges between each node and each node, the weight of the edge between each node and each node is defaulted to be 1 when an inter-satellite link is available, and the weight of the edge between each node and each node is defaulted to be infinite when the inter-satellite link is interrupted;
s602, traversing the satellite nodes j in the set D, and firstly judging whether j exists in the set S;
s603, if j exists in the set S based on S602, which indicates that the satellite capable of transmitting data underground also has data to transmit, the satellite firstly transmits the data by itself, and the actual underground transmission data measurement S in the time slice is obtainediAnd DjThe minimum value of (a) is determined,updating a matrix formed by the S set and a matrix formed by the D set;
s604, based on the S602, if j does not exist in the set S, circularly traversing the satellite node i in the set S, taking the node i as an information source and the node j as an information sink, and finding out a path with the minimum weight by using a shortest path first algorithm (G, i, j), wherein the path is the shortest path;
s605, if the shortest path exists, the node j sets the amount of the underground transmission data for the node i to min (S)i, DjT 100) where t is the time slice length and passes through the data volume S to be downloadedi=SiIteration of the downloaded data volume and the downloadable data volume Dj=Dj-iteration of downloading data volume, updating the matrix formed by the S set and the matrix formed by the D set, and deleting the path in the network topology map, updating undirected graph G ═ V, E;
s606, based on the undirected graph G updated in S605 being (V, E), the next loop is performed until the data amount D of the node j reachesjWhen 0, the loop ends.
In the description of the present invention, unless otherwise expressly specified or limited, the terms "mounted," "connected," and "fixed" are to be construed broadly, e.g., as meaning either a fixed connection, a removable connection, or an integral part; can be mechanically or electrically connected; either directly or indirectly through intervening media, either internally or in any other relationship. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
The standard parts used in the invention can be purchased from the market, the special-shaped parts can be customized according to the description of the specification and the accompanying drawings, the specific connection mode of each part adopts conventional means such as mature bolts, rivets, welding and the like in the prior art, the machines, the parts and equipment adopt conventional models in the prior art, and the circuit connection adopts the conventional connection mode in the prior art, so that the detailed description is omitted.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (7)
1. The remote sensing constellation routing algorithm based on the inter-satellite link is characterized by comprising the following steps:
s1, constructing a walker constellation satellite remote sensing system, and simultaneously establishing an inter-satellite link and a satellite-ground link;
s2, generating a primary mesh topological structure along the longitude and latitude direction of the intersatellite link constructed based on S1;
s3, selecting an area, and determining a ground data transmission station which can cover the whole area in the area;
s4, constructing a secondary mesh topological structure based on the remote sensing satellite of S1 and the ground transmission station of S3, and time slicing the secondary mesh topological structure;
s5, routing in each time slice;
and S6, constructing an undirected graph G (V, E) based on the S5 pair of two-level mesh topology, wherein V comprises all remote sensing satellite nodes, and E comprises each node and edges between the nodes.
2. The remote sensing constellation routing algorithm based on inter-satellite links of claim 1, wherein: the specific construction steps of the walker constellation satellite remote sensing system are as follows:
s101, presetting that the height of a track is 562.22km, the inclination angle of the track is 97.65 degrees, constructing 9 track surfaces, and respectively setting the ascension angles of the ascending intersections to be 0 degree, 24 degrees, 48 degrees, 72 degrees, 96 degrees, 120 degrees, 144 degrees, 168 degrees and 192 degrees;
s102, 8 remote sensing satellites are uniformly distributed on each orbital plane, Sar satellites and optical satellites are distributed in a crossed mode, and the phase difference of the satellites at the same position of adjacent orbital planes is 5 degrees;
s103, each satellite is provided with four inter-satellite link antennas and one satellite-ground link antenna:
establishing inter-satellite connection between four adjacent satellites based on an inter-satellite link antenna, wherein the four adjacent satellites are respectively two satellites before and after the same orbit and two satellites on the left and right of the different orbit;
and establishing satellite-ground connection between the corresponding satellite and the ground data transmission station based on the satellite-ground link antenna.
3. The remote sensing constellation routing algorithm based on inter-satellite links of claim 1, wherein: the specific steps of the primary mesh topology structure are as follows:
s201, stability of relative positions and relative angles can be kept among satellites based on the same orbit, and then inter-satellite links are kept for a long time;
s202, the relative angle, the relative speed and the relative distance among the satellites based on the different orbits are in a continuous change state, so that when the satellites run to a high-altitude area, inter-satellite links are interrupted;
s203, a primary mesh topology structure is formed based on the mutual combination of S201 and S202.
4. The remote sensing constellation routing algorithm based on inter-satellite links of claim 1, wherein: the specific steps of the selection of the ground data transmission station are as follows:
s301, carrying out simulation calculation based on the STK, and acquiring the rail passing opportunity distribution of the data transmission station in the area;
and S302, selecting two ground data transmission stations with the most opportunities based on the rail passing opportunity distribution of the ground data transmission stations obtained in the S301, and realizing the coverage rate of the selected area.
5. The remote sensing constellation routing algorithm based on inter-satellite links of claim 1, wherein: the specific steps of the two-stage mesh topology and the time slicing thereof are as follows:
s401, forming a secondary network topological structure based on the 72 remote sensing satellites in the S1 and the two ground data transmission stations in the S3;
s402, constructing time slices, and dividing the change period of the secondary network topology structure;
s403, acquiring an inter-satellite link connection state and a satellite-to-ground link connection state in a secondary network topology structure in each time slice;
s404, dividing a two-stage network topological structure in each time slice into a relatively stable part and a variable part, wherein the relatively stable part is an inter-satellite link and a satellite-ground link in the same orbit, and the variable part is an inter-satellite link in different orbits.
6. The remote sensing constellation routing algorithm based on inter-satellite links of claim 1, wherein: the operation steps of routing in each time slice are as follows:
s501, obtaining and determining a secondary network topological structure in any time slice in S4, and setting the same output cost of each hop of an intra-rail link, an inter-rail link and a satellite-to-ground link;
s502, defining the set of all remote sensing satellites with data to be downloaded in each time slice as S, and setting the data quantity of each remote sensing satellite in the set of S as SiMatrix in units of Mbit, SiThe matrix is initialized data and is determined by the initial data volume to be transmitted of each satellite of the remote sensing constellation;
s503, defining the set of all remote sensing satellites capable of transmitting data underground as D, and setting the total data volume capable of transmitting data underground in the current time slice of each remote sensing satellite in the set D as DjMatrix in units of Mbit, where Dj=TjV is the downlink link rate of the satellite to the ground data transmission station, and the unit is Mbps; t isjThe unit of the downloadable time of the remote sensing satellite i to the ground data transmission station in the current time slice is s.
7. The remote sensing constellation routing algorithm based on inter-satellite links of claim 1, wherein: the working steps of the undirected graph G ═ V, E of the two-level network topology structure construction are as follows:
s601, constructing an undirected graph G (V, E), wherein V comprises all remote sensing satellite nodes, E comprises edges between each node and each node, the weight of the edge between each node and each node is defaulted to be 1 when an inter-satellite link is available, and the weight of the edge between each node and each node is defaulted to be infinite when the inter-satellite link is interrupted;
s602, traversing the satellite nodes j in the set D, and firstly judging whether j exists in the set S;
s603, if j exists in the set S based on S602, which indicates that the satellite capable of transmitting data underground also has data to transmit, the satellite firstly transmits the data by itself, and the actual underground transmission data measurement S in the time slice is obtainediAnd DjUpdating the matrix formed by the S set and the matrix formed by the D set;
s604, based on the S602, if j does not exist in the set S, circularly traversing the satellite node i in the set S, taking the node i as an information source and the node j as an information sink, and finding out a path with the minimum weight by using a shortest path first algorithm (G, i, j), wherein the path is the shortest path;
s605, if the shortest path exists, the node j sets the amount of the underground transmission data for the node i to min (S)i,DjT 100) where t is the time slice length and passes through the data volume S to be downloadedi=SiIteration of the downloaded data volume and the downloadable data volume Dj=Dj-iteration of downloading data volume, updating the matrix formed by the S set and the matrix formed by the D set, and deleting the path in the network topology map, updating undirected graph G ═ V, E;
s606, based on the undirected graph G updated in S605 being (V, E), the next loop is performed until the data amount D of the node j reachesjWhen 0, the loop ends.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110941636.6A CN113765575B (en) | 2021-08-17 | 2021-08-17 | Remote sensing constellation routing method based on inter-satellite link |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110941636.6A CN113765575B (en) | 2021-08-17 | 2021-08-17 | Remote sensing constellation routing method based on inter-satellite link |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113765575A true CN113765575A (en) | 2021-12-07 |
CN113765575B CN113765575B (en) | 2023-06-23 |
Family
ID=78789955
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110941636.6A Active CN113765575B (en) | 2021-08-17 | 2021-08-17 | Remote sensing constellation routing method based on inter-satellite link |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113765575B (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114039903A (en) * | 2021-12-23 | 2022-02-11 | 太原理工大学 | Software-defined satellite-ground converged network inter-domain routing method based on request domain |
CN114422370A (en) * | 2021-12-22 | 2022-04-29 | 上海交通大学 | Time slice-based network topology construction method and system of LEO satellite constellation |
CN115396001A (en) * | 2022-04-18 | 2022-11-25 | 航天科工海鹰集团有限公司 | Instant remote sensing satellite constellation configuration design based on laser inter-satellite chain |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120263042A1 (en) * | 2010-10-04 | 2012-10-18 | Telcordia Technologies, Inc. | Method and system for determination of routes in leo satellite networks with bandwidth and priority awareness and adaptive rerouting |
CN104835011A (en) * | 2015-05-13 | 2015-08-12 | 中国西安卫星测控中心 | Navigational constellation slow varying inter-satellite link planning method based on earth station layout constraints |
CN106656302A (en) * | 2016-09-22 | 2017-05-10 | 南京理工大学 | Distributed node self-adaptive routing algorithm for LEO satellite network |
CN110881198A (en) * | 2019-12-06 | 2020-03-13 | 上海交通大学 | Link allocation method based on competition decision idea in deep space network |
CN111953512A (en) * | 2020-07-02 | 2020-11-17 | 西安电子科技大学 | Construction method, system and application of Mobius constellation topology configuration facing Walker constellation |
CN112580906A (en) * | 2019-09-27 | 2021-03-30 | 陕西星邑空间技术有限公司 | Satellite remote sensing task planning and ground resource scheduling combined solving method |
-
2021
- 2021-08-17 CN CN202110941636.6A patent/CN113765575B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120263042A1 (en) * | 2010-10-04 | 2012-10-18 | Telcordia Technologies, Inc. | Method and system for determination of routes in leo satellite networks with bandwidth and priority awareness and adaptive rerouting |
CN104835011A (en) * | 2015-05-13 | 2015-08-12 | 中国西安卫星测控中心 | Navigational constellation slow varying inter-satellite link planning method based on earth station layout constraints |
CN106656302A (en) * | 2016-09-22 | 2017-05-10 | 南京理工大学 | Distributed node self-adaptive routing algorithm for LEO satellite network |
CN112580906A (en) * | 2019-09-27 | 2021-03-30 | 陕西星邑空间技术有限公司 | Satellite remote sensing task planning and ground resource scheduling combined solving method |
CN110881198A (en) * | 2019-12-06 | 2020-03-13 | 上海交通大学 | Link allocation method based on competition decision idea in deep space network |
CN111953512A (en) * | 2020-07-02 | 2020-11-17 | 西安电子科技大学 | Construction method, system and application of Mobius constellation topology configuration facing Walker constellation |
Non-Patent Citations (1)
Title |
---|
史良树 等: "应用近似算法的光学遥感卫星区域目标成像任务规划方法", 《航天器工程》 * |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114422370A (en) * | 2021-12-22 | 2022-04-29 | 上海交通大学 | Time slice-based network topology construction method and system of LEO satellite constellation |
CN114039903A (en) * | 2021-12-23 | 2022-02-11 | 太原理工大学 | Software-defined satellite-ground converged network inter-domain routing method based on request domain |
CN114039903B (en) * | 2021-12-23 | 2023-02-14 | 太原理工大学 | Software-defined satellite-ground converged network inter-domain routing method based on request domain |
CN115396001A (en) * | 2022-04-18 | 2022-11-25 | 航天科工海鹰集团有限公司 | Instant remote sensing satellite constellation configuration design based on laser inter-satellite chain |
CN115396001B (en) * | 2022-04-18 | 2024-01-19 | 航天科工海鹰集团有限公司 | Immediate remote sensing satellite constellation configuration design method based on laser inter-satellite chain |
Also Published As
Publication number | Publication date |
---|---|
CN113765575B (en) | 2023-06-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN113765575A (en) | Remote sensing constellation routing algorithm based on inter-satellite link | |
US10827414B2 (en) | Global communication network | |
Zhou et al. | Aerospace integrated networks innovation for empowering 6G: A survey and future challenges | |
CN110545137B (en) | Communication system and method thereof | |
CN113783600B (en) | Giant low-orbit internet constellation routing method | |
Jia et al. | Routing algorithm with virtual topology toward to huge numbers of LEO mobile satellite network based on SDN | |
CN106792961A (en) | A kind of double-deck topology method based on satellite communication network design | |
BR112014016941B1 (en) | BALLOON NETWORK SYSTEMS WITH FREE SPACE OPTICAL COMMUNICATION BETWEEN SUPERNODE BALLOONS AND RF COMMUNICATION BETWEEN SUPERNODE AND SUBNODE BALLOONS | |
Chen et al. | Multiple gateway placement in large‐scale constellation networks with inter‐satellite links | |
CN103684576B (en) | A kind of data high-speed communication means based on moonlet cluster ad-hoc network | |
CN107294593A (en) | Deep space downlink multi-hop transmission method and system based on GEO backbone's relayings | |
CN103686810A (en) | Satellite network neighbor detection method | |
Wang et al. | Fine-grained resource management for edge computing satellite networks | |
CN114158106A (en) | Distributed routing method, device and storage medium for satellite network | |
Wang et al. | A joint and dynamic routing approach to connected vehicles via LEO constellation satellite networks | |
Dakic et al. | On Delay Performance in Mega Satellite Networks with Inter-Satellite Links | |
CN113411858B (en) | Inter-satellite routing method for high-medium-low orbit hybrid networking and computer readable storage medium | |
US20220052758A1 (en) | Hybrid communication | |
Zhang et al. | Hybrid GEO and IGSO satellite constellation design with ground supporting constraint for space information networks | |
CN104835011B (en) | The gradual inter-satellite link planing method of navigation constellation based on earth station's layout constraint | |
RU2787215C1 (en) | Method for routing delay-critical information flows in a fully connected satellite communication network on non-geostationary space vehicles located in homogeneous circular orbits | |
CN117040607B (en) | Design method of low-orbit communication satellite constellation | |
Wang et al. | A simple three-dimensional matrix method for global constellation intrasatellite link topological design | |
Giordana et al. | Autonomous routing for satellites communication networks | |
CN104835011A (en) | Navigational constellation slow varying inter-satellite link planning method based on earth station layout constraints |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |