CN113422636A - On-satellite routing optimization method - Google Patents
On-satellite routing optimization method Download PDFInfo
- Publication number
- CN113422636A CN113422636A CN202110679865.5A CN202110679865A CN113422636A CN 113422636 A CN113422636 A CN 113422636A CN 202110679865 A CN202110679865 A CN 202110679865A CN 113422636 A CN113422636 A CN 113422636A
- Authority
- CN
- China
- Prior art keywords
- satellite
- leo
- geo
- network
- node
- 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.)
- Pending
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/18578—Satellite systems for providing broadband data service to individual earth stations
-
- 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/18578—Satellite systems for providing broadband data service to individual earth stations
- H04B7/18582—Arrangements for data linking, i.e. for data framing, for error recovery, for multiple access
-
- 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/18578—Satellite systems for providing broadband data service to individual earth stations
- H04B7/18584—Arrangements for data networking, i.e. for data packet routing, for congestion control
Abstract
The embodiment of the invention provides a satellite routing optimization method, which firstly provides a virtual node and a grouping management strategy for a designed GEO/LEO satellite constellation model covering the whole world so as to reduce the complexity of a satellite routing algorithm. An allocation mechanism is proposed for allocating different load links for different priority routing traffic. And (3) taking the transmission delay, the queuing delay and the satellite node link load as weight factors, reordering k shortest routes calculated by a Dijkstra algorithm according to the weight from low to high, excluding routes without continuous available wavelengths, selecting the route with the top ranking as the optimal path, and allocating an available resource by using a first method. And if no available wavelength resource exists in the k routes, optimizing by using an ant colony algorithm, introducing the transmission delay, the queuing delay and the satellite node link load into a target function of the ant colony algorithm, and selecting a next node according to a node probability function to complete the calculation of the network route standby path.
Description
Technical Field
The invention relates to the technical field of satellite communication, in particular to a route optimization method on a satellite.
Technical Field
With the progress and development of science and technology, people have higher and higher demands on networks, and satellite communication networks are more and more important and become important means and forms essential for communication. With the advance of the construction of the space-ground integrated information network, the requirements on information transmission rate, satellite node storage capacity, satellite coverage and security of satellite communication are increasingly improved, and the traditional microwave communication mode is limited by bandwidth, rate and the like, so that the requirements on ultra-wide bandwidth, ultra-high rate and ultra-high capacity communication of the space-ground integrated information network of broadband multimedia services and the like are difficult to meet. Therefore, the research of the broadband satellite communication system based on the laser/microwave has important practical significance.
Routing algorithm is a key technology for determining the performance of the satellite communication network, and the routing algorithm is to find a path which meets the network requirement in the network. Compared with a ground communication network, satellite communication has the characteristics of calculation and storage space and high dynamic topology, network congestion can be caused by local hot spots in the satellite communication network, and because the satellite faults are extremely difficult to repair and the topology of the satellite network, the existing ground communication network routing algorithm is not suitable for satellite communication, and the research on the satellite communication network routing algorithm is required on the basis of the ground communication network routing algorithm, so the satellite routing algorithm gradually becomes the research direction of scholars at home and abroad along with the development of the satellite network.
At present, a multilayer satellite network structure gradually replaces a single-layer satellite network structure, and after the rapid development of recent decades, a satellite mobile communication system has played an increasingly important role in various aspects such as personal mobile communication, global coverage communication, national security and the like, and along with diversity and complexity of services, a multilayer communication network formed by combining satellites with different orbital heights gradually becomes a mainstream trend of future satellite network development. Multi-layer satellite networks (MLSNs) tend to be a promising architecture to facilitate broadband communications worldwide. The three-dimensional double-layer satellite constellation communication network can take advantages of satellites with different orbits into account, can be flexibly networked, and has relatively strong survivability.
Handling network mobility in highly dynamic low earth orbit satellite networks is a key issue for achieving seamless and efficient integration of satellite and terrestrial networks. Virtual Node (VN) methods are widely used to handle the topology dynamics of satellite networks. In a geostationary earth satellite system, this task can be simplified by representing the network using a static virtual topology.
Multipath routing is an effective method for improving end-to-end reliability, but the current multipath routing strategy has the problems of link loss between satellites, higher end-to-end delay and the like due to frequent flooding of current multipath routing requests. The ant colony algorithm is increasingly researched for solving the network routing problem, and most researches aim to reduce the blocking rate, reduce the time delay and improve the convergence speed so as to improve the network performance.
Disclosure of Invention
The embodiment of the invention aims to provide a satellite route optimization method so as to realize continuous full coverage of a network on the earth and reduce the blocking rate of the network. The specific technical scheme is as follows:
in one aspect of the present invention, a GEO/LEO dual-layer satellite network model is provided, where the network model includes: based on a GEO/LEO double-layer satellite constellation network model, based on a virtual node strategy of a GEO/LEO double-layer constellation network and based on a hierarchical grouping management strategy of virtual nodes of the constellation network,
the GEO/LEO-based double-layer satellite constellation network model is composed of 4 GEO satellites and 100 LEO satellites, wherein the GEO satellites are used for forming a backbone network, covering low-latitude and medium-latitude areas on the earth, calculating routes, collecting state information of LEO satellites and satellite links, monitoring states of satellite nodes, managing LEO satellite groups and sharing LEO satellite services if necessary; and the LEO satellite is used for accessing the ground station and the ground user terminal, transmitting and forwarding data and acquiring satellite link state information.
The GEO/LEO double-layer constellation is adopted in the text because GEO satellites have the advantages of large coverage area, long communication distance, strong on-satellite processing capacity, simple network topology structure, static state relative to the earth surface and the like, while LEO satellites have the advantages of small propagation delay, low error rate, capability of covering polar regions and the like, and are beneficial to avoiding the defects that GEO satellites cannot cover polar regions, the on-satellite processing capacity of LEO satellites is weak and the like.
The virtual node strategy based on the GEO/LEO double-layer constellation network provides a virtual node strategy based on the double-layer constellation network on the basis of a GEO/LEO double-layer network model, and designs a grouping management strategy based on the virtual node on the basis of the virtual node strategy.
The method utilizes the virtual nodes and the layered grouping management method to shield the rapid movement of the satellite nodes in the satellite network, thereby reducing the complexity of the on-satellite routing algorithm and designing the GEO/LEO double-layer constellation network architecture based on the virtual nodes.
The system shields the rapid movement of the satellite nodes in the satellite network by using a virtual node and a layered grouping management method, thereby reducing the complexity of the on-satellite routing algorithm.
Handling network mobility in highly dynamic low earth orbit satellite networks is a key issue for achieving seamless and efficient integration of satellite and terrestrial networks. Virtual Node (VN) methods are widely used to handle the topology dynamics of satellite networks. In a geostationary earth satellite system, this task can be simplified by representing the network using a static virtual topology.
Virtual node strategies essentially divide the earth's surface into several regions. Each region is assigned a logical address according to a certain rule. For a simple and regular satellite network, the strategy can shield the mobility of the satellite, and only a fixed logic area is considered instead of a mobile satellite node. When the satellite arrives in the area, it occupies a logical address. However, this approach requires a very regular network topology, which is more suitable for LEO single-layer satellite networks.
Due to the complex topology change of the satellite network, the traditional routing scheme cannot be directly applied to the satellite communication network. The on-satellite routing algorithm has become a difficult problem to be solved in a satellite network, and the key is how to process time-varying topology, and satellite grouping and grouping management strategies are widely researched in a multilayer satellite network.
A virtual node strategy and a grouping management strategy are adopted by a GEO/LEO-oriented double-layer constellation network model, the coverage area of each low-orbit satellite is correspondingly changed into a virtual node in a satellite network, and the virtual node strategy is applied to an LEO layer of the GEO/LEO double-layer constellation satellite communication network.
The coverage area of a low orbit satellite is defined as a virtual node that can communicate directly with the LEO satellite at a given time. A set of coverage areas is made up of the coverage of all satellites at a given time. Abstracting the earth surface into a series of logic numbers according to the coverage area of a satellite at the initial time of a GEO/LEO double-layer constellation network, wherein each logic number corresponds to an area covered by the satellite and also corresponds to the satellite; the satellite moves at any moment, but the area corresponding to each abstracted logic number does not change, which means that the satellite corresponding to each abstracted number changes; each abstracted number is a virtual node, which is referred to herein as a virtual node based on the GEO/LEO bi-level constellation network. The number of a node is the number of the satellite coverage area on the earth surface, and the virtual node represented by the logical number corresponds to one satellite node at any time.
When the satellite link is switched due to movement of the satellite node in the communication process, information such as a routing table, a satellite number, a link state, a channel allocation table and the like of the virtual node is handed over to the satellite node corresponding to the virtual node at present, and at the moment, the satellite network is abstracted into a virtual communication network with a relatively fixed topological structure, so that the influence of the rapid movement of the satellite node in the satellite network on the satellite network is avoided, the influence of the switching of the satellite link on the satellite network can be shielded, and the complexity of the satellite network is greatly reduced.
The above illustrates how the position and movement between actual physical satellite nodes occurring in the satellite network is avoided in this way.
According to the hierarchical grouping management strategy based on the constellation network virtual nodes, in the GEO/LEO satellite network architecture provided by the invention, satellites at a GEO layer and a LEO layer have different specific functions and tasks.
The satellites in the GEO/LEO satellite network are managed by dividing them into several groups, and the two-layer satellite network management is realized by setting groups in a two-layer satellite constellation and selecting corresponding group leader and group manager.
The GEO satellite corresponds to a virtual node. The nature of the members of the group is virtual nodes, and geosynchronous orbit satellites are stationary with respect to the ground. Therefore, the virtual nodes corresponding to any GEO satellite and all LEO satellite members within its group remain relatively unchanged at any point in time, i.e., any virtual node and group administrator GEO satellite remain relatively stationary at any point in time. The group administrator GEO satellite and the group member LEO satellite are uniquely determined at any point in time
The inter-satellite links established between the GEO satellite and all the low-orbit satellites can cause the network connection relationship to be too complex, and the complexity of the inter-satellite links can be effectively reduced by communicating the group leader with the GEO satellite.
Because the LEO satellite over the polar region can not be covered by the GEO satellite in the network, the administrator GEO satellite of its grouping can not manage it directly, must manage indirectly through other LEO satellites, the concrete thought is: firstly, determining an orbit plane of an LEO satellite over the polar region, then finding an LEO satellite with a lower latitude and within the coverage range of the GEO satellite in the same plane, and finally establishing connection with a group manager through the LEO satellite over the polar region serving as a bridge.
In another aspect of the present invention, an on-satellite route optimization algorithm is further provided, where the algorithm includes:
the link information of the low orbit satellite is collected by utilizing a speaking mechanism, the link is divided into a no-load state, a slight load state, a medium load state and a heavy load state according to the link load, various services exist in the network, the requirements of different services on time delay are different, and the high priority and the low priority are divided according to the difference of the service requirements on the time delay in the network.
Setting a load-based self-adaptive low-orbit satellite link distribution mechanism according to different service priorities, only considering links in the states of no load, light load and medium load to participate in route calculation during low-priority transmission, and allowing links in all load states to participate in route calculation during high-priority service transmission; links between the high-orbit satellite and the low-orbit satellite can be allocated to two different priority services, and then k shortest paths are calculated in the allocated links by utilizing a Dijkstra algorithm; and adding the transmission delay, the queuing delay and the satellite node link load as weight factors into the calculated routes, carrying out comprehensive evaluation on the calculated k routes, excluding the routes without continuous available wavelengths, reordering the k routes from low to high according to the evaluated weight, selecting the route with the top order as an optimal path, and finally distributing an available resource by using a firstfit method.
And then, optimizing the ant colony algorithm, adding the transmission delay, the queuing delay and the satellite node link load into the link state, comprehensively evaluating the link state, introducing the link state into an objective function of the ant colony algorithm instead of only considering single distance or hop count, and selecting a proper node as a next node according to a node probability function to finish the calculation of the network route. And calculating a standby path by using the ant colony algorithm, and using the standby path when no usable wavelength exists in the k paths calculated by the Dijkstra algorithm.
The ant colony optimization algorithm process: the algorithm needs to maintain a global link state Lcost table and a network routing path table. Each cost stored in the LcOST table in the initial stateijRepresenting the size of the link state from virtual node i to virtual node j, i.e. cost in the initial stateijCost with a value equal to the link state evaluation functionL. Path in path tableijRepresenting the path that needs to be traversed from virtual node i to virtual node j. During specific calculation, all the positions where no real link exists in the Lcost table are set to be in an open circuit state, namely costLAnd (3) the value is infinite, then each virtual node k in the global link state LcOSt table is sequentially selected to transfer any virtual node i: cost if not transferringijGreater than cost of transitik+costkjThen, the original cost is usedijUpdate to Costik+costkjAnd k is added to the path at the same timeijIn the stored array, the path which is originally required to pass from the virtual node i to the virtual node j is changed into the path which is required to pass from the virtual node i to the virtual node k, and then is required to pass from the virtual node k to the virtual node j. The path stored in the path table after the algorithm execution is finishedijThe array is the best path from virtual node i to virtual node j, and the best path isiiCost on the corresponding pathLThe sum is the cost of the Lcost table after the optimization update at this timeii。
When a path is selected, if a key link and a key node frequently and repeatedly appear, the link or the node is blocked, so that the performance of the network is reduced, therefore, in order to avoid the repeated appearance of the key link and the key node in a plurality of paths, certain measures need to be taken when the routing calculation is carried out:
the first step is as follows: calculating the optimal path of the network T by using the ant colony algorithm after optimization according to V (T) and E (T)
The second step is that: under the principle of link disjointness, namely links used in the first step are excluded in E (T), the path is calculated as a suboptimal path by utilizing the ant colony algorithm after optimization
The third step: after excluding the links in the best path and the sub-best path, the shortest (minimum number of hops) path to the GEO satellite node is calculated using Dijkstra's algorithm.
According to the multi-path-based block avoidance algorithm, the route design can only plan a path, the satellite communication user services are not distributed uniformly in time and space, so that the flow fluctuation of the satellite uploaded from the ground is large, if congestion control does not exist, a local network is easy to generate congestion, the network cannot respond to the services in real time, and the stability of the network can be ensured, the error rate of the network can be reduced, and the network delay can be reduced by using a block avoidance strategy.
Therefore, on the basis of a multi-path routing strategy, a multi-path-based blocking avoidance routing algorithm is provided, in the algorithm, a link blocking avoidance strategy is provided, and whether a satellite and an exit link thereof are in an overload state or not is judged by adopting the cache utilization rate of a satellite node and the utilization rate of a satellite link.
And the GEO satellite nodes count all the blocked nodes and links, and the paths are calculated after the blocked nodes and links are eliminated. Calculating a second path, and when no node or link is blocked, adopting a link disjointness principle, namely excluding previous links before calculating the second path; if there is node or link congestion, a node disjoint principle may be adopted, that is, a node related to the congested node or congested link needs to be excluded before calculating the second path.
And judging whether the satellite and the exit link thereof are in an overload state or not by adopting the combination of the cache utilization rate of the satellite node and the utilization rate of the satellite link. The cache utilization rate judges whether the satellite node is overloaded or not, and the link utilization rate judges whether the satellite link is blocked or not. In the communication process, the algorithm adopts a multi-path strategy and a GEO satellite to timely shunt a high-load link.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a constellation scene diagram for modeling a satellite constellation network by using an STK according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a satellite constellation network structure according to an embodiment of the present invention;
fig. 3 is a specific flowchart of a virtual node policy based on a GEO/LEO bi-level constellation network according to an embodiment of the present invention;
fig. 4 is a flowchart of a hierarchical grouping management policy of a GEO/LEO-based dual-constellation satellite network according to an embodiment of the present invention;
fig. 5 is a flowchart of a multipath routing blocking avoidance algorithm based on a GEO/LEO constellation network according to an embodiment of the present invention, and is also an abstract drawing;
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.
Referring to fig. 1, a scene graph based on a GEO/LEO two-layer satellite network model STK provided by an embodiment of the present invention is shown, where the GEO/LEO two-layer satellite network includes: based on a GEO/LEO double-layer satellite constellation network model, based on a virtual node strategy of the GEO/LEO double-layer constellation network, based on a hierarchical grouping management strategy of the GEO/LEO double-layer constellation satellite network, wherein,
the GEO/LEO-based double-layer satellite constellation network model is composed of 4 GEO satellites and 100 LEO satellites, wherein the GEO satellites are used for forming a backbone network, covering low-latitude and medium-latitude areas on the earth, calculating routes, collecting state information of LEO satellites and satellite links, monitoring states of satellite nodes, managing LEO satellite groups and sharing LEO satellite services if necessary; and the LEO satellite is used for accessing the ground station and the ground user terminal, transmitting and forwarding data and acquiring satellite link state information.
The task requirement of the GEO/LEO double-layer satellite constellation is to provide a good communication environment for a satellite communication network, and in order to meet the communication requirement of the network task, the satellite constellation network needs to consider the coverage range, the coverage duration and other indexes of the constellation. Aiming at the global real-time satellite communication task requirement, the chapter is designed based on a GEO/LEO double-layer satellite constellation network, and the network requirement is as follows:
1) the GEO/LEO double-layer satellite network can continuously cover different latitude and longitude areas of the world in real time;
2) the GEO/LEO double-layer satellite network can continuously cover the Beijing ground station in real time;
3) whenever a GEO satellite is connected with a LEO satellite in a GEO/LEO double-layer satellite network
Analyzing the target of satellite constellation design, providing a GEO/LEO double-layer satellite constellation based on, analyzing the target of global GEO/LEO satellite constellation model design and the parameter design of satellite constellation,
referring to fig. 2, a schematic diagram of a structure of a LEO layer constellation network provided in an embodiment of the present invention is shown, where the satellite constellation network is composed of a certain number of satellite nodes and inter-satellite links.
The microwave and laser integrated link can simultaneously realize two communication modes of microwave and laser through the same antenna, and communication can be carried out between satellites and between the satellites and the ground station through the laser and microwave integrated link. However, since the communication link is power limited, the channel condition of the actual link needs to be evaluated during a certain period of operation to determine whether to establish a laser communication link or a microwave link. By adopting the radio frequency laser mixed link evaluation and automatic switching technology, the availability of the GEO/LEO double-layer satellite constellation network communication link can be improved.
Typically, microwave communication is used between satellites and earth stations because microwave communication has a relatively large communication capacity and microwaves penetrate the ionosphere. And the microwave communication link has high reliability, and microwave communication can be used as a main mode for communication between a satellite and a ground station. However, when the traffic of the ground user is large, the satellite and the ground station can communicate by using laser, so that the requirement of the ground user on the network can be met by ultra-high-speed microwave communication.
In general, the laser communication can realize ultra-high-speed transmission of data between satellites, but under communication environments such as satellite laser link blockage, severe weather, laser link failure caused by atmospheric effect and the like, the laser communication cannot guarantee the communication, and the communication between the satellites must be realized through a microwave link, so that a microwave communication link needs to be additionally established between the satellites so as to reduce the dependence of a satellite communication network on the laser communication, and thus, the high reliability of the network and the uninterrupted communication of the network can be guaranteed.
Referring to fig. 3, a specific flowchart of a virtual node policy based on a GEO/LEO bi-level constellation network provided in an embodiment of the present invention is shown, including:
the specific idea of the virtual node strategy based on the GEO/LEO double-layer constellation network is as follows:
the first step is as follows: dividing the GEO/LEO double-layer constellation network into two layers of GEO and LEO according to different track layers
The second step is that: the method comprises the steps of adopting a virtual node strategy in a GEO layer, dividing the earth surface into four virtual group nodes according to the coverage area of a GEO satellite, wherein each virtual group node corresponds to one GEO satellite
The third step: a virtual node strategy is adopted on an LEO layer, the earth surface is divided into virtual member nodes which correspond to LEO satellites one by one according to the coverage area of the LEO satellites, and each virtual member node corresponds to one LEO satellite
The fourth step: and selecting the virtual node with lower latitude on each track plane as the virtual group leader node of the track plane in which the virtual node is positioned from all the virtual member nodes.
Referring to fig. 4, a flowchart of a hierarchical packet management policy of a GEO/LEO-based dual-layer constellation satellite network according to an embodiment of the present invention is shown, where the flowchart includes:
the specific idea of the grouping management strategy based on the virtual nodes is as follows:
the first step is as follows: grouping and determining a group manager
The second step is that: determining group membership
The third step: determining packet group length
The fourth step: GEO Collection LEO State
Referring to fig. 5, a flowchart of a multipath routing blocking avoidance algorithm for a GEO/LEO constellation network according to an embodiment of the present invention is shown, where the specific execution flow of the algorithm is as follows:
1) collecting all satellite node and link state information in a double-layer constellation network through a speaking mechanism of virtual node grouping at the initial time of the network
2) Calculating an optimal path using an ant colony optimization algorithm based on the collected link state information
3) Under the link disjointness principle, links used in the second step are excluded, and the path is calculated as a suboptimal path by using the ant colony algorithm after optimization
4) After links in the optimal path and the suboptimal path are eliminated, the shortest (minimum hop count) path to the GEO satellite node is calculated by utilizing a Dijkstra algorithm, when the GEO satellite receives service data of LEO satellites in the group, the group where the target satellite node is located is judged according to the grouping information of the LEO satellites in the GEO satellite, then the data is forwarded to the corresponding GEO satellite or the group length of the group, and finally the LEO satellite node in the group selects a proper path for data transmission according to a routing table.
5) After the routing calculation is completed, each GEO satellite decomposes the global routing table into the routing tables of each LEO satellite in the packet managed by the GEO satellite,
6) judging the link state of the satellite node, and then selecting a proper path for data forwarding according to the link state of the satellite
a. If the satellite node link is in a normal load state, all service data select the optimal path
b. If the satellite node link is in a slight overload state, the high-priority service selects the optimal path, and the low-priority service selects the suboptimal path
c. If the satellite node link is in a medium overload state, reducing the proportion of the low-priority queue and increasing the proportion of the high-priority queue; firstly, judging whether a low-priority queue of a satellite node has data to be forwarded or not, if so, forwarding the low-priority data to a GEO satellite firstly
d. If the satellite node link is in a heavy load state, a node blocking state report is reported to the GEO satellite, and the node blocking state report needs to be excluded when the path is recalculated until the path is restored to a normal load state and participates in the routing calculation again.
Claims (5)
1. A method for optimizing a route on a satellite, the method comprising:
1. building a satellite network model, wherein the satellite network model comprises a GEO/LEO double-layer satellite network model;
2. a virtual node strategy of the GEO/LEO double-layer constellation network;
3. a hierarchical grouping management strategy of the constellation network virtual nodes;
4. a block avoidance algorithm based on multipath routing.
2. The algorithm of claim 1, wherein a GEO/LEO two-layer satellite network model is designed, wherein:
the double-layer satellite constellation network model comprises GEO/LEO, and consists of 4 GEO satellites and 100 LEO satellites, wherein the GEO satellites are used for forming a backbone network; the LEO satellite forms an access network for the access of a ground station and a ground user terminal and the transmission and the forwarding of data; and the satellite link of the LEO satellite is used for collecting state information, monitoring the state of the satellite node and managing the LEO satellite group, and the LEO satellite service can be shared if necessary.
3. The algorithm of claim 1, wherein a virtual node policy is characterized by:
the GEO and LEO satellites correspond to a virtual node. The virtual nodes corresponding to any GEO satellite and all LEO satellite members within its group remain relatively unchanged at any point in time, i.e., any virtual node and group administrator GEO satellite remain relatively stationary at any point in time. The group administrator GEO satellite and the group member LEO satellite are uniquely identified at any point in time.
4. The algorithm of claim 1, wherein a hierarchical packet management policy is characterized by:
the satellites in the GEO layer and the LEO layer have different specific functions and tasks, the satellites in the GEO/LEO satellite network are managed by dividing the satellites into a plurality of groups, and the double-layer satellite network management is realized by setting groups in a double-layer satellite constellation and selecting corresponding group leader and group manager.
5. The algorithm of claim 1, wherein an on-board route optimization algorithm comprises:
on the basis of a multi-path routing strategy, a multi-path-based blocking avoidance routing algorithm is provided, in the algorithm, a link blocking avoidance strategy is provided, and whether a satellite and an exit link thereof are in an overload state or not is judged by combining the cache utilization rate of a satellite node and the utilization rate of a satellite link.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110679865.5A CN113422636A (en) | 2021-06-18 | 2021-06-18 | On-satellite routing optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110679865.5A CN113422636A (en) | 2021-06-18 | 2021-06-18 | On-satellite routing optimization method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113422636A true CN113422636A (en) | 2021-09-21 |
Family
ID=77789314
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110679865.5A Pending CN113422636A (en) | 2021-06-18 | 2021-06-18 | On-satellite routing optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113422636A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113301591A (en) * | 2021-05-26 | 2021-08-24 | 中国科学院微小卫星创新研究院 | Inter-satellite network optimization method for global networking observation satellite constellation |
| CN114337781A (en) * | 2021-12-30 | 2022-04-12 | 北京邮电大学 | Satellite routing and spectrum allocation optimization method |
| CN114567907A (en) * | 2022-03-09 | 2022-05-31 | 广东电网有限责任公司 | Resource management method, device and system for cross-domain network |
| CN115801093A (en) * | 2022-10-14 | 2023-03-14 | 西安空间无线电技术研究所 | Path planning method for guaranteeing end-to-end deterministic time delay of satellite network |
Citations (4)
| 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 |
| CN103905306A (en) * | 2014-04-02 | 2014-07-02 | 中国人民解放军西安通信学院 | Route exchange method suitable for GEO/LEO double layered constellation network |
| CN105228209A (en) * | 2015-08-24 | 2016-01-06 | 哈尔滨工业大学 | A kind of distributed GEO/LEO hybrid network method for routing based on dummy node |
| CN112737665A (en) * | 2020-12-25 | 2021-04-30 | 中国人民解放军国防科技大学 | Routing resource control method suitable for double-layer satellite optical network data relay system |
-
2021
- 2021-06-18 CN CN202110679865.5A patent/CN113422636A/en active Pending
Patent Citations (4)
| 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 |
| CN103905306A (en) * | 2014-04-02 | 2014-07-02 | 中国人民解放军西安通信学院 | Route exchange method suitable for GEO/LEO double layered constellation network |
| CN105228209A (en) * | 2015-08-24 | 2016-01-06 | 哈尔滨工业大学 | A kind of distributed GEO/LEO hybrid network method for routing based on dummy node |
| CN112737665A (en) * | 2020-12-25 | 2021-04-30 | 中国人民解放军国防科技大学 | Routing resource control method suitable for double-layer satellite optical network data relay system |
Non-Patent Citations (1)
| Title |
|---|
| 张泰江等: "基于GEO/LEO双层卫星网络的路由算法优化设计", 《计算机工程》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113301591A (en) * | 2021-05-26 | 2021-08-24 | 中国科学院微小卫星创新研究院 | Inter-satellite network optimization method for global networking observation satellite constellation |
| CN113301591B (en) * | 2021-05-26 | 2023-09-15 | 中国科学院微小卫星创新研究院 | Inter-satellite network optimization method for global networking observation satellite constellation |
| CN114337781A (en) * | 2021-12-30 | 2022-04-12 | 北京邮电大学 | Satellite routing and spectrum allocation optimization method |
| CN114337781B (en) * | 2021-12-30 | 2023-04-14 | 北京邮电大学 | Satellite routing and spectrum allocation optimization method |
| CN114567907A (en) * | 2022-03-09 | 2022-05-31 | 广东电网有限责任公司 | Resource management method, device and system for cross-domain network |
| CN114567907B (en) * | 2022-03-09 | 2024-01-30 | 广东电网有限责任公司 | Resource management method, device and system of cross-domain network |
| CN115801093A (en) * | 2022-10-14 | 2023-03-14 | 西安空间无线电技术研究所 | Path planning method for guaranteeing end-to-end deterministic time delay of satellite network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113422636A (en) | On-satellite routing optimization method | |
| CN108551398B (en) | Topology reconstruction method for rapid inter-satellite laser communication networking | |
| CN109257091B (en) | Global load balancing satellite-ground cooperative network networking device and method | |
| Nishiyama et al. | Load balancing and QoS provisioning based on congestion prediction for GEO/LEO hybrid satellite networks | |
| CN106656302B (en) | Distributed node adaptive routing algorithm towards LEO satellite network | |
| Liu et al. | Load-balancing routing algorithm based on segment routing for traffic return in LEO satellite networks | |
| CN104079496B (en) | Double-deck satellite load balancing method based on link cost conversion | |
| CN111294108B (en) | Efficient routing method for orthogonal circular orbit configuration satellite constellation | |
| CN105959232B (en) | A kind of satellite network method for routing based on software defined network control points optimization | |
| CN107453801A (en) | A kind of Layered Multipath method for routing towards satellite network | |
| CN112566142B (en) | QoS guarantee-based LEO satellite network reliability routing method | |
| CN110505153A (en) | A kind of mixed logic dynamic method of Incorporate | |
| CN105471493A (en) | Multi-measure routing method applicable to double-layer satellite network | |
| Deng et al. | An ant colony optimization-based routing algorithm for load balancing in leo satellite networks | |
| Ferreira et al. | Topological design, routing, and handover in satellite networks | |
| CN113055076B (en) | Routing method in LEO/MEO double-layer satellite communication network | |
| CN113315569A (en) | Satellite reliability routing method and system with weighted link survival time | |
| CN104734770B (en) | A kind of distributed group of stars network route method based on context | |
| Xu et al. | Controller placement in software-defined satellite networks | |
| Zhou et al. | Research on hierarchical architecture and routing of satellite constellation with IGSO‐GEO‐MEO network | |
| Ma et al. | Satellite-terrestrial integrated 6G: An ultra-dense LEO networking management architecture | |
| Wang et al. | A load balanced routing algorithm based on congestion prediction for LEO satellite networks | |
| CN106789293B (en) | Spatial information network spatial layer controller election algorithm | |
| Yang et al. | A multi-path routing algorithm based on ant colony optimization in satellite network | |
| CN113259993A (en) | Cross-layer routing method and communication system based on MEO/LEO double-layer satellite network |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210921 |
|
| RJ01 | Rejection of invention patent application after publication |