CN116865843A - System and method for distributing links between satellites of satellite system - Google Patents
System and method for distributing links between satellites of satellite system Download PDFInfo
- Publication number
- CN116865843A CN116865843A CN202311136113.XA CN202311136113A CN116865843A CN 116865843 A CN116865843 A CN 116865843A CN 202311136113 A CN202311136113 A CN 202311136113A CN 116865843 A CN116865843 A CN 116865843A
- Authority
- CN
- China
- Prior art keywords
- satellite
- cost
- communication
- satellites
- link
- 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
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000004891 communication Methods 0.000 claims abstract description 155
- 238000004364 calculation method Methods 0.000 claims abstract description 28
- 238000010586 diagram Methods 0.000 claims abstract description 28
- 230000017260 vegetative to reproductive phase transition of meristem Effects 0.000 claims description 10
- 230000001186 cumulative effect Effects 0.000 claims description 6
- 239000011159 matrix material Substances 0.000 claims description 5
- 238000005457 optimization Methods 0.000 abstract description 14
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000008685 targeting Effects 0.000 description 1
- 239000012905 visible particle Substances 0.000 description 1
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/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
- 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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Radio Relay Systems (AREA)
Abstract
The application relates to the technical field of satellite communication, and provides a system and a method for distributing links between satellites of a satellite system, wherein the system comprises the following steps: a cost calculation module; a minimum matching module; the cost calculation module is used for calculating the communication cost between satellites in the satellite system and the registration cost for establishing a communication link between the satellites, and determining the total cost of each satellite according to the communication cost and the registration cost; the minimum matching module is used for establishing a satellite communication diagram by taking each satellite in the satellite system as a node, a communication link between each satellite as an edge, and total cost as weight of the edge, and determining optimal link allocation of the satellite system based on a matching path with the minimum weight in the satellite communication diagram. The application abstracts the inter-satellite link allocation problem into the general graph matching problem in graph theory, and utilizes the cost and the satellite as nodes and edge weights in the graph and takes the minimum cost path as an allocation optimization strategy, thereby improving the operation and optimization efficiency of the satellite communication system.
Description
Technical Field
The application relates to the technical field of satellite communication, in particular to a system and a method for distributing links between satellites of a satellite system.
Background
With the increasing demands of broadband communication, wireless communication and global communication, satellite communication systems are becoming an important field as a communication method with wide area coverage and high bandwidth. However, satellite communication systems suffer from problems such as limited bandwidth resources, high transmission delays, susceptibility of inter-satellite links to interference, etc.
Inter-satellite link optimization refers to a technique that improves the performance and efficiency of satellite communication systems by optimizing the link parameters and configuration between satellites. The technology can maximally utilize limited bandwidth resources, improve the bandwidth utilization rate of the satellite communication system, and increase the capacity of the satellite communication system by optimizing inter-satellite links, thereby improving the overall performance of the satellite communication system.
For inter-satellite link allocation optimization, the existing method is mostly a graph theory-based heuristic algorithm, and the method refers to searching an optimal or near optimal solution for solving the problem by combining heuristic search and knowledge of graph theory. However, this method requires continuous iterations in solving the optimal solution or near optimal solution to obtain the final result. The iterative process takes a lot of time, which is not allowed in the practical use process, because one of the key indexes of the communication is real-time, and if the optimization process requires a lot of time, the satellite communication may have a phenomenon of insufficient bandwidth or insufficient capacity when the optimization is completed. Therefore, how to increase the solving speed of the optimization algorithm is a problem to be solved.
Disclosure of Invention
In order to solve the problems in the prior art, the application provides a system and a method for distributing links between satellites of a satellite system, which aim to solve the technical problem that the real-time performance of link distribution between satellites caused by adopting iterative computation in the prior art cannot meet the requirements of satellite communication.
In a first aspect of the present application, there is provided an inter-satellite link distribution system for a satellite system, comprising:
a cost calculation module;
a minimum matching module;
the cost calculation module is used for calculating the communication cost between satellites in a satellite system and the registration cost for establishing a communication link between satellites, and determining the total cost of each satellite according to the communication cost and the registration cost;
the minimum matching module is used for establishing a satellite communication diagram by taking each satellite in the satellite system as a node, a communication link between each satellite as an edge and total cost as weight of the edge, and determining optimal link allocation of the satellite system based on a matching path with the minimum weight in the satellite communication diagram.
Optionally, the cost calculation module specifically includes:
a communication cost calculation unit;
the communication cost calculation unit determines the communication cost between satellites in the satellite system according to the time delay between the two satellites.
Optionally, the satellites in the satellite system include an overseas satellite and an anchor satellite, and the time delay between the two satellites is determined based on the types of the two satellites participating in the communication.
Optionally, the expression for determining the communication cost between satellites in the satellite system is specifically:
wherein ,representing anchor satellite->The communication cost of the overseas satellite and the overseas satellite is-1, the communication cost of the overseas satellite and the anchor satellite is 0, and the communication cost of the anchor satellite and the overseas satellite is 1.
Optionally, the cost calculation module specifically includes:
a registration cost unit;
the registration cost unit determines the registration cost for establishing a communication link between satellites in a satellite system according to the number of connections between a target satellite and the same non-target satellite.
Optionally, an expression for determining a registration cost for establishing a communication link between satellites in the satellite system is specifically:
wherein ,representing the target satellite and->The non-target satellites establish a matrix of variance costs, i.e. registration costs,indicating the number of visible particles of the target satellite, +.>Representing the cumulative number of connections of the target satellite, +.>Representing the average cumulative number of connections for the target satellite.
Optionally, the cost calculation module specifically includes:
a total cost unit;
the total cost unit determines the total cost of each satellite according to the communication cost and the registration cost, and the expression of the total cost is specifically:
wherein ,for the total cost->For communication costs->For registering costs-> and />The communication cost weight and the registration cost weight, respectively.
Optionally, the minimum matching module specifically includes:
a satellite communication diagram establishing unit;
an optimal link allocation unit;
wherein the satellite communication diagram establishing unit takes each satellite in the satellite system as a nodeThe communication link between each satellite is taken as side +.>Total cost as weight of edge +.>Establishing a satellite communication map->；
Wherein the optimal link allocation unit is based on the satellite communication diagramAnd determining the optimal link allocation of the satellite system by the matching path with the minimum weight.
Optionally, the determining the optimal link allocation for the satellite system uses a modified flowering algorithm in the satellite communications mapThe matching path with the smallest weight is searched, the matching path is used as a link allocation optimal strategy, and the expression of the searching process of the improved flowering algorithm is specifically as follows:
wherein ,indicating whether a link is established, 1 is established, 0 is not established,/> and />Respectively the serial numbers of the two satellites,the total cost of the satellite with the number i and the satellite with the number j in the satellite communication diagram is shown.
In a second aspect of the present application, there is provided a method for allocating links between satellites in a satellite system, including:
calculating the communication cost between satellites in a satellite system and the registration cost for establishing a communication link between satellites, and determining the total cost of each satellite according to the communication cost and the registration cost;
and establishing a satellite communication diagram by taking each satellite in the satellite system as a node, taking a communication link between each satellite as an edge and total cost as an edge weight, and determining optimal link allocation of the satellite system based on a matching path with the minimum weight in the satellite communication diagram.
The application has the beneficial effects that: the system and the method for distributing the links among satellites of the satellite system abstract the link distribution problem among satellites into a general graph matching problem in graph theory. The node cost and the registration cost are calculated through the cost calculation module, the minimum matching module takes the cost and the satellite as the node and the edge weight in the graph, and a minimum cost path is searched in the graph by utilizing an improved flowering algorithm, and the minimum cost path is taken as an allocation optimization strategy. Because the distribution problem is abstracted into the graph matching problem, the improved flowering algorithm can be used for quickly obtaining the optimal distribution strategy, thereby improving the running and optimizing efficiency of the satellite communication system.
Drawings
FIG. 1 is a schematic diagram of a link distribution system between satellites of a satellite system according to the present application;
fig. 2 is a flow chart of a method for allocating links between satellites in a satellite system according to the present application.
Reference numerals:
10-a cost calculation module; 20-minimum matching module.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
Example 1:
referring to fig. 1, fig. 1 is a schematic structural diagram of an inter-satellite link distribution system of a satellite system according to an embodiment of the present application.
As shown in fig. 1, an inter-satellite link distribution system of a satellite system includes: a cost calculation module 10 and a minimum matching module 20.
It should be noted that, the cost calculating module 10 is configured to calculate a communication cost between satellites in a satellite system and a registration cost for establishing a communication link between satellites, and determine a total cost of each satellite according to the communication cost and the registration cost; the minimum matching module 20 is configured to establish a satellite communication diagram with each satellite in the satellite system as a node, a communication link between each satellite as an edge, and a total cost as a weight of the edge, and determine an optimal link allocation of the satellite system based on a matching path with a minimum weight in the satellite communication diagram.
Specifically, because of the graph-based heuristic algorithm adopted by the existing inter-satellite link allocation optimization, the process of solving the optimal solution or the near optimal solution generally needs to iterate continuously to obtain a more accurate result, but a great amount of time consumed by the iteration continuously has irreconcilable contradiction with the real-time required by satellite communication in practical application, such as the problem that the bandwidth or capacity of the current satellite communication is insufficient when the optimization is completed.
In this embodiment, the total cost of satellite communication is obtained by calculating the satellite communication cost and the calculation cost respectively, then a satellite communication graph is established based on the total cost and each satellite node, the inter-satellite link allocation problem is abstracted into a general graph matching problem in graph theory, and the optimal allocation strategy of the inter-satellite link is determined by obtaining the cost path with the minimum weight in the satellite communication graph.
In a preferred embodiment, the cost calculation module 10 specifically includes: and a communication cost calculation unit. The communication cost calculation unit determines the communication cost between satellites in the satellite system according to the time delay between the two satellites.
In particular, satellites in the satellite system include overseas satellites and anchor satellites, and the time delay between the two satellites is determined based on the types of the two satellites participating in the communication. The expression for determining the communication cost between satellites in the satellite system is specifically as follows:
wherein ,representing anchor satellite->The communication cost of the overseas satellite and the overseas satellite is-1, the communication cost of the overseas satellite and the anchor satellite is 0, and the communication cost of the anchor satellite and the overseas satellite is 1.
The anchor satellite refers to a fixed satellite, and the overseas satellite refers to a satellite that moves all the time. In the present embodiment, the communication cost calculation unit evaluates the node cost with reference to a time delay determined by the types of two satellites involved in communication, i.e., anchored according to the two satellites involved in communicationPoint satellites or overseas satellites respectively give different communication costs. In a satellite communication system, anchor satellites are the main communication nodes, the positions of which are fixed, and the communication switching between the anchor satellites generates higher cost, so that the anchor satellites are used for the communicationIn the case of the movement of the overseas satellite at a value of 1, communication can be realized only when the communication range of the anchor satellite is entered, so that the communication cost of the overseas satellite and the overseas satellite is-1, the communication cost of the overseas satellite and the anchor satellite is 0, and the lower the cost is, the higher the distribution level is.
In this embodiment, different communication costs are given to each satellite according to whether two satellites participating in communication are anchor satellites or overseas satellites, which is used as a part of consideration in measuring the priority of link allocation between satellites, so that the effectiveness of the optimal allocation strategy is ensured while the operation efficiency of the satellite communication system is improved.
In a preferred embodiment, the cost calculation module 10 specifically includes: registering the cost unit. The registration cost unit determines a registration cost for establishing a communication link between satellites in the satellite system based on the number of connections between the target satellite and the same non-target satellite.
Specifically, an expression for determining the registration cost for establishing a communication link between satellites in a satellite system is:
wherein ,representing the target satellite and->The non-target satellites establish a matrix of variance costs, i.e. registration costs,representing a target satelliteVisible number of particles, < >>Representing the cumulative number of connections of the target satellite, +.>Representing the average cumulative number of connections for the target satellite.
It should be noted that, the registration cost calculating unit is responsible for calculating the cost of establishing a communication link by a satellite, and when a satellite establishes a link with the same satellite for multiple times, the observation data is redundant, which wastes the link resources of the satellite. In this embodiment, the registration cost unit evaluates the node cost by the number of connections between the target satellite and the non-target satellite, and determines the registration cost by calculating a variance cost matrix for establishing the link. When the number of times that one satellite is connected with the same satellite is increased, the variance cost is increased gradually, and the distribution level of the link is reduced; variance costs are minimal when one satellite never establishes contact with another satellite.
In this embodiment, according to the number of links established between the target satellite and the non-target satellite involved in communication, the registration cost is determined by calculating the variance cost matrix of the established links, which is used as another part of consideration in measuring the priority of link allocation between satellites, so as to ensure the effectiveness of the optimal allocation strategy while improving the operation efficiency of the satellite communication system.
In a preferred embodiment, the cost calculation module 10 specifically includes: and (5) a total cost unit.
The total cost unit determines the total cost of each satellite according to the communication cost and the registration cost, and the expression of the total cost is specifically:
wherein ,for the total cost->For communication costs->For registering costs-> and />The communication cost weight and the registration cost weight, respectively.
In the present embodiment, after the communication cost and the registration cost are obtained by the cost calculation module 10, the total cost of each satellite is determined according to different weight settings. Thereafter, the allocation of communication links may be optimized by targeting the sum of the total costs of the links to be minimized after each satellite within the satellite system has been allocated links for optimal link allocation based on the total cost of the acquired satellites.
In a preferred embodiment, the minimum matching module 20 specifically includes: the satellite communication diagram establishing unit and the optimal link distribution unit.
The satellite communication diagram establishing unit takes each satellite in the satellite system as a nodeThe communication link between each satellite is taken as side +.>Total cost as weight of edge +.>Establishing a satellite communication diagramThe method comprises the steps of carrying out a first treatment on the surface of the Said optimal link allocation unit is based on said satellite communication map->Matching path with minimum medium weight value and determining satellite systemIs allocated to the link, is provided.
Based on the principle of optimizing the distribution of the communication links with the aim of minimizing the total cost of the links in the application, in the embodiment, the inter-satellite link distribution problem is abstracted into a general graph matching problem in graph theory firstly, and the graph matching problem is based on that each satellite is taken as a nodeThe communication link between each satellite is taken as side +.>Total cost as weight of edge +.>Established satellite communication diagram->Through satellite communication map->The matching path with the minimum weight is determined by the weight of the edges between each node, and the optimal solution of the link distribution is calculated in a non-iterative mode as an optimal strategy of the link distribution, so that the problems of poor real-time performance and inadaptation to satellite communication in the inter-satellite link distribution in the prior art are solved.
In a preferred embodiment, the determining of the optimal link allocation for the satellite system uses a modified flowering algorithm in the satellite communications mapThe matching path with the smallest weight is searched, the matching path is used as a link allocation optimal strategy, and the expression of the searching process of the improved flowering algorithm is specifically as follows:
wherein ,indicating whether a link is established, 1 is established, 0 is not established,/> and />Respectively the serial numbers of the two satellites,the total cost of the satellite with the number i and the satellite with the number j in the satellite communication diagram is shown.
In the present embodiment, a satellite communication map is usedImproved bloom algorithm is used in determining optimal link allocation for satellite systems, i.e. by applying the algorithm to the satellite communication map->On the basis of the method, the state (1 is established, not 0 is established) of establishing a link between satellites when the weight (total satellite cost) is minimum is obtained to serve as an obtained optimal solution of link allocation, so that the optimization of link allocation in a satellite system is realized, and the running and optimizing efficiency of the satellite communication system is improved.
Therefore, the present embodiment proposes a satellite-to-satellite link distribution system, which abstracts the inter-satellite link distribution problem into a general graph matching problem in graph theory. The node cost and registration cost are calculated by the cost calculation module 10, the minimum matching module 20 takes the cost and satellite as the node and edge weight in the graph, and the minimum cost path is searched in the graph by utilizing the improved flowering algorithm, and the minimum cost path is taken as the allocation optimization strategy. Because the distribution problem is abstracted into the graph matching problem, the improved flowering algorithm can be used for quickly obtaining the optimal distribution strategy, thereby improving the running and optimizing efficiency of the satellite communication system.
Referring to fig. 2, fig. 2 is a flow chart of a method for allocating links between satellites in a satellite system according to an embodiment of the present application.
As shown in fig. 2, a method for allocating links between satellites in a satellite system includes the steps of:
s1: calculating the communication cost between satellites in a satellite system and the registration cost for establishing a communication link between satellites, and determining the total cost of each satellite according to the communication cost and the registration cost;
s2: taking each satellite in the satellite system as a node, taking a communication link between each satellite as an edge, taking the total cost as the weight of the edge, establishing a satellite communication diagram, and determining the optimal link allocation of the satellite system based on a matching path with the minimum weight in the satellite communication diagram;
in this embodiment, the link allocation problem between satellites is abstracted into a general graph matching problem in graph theory, and the cost and satellites are used as nodes and edge weights in the graph, and the minimum cost path is used as an allocation optimization strategy, so that the operation and optimization efficiency of the satellite communication system is improved.
The specific implementation of the inter-satellite link distribution method of the satellite system is basically the same as the embodiments of the inter-satellite link distribution system of the satellite system, and will not be described herein.
In describing embodiments of the present application, it should be understood that the terms "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "center", "top", "bottom", "inner", "outer", "inside", "outside", etc. indicate orientations or positional relationships based on the drawings are merely for convenience in describing the present application and simplifying the description, and do not indicate or imply that the devices or elements referred to must have a specific orientation, be configured and operated in a specific orientation, and thus should not be construed as limiting the present application. Wherein "inside" refers to an interior or enclosed area or space. "peripheral" refers to the area surrounding a particular component or region.
In the description of embodiments of the present application, the terms "first," "second," "third," "fourth" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first", "a second", "a third" and a fourth "may explicitly or implicitly include one or more such feature. In the description of the present application, unless otherwise indicated, the meaning of "a plurality" is two or more.
In describing embodiments of the present application, it should be noted that the terms "mounted," "connected," and "assembled" are to be construed broadly, as they may be fixedly connected, detachably connected, or integrally connected, unless otherwise specifically indicated and defined; can be directly connected or indirectly connected through an intermediate medium, and can be communication between two elements. The specific meaning of the above terms in the present application will be understood in specific cases by those of ordinary skill in the art.
In the description of embodiments of the application, a particular feature, structure, material, or characteristic may be combined in any suitable manner in one or more embodiments or examples.
In describing embodiments of the present application, it will be understood that the terms "-" and "-" are intended to be inclusive of the two numerical ranges, and that the ranges include the endpoints. For example, "A-B" means a range greater than or equal to A and less than or equal to B. "A-B" means a range of greater than or equal to A and less than or equal to B.
In the description of embodiments of the present application, the term "and/or" is merely an association relationship describing an association object, meaning that three relationships may exist, e.g., a and/or B, may represent: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship.
Although embodiments of the present application have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made therein without departing from the principles and spirit of the application, the scope of which is defined in the appended claims and their equivalents.
Claims (10)
1. An inter-satellite link distribution system for a satellite system, comprising:
a cost calculation module;
a minimum matching module;
the cost calculation module is used for calculating the communication cost between satellites in a satellite system and the registration cost for establishing a communication link between satellites, and determining the total cost of each satellite according to the communication cost and the registration cost;
the minimum matching module is used for establishing a satellite communication diagram by taking each satellite in the satellite system as a node, a communication link between each satellite as an edge and total cost as weight of the edge, and determining optimal link allocation of the satellite system based on a matching path with the minimum weight in the satellite communication diagram.
2. The inter-satellite link distribution system according to claim 1, wherein the cost calculation module specifically comprises:
a communication cost calculation unit;
the communication cost calculation unit determines the communication cost between satellites in the satellite system according to the time delay between the two satellites.
3. The inter-satellite system inter-satellite link distribution system according to claim 2, wherein the satellites in the satellite system include an overseas satellite and an anchor satellite, and the time delay between the two satellites is determined based on the types of the two satellites participating in the communication.
4. An inter-satellite link distribution system according to claim 3, wherein the expression for determining the cost of communication between satellites in the satellite system is:
；
wherein ,representing anchor satellite->The communication cost of the overseas satellite and the overseas satellite is-1, the communication cost of the overseas satellite and the anchor satellite is 0, and the communication cost of the anchor satellite and the overseas satellite is 1.
5. The inter-satellite link distribution system according to claim 1, wherein the cost calculation module specifically comprises:
a registration cost unit;
the registration cost unit determines the registration cost for establishing a communication link between satellites in a satellite system according to the number of connections between a target satellite and the same non-target satellite.
6. The inter-satellite link distribution system according to claim 5, wherein the expression for determining the registration cost for establishing a communication link between satellites in the satellite system is:
；
wherein ,representing the target satellite and->Variance cost matrix of link established by non-target satellite, i.e. registration cost, < >>Representation ofVisible number of target satellites, +.>Representing the cumulative number of connections of the target satellite, +.>Representing the average cumulative number of connections for the target satellite.
7. The inter-satellite link distribution system according to claim 1, wherein the cost calculation module specifically comprises:
a total cost unit;
the total cost unit determines the total cost of each satellite according to the communication cost and the registration cost, and the expression of the total cost is specifically:
；
wherein ,for the total cost->For communication costs->For registering costs-> and />The communication cost weight and the registration cost weight, respectively.
8. The inter-satellite link distribution system according to claim 1, wherein the minimum matching module specifically comprises:
a satellite communication diagram establishing unit;
an optimal link allocation unit;
wherein the satellite communication diagram establishing unit takes each satellite in the satellite system as a nodeThe communication link between each satellite is taken as side +.>Total cost as weight of edge +.>Establishing a satellite communication map->；
Wherein the optimal link allocation unit is based on the satellite communication diagramAnd determining the optimal link allocation of the satellite system by the matching path with the minimum weight.
9. The inter-satellite link distribution system according to claim 8, wherein said determining optimal link distribution for the satellite system uses a modified flowering algorithm in the satellite communications mapThe matching path with the smallest weight is searched, the matching path is used as a link allocation optimal strategy, and the expression of the searching process of the improved flowering algorithm is specifically as follows:
；
wherein ,indicating whether a link is established, 1 is established, 0 is not established,/> and />Respectively representing the sequences of two satellites, +.>The total cost of the satellite with the number i and the satellite with the number j in the satellite communication diagram is shown.
10. A method for assigning links between satellites in a satellite system, comprising:
calculating the communication cost between satellites in a satellite system and the registration cost for establishing a communication link between satellites, and determining the total cost of each satellite according to the communication cost and the registration cost;
and establishing a satellite communication diagram by taking each satellite in the satellite system as a node, taking a communication link between each satellite as an edge and total cost as an edge weight, and determining optimal link allocation of the satellite system based on a matching path with the minimum weight in the satellite communication diagram.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311136113.XA CN116865843B (en) | 2023-09-05 | 2023-09-05 | System and method for distributing links between satellites of satellite system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311136113.XA CN116865843B (en) | 2023-09-05 | 2023-09-05 | System and method for distributing links between satellites of satellite system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116865843A true CN116865843A (en) | 2023-10-10 |
| CN116865843B CN116865843B (en) | 2023-12-26 |
Family
ID=88232700
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311136113.XA Active CN116865843B (en) | 2023-09-05 | 2023-09-05 | System and method for distributing links between satellites of satellite system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116865843B (en) |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6157840A (en) * | 1998-08-31 | 2000-12-05 | Motorola Inc. | Method and apparatus for real-time channel resource allocation in a communications system |
| US20100182947A1 (en) * | 2008-11-26 | 2010-07-22 | Je-Hong Jong | Method and system of providing link adaptation for maximizing throughput in mobile satellite systems |
| US20140160970A1 (en) * | 2013-11-21 | 2014-06-12 | Comtech Ef Data Corp. | System and method for satellite link budget analysis (lba) optimization |
| US20160088627A1 (en) * | 2014-09-22 | 2016-03-24 | Thales | Procede de gestion dynamique de ressources et systeme associe |
| KR101611319B1 (en) * | 2014-12-29 | 2016-04-26 | 한화탈레스 주식회사 | Method of calculating cost for dynamic routing in satellite communication system |
| US9906291B1 (en) * | 2015-02-27 | 2018-02-27 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Heterogeneous spacecraft networks |
| US20180323863A1 (en) * | 2017-05-05 | 2018-11-08 | Via Space Networks Inc. | Low latency satellite communication relay network |
| CN109740832A (en) * | 2018-10-26 | 2019-05-10 | 南京大学 | It is a kind of for enhancing the connection plan design method of satellite system independent navigation ability |
| CN109889255A (en) * | 2019-03-28 | 2019-06-14 | 大连大学 | A kind of satellite network reconstructing method based on improvement ant colony algorithm |
| CN110278024A (en) * | 2019-08-07 | 2019-09-24 | 清华大学 | The power system capacity optimization method and device of Communication Satellite Constellation |
| CN111148161A (en) * | 2020-01-06 | 2020-05-12 | 中国科学院微小卫星创新研究院 | Method and system for balancing load route between low-orbit satellite constellation satellites |
| US11096188B1 (en) * | 2020-11-02 | 2021-08-17 | Microsoft Technology Licensing, Llc | Scheduling satellite data transmissions using differing sets of ground stations |
| CN113315569A (en) * | 2021-05-25 | 2021-08-27 | 西安交通大学 | Satellite reliability routing method and system with weighted link survival time |
| CN113824489A (en) * | 2021-11-22 | 2021-12-21 | 凯睿星通信息科技(南京)股份有限公司 | Satellite network resource dynamic allocation method, system and device based on deep learning |
| US20220052756A1 (en) * | 2018-09-10 | 2022-02-17 | Telesat Technology Corporation | Resource deployment optimizer for non-geostationary and/or geostationary communications satellites |
| CN115276755A (en) * | 2022-06-20 | 2022-11-01 | 哈尔滨工业大学（威海） | Inter-satellite link and power distribution method for satellite network communication |
-
2023
- 2023-09-05 CN CN202311136113.XA patent/CN116865843B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6157840A (en) * | 1998-08-31 | 2000-12-05 | Motorola Inc. | Method and apparatus for real-time channel resource allocation in a communications system |
| US20100182947A1 (en) * | 2008-11-26 | 2010-07-22 | Je-Hong Jong | Method and system of providing link adaptation for maximizing throughput in mobile satellite systems |
| US20140160970A1 (en) * | 2013-11-21 | 2014-06-12 | Comtech Ef Data Corp. | System and method for satellite link budget analysis (lba) optimization |
| US20160088627A1 (en) * | 2014-09-22 | 2016-03-24 | Thales | Procede de gestion dynamique de ressources et systeme associe |
| KR101611319B1 (en) * | 2014-12-29 | 2016-04-26 | 한화탈레스 주식회사 | Method of calculating cost for dynamic routing in satellite communication system |
| US9906291B1 (en) * | 2015-02-27 | 2018-02-27 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Heterogeneous spacecraft networks |
| US20180323863A1 (en) * | 2017-05-05 | 2018-11-08 | Via Space Networks Inc. | Low latency satellite communication relay network |
| US20220052756A1 (en) * | 2018-09-10 | 2022-02-17 | Telesat Technology Corporation | Resource deployment optimizer for non-geostationary and/or geostationary communications satellites |
| CN109740832A (en) * | 2018-10-26 | 2019-05-10 | 南京大学 | It is a kind of for enhancing the connection plan design method of satellite system independent navigation ability |
| CN109889255A (en) * | 2019-03-28 | 2019-06-14 | 大连大学 | A kind of satellite network reconstructing method based on improvement ant colony algorithm |
| CN110278024A (en) * | 2019-08-07 | 2019-09-24 | 清华大学 | The power system capacity optimization method and device of Communication Satellite Constellation |
| CN111148161A (en) * | 2020-01-06 | 2020-05-12 | 中国科学院微小卫星创新研究院 | Method and system for balancing load route between low-orbit satellite constellation satellites |
| US11096188B1 (en) * | 2020-11-02 | 2021-08-17 | Microsoft Technology Licensing, Llc | Scheduling satellite data transmissions using differing sets of ground stations |
| CN113315569A (en) * | 2021-05-25 | 2021-08-27 | 西安交通大学 | Satellite reliability routing method and system with weighted link survival time |
| CN113824489A (en) * | 2021-11-22 | 2021-12-21 | 凯睿星通信息科技(南京)股份有限公司 | Satellite network resource dynamic allocation method, system and device based on deep learning |
| CN115276755A (en) * | 2022-06-20 | 2022-11-01 | 哈尔滨工业大学（威海） | Inter-satellite link and power distribution method for satellite network communication |
Non-Patent Citations (4)
| Title |
|---|
| 杨力;刘蕴;魏德宾;蔡睿妍;: "应用于卫星网络拓扑生成的快速收敛蚁群算法", 计算机工程, no. 05, pages 99 - 104 * |
| 石磊玉;向为;唐小妹;: "一种兼顾卫星导航系统星间观测及通信的链路分配算法", 宇航学报, no. 09, pages 107 - 113 * |
| 陆俊涛;丁良辉;支;李悦;: "卫星通信资源覆盖率优化调度仿真研究", 计算机仿真, no. 03, pages 133 - 137 * |
| 陆洲;晏坚;: "宽带卫星通信系统拥塞管理技术研究", 无线电通信技术, no. 01, pages 17 - 19 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116865843B (en) | 2023-12-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Optimal delay constrained offloading for vehicular edge computing networks | |
| CN113296845B (en) | Multi-cell task unloading algorithm based on deep reinforcement learning in edge computing environment | |
| CN111586696B (en) | Resource allocation and unloading decision method based on multi-agent architecture reinforcement learning | |
| CN109151864B (en) | Migration decision and resource optimal allocation method for mobile edge computing ultra-dense network | |
| CN110518956B (en) | Time slot allocation algorithm-based hopping pattern optimization method and device, and storage medium | |
| CN102523617B (en) | DV-Hop algorithm based on node communication radius and beacon node distribution | |
| CN111669775B (en) | Resource allocation method based on support vector machine under heterogeneous network | |
| CN110336751A (en) | Low-track satellite network routing policy based on membership function | |
| Banerjee et al. | Edtp: Energy and delay optimized trajectory planning for uav-iot environment | |
| CN105142195B (en) | A kind of wireless terminal communications policy selection and resource allocation methods based on Stackelberg game | |
| CN114153515B (en) | Highway internet of vehicles task unloading algorithm based on 5G millimeter wave communication | |
| Mazza et al. | A cluster based computation offloading technique for mobile cloud computing in smart cities | |
| Yalçın et al. | BTA-MM: Burst traffic awareness-based adaptive mobility model with mobile sinks for heterogeneous wireless sensor networks | |
| CN115665869A (en) | Multi-user collaboration platform and method based on edge calculation and directed acyclic graph | |
| He et al. | Delay-aware energy efficient computation offloading for energy harvesting enabled fog radio access networks | |
| Luo et al. | Joint game theory and greedy optimization scheme of computation offloading for UAV-aided network | |
| Wang et al. | Joint offloading decision and resource allocation in vehicular edge computing networks | |
| CN116865843B (en) | System and method for distributing links between satellites of satellite system | |
| Lai et al. | Mobility-aware task offloading in MEC with task migration and result caching | |
| Liu et al. | Joint computation offloading and resource allocation in vehicular edge computing networks | |
| Zhang et al. | Cybertwin-driven multi-intelligent reflecting surfaces aided vehicular edge computing leveraged by deep reinforcement learning | |
| Truong et al. | Performance analysis and optimization of multiple IIoT devices radio frequency energy harvesting NOMA mobile edge computing networks | |
| CN108430103B (en) | Software-defined fog internet-of-vehicles resource allocation method and system | |
| CN117425190A (en) | HPLC-HRF dual-mode networking structure with auxiliary nodes and construction method | |
| Zhang et al. | A joint offloading and energy cooperation scheme for edge computing networks |
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 |