Methods and systems for dynamic inter-satellite link establishment in low-Earth orbit satellite constellations
By performing grid partitioning and virtual topology optimization on the low-Earth orbit (LEO) satellite constellation and dynamically adjusting inter-satellite links, the problems of resource waste and load imbalance in the LEO satellite constellation were solved, achieving resource conservation and performance balance, and improving satellite lifespan and constellation efficiency.
Patent Information
- Application Number
- CN202511884635.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-12-15
- Publication Date
- 2026-11-17
AI Technical Summary
Static topology optimization of inter-satellite links in low-Earth orbit satellite constellations cannot be dynamically adjusted according to regional service needs and real-time traffic changes, resulting in resource waste and low utilization efficiency, and failing to effectively solve the problem of unbalanced load on inter-satellite links.
By dividing global users into grids and determining the business traffic of each user grid, an inter-satellite link topology optimization model based on the virtual topology method is constructed. The number of inter-satellite link savings and network throughput retention are used as optimization indicators to iteratively solve the problem, dynamically reducing and reconstructing links to achieve load balancing and resource conservation.
It enables dynamic topology optimization based on regional business needs and real-time traffic changes, improving resource utilization, extending satellite service life, and enhancing constellation efficiency.
Smart Images

Figure CN123122618A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of satellite communication technology, and in particular to a method and system for dynamic inter-satellite link establishment in a low-Earth orbit satellite constellation, electronic equipment, and computer-readable storage medium. Background Technology
[0002] Compared with large satellites, small satellites have the characteristics of low cost, short cycle, flexible deployment and cluster deployment potential. By forming a low-Earth orbit (LEO) satellite constellation through multi-satellite collaboration, they can overcome individual performance bottlenecks and achieve comprehensive performance far exceeding that of a single satellite. LEO satellite constellations achieve interconnection between multiple satellites by constructing inter-satellite links (ISLs), forming a space-based communication network system with dynamic coverage and high-speed connection. However, maintaining inter-satellite links in LEO satellite constellations requires continuous consumption of satellite resources, mainly including: (1) energy: continuous high-power operation of laser communication terminals; (2) spectrum: wireless radio frequency inter-satellite links occupy scarce spectrum resources; (3) on-board computing power: link signal modulation and demodulation, data packet routing and switching require computing resources; (4) thermal control resources: the heat generated by high-power devices poses a challenge to the limited thermal control capabilities of satellites. Since small satellite constellations have strict design constraints in terms of weight and energy reserves, and need to maintain a large number of inter-satellite links for a long time with high power consumption, on-board resources are severely limited. Therefore, it is necessary to carry out inter-satellite link optimization design for LEO satellite constellations. For example, Chinese invention patent application CN202211243294.1 discloses a capacity-maximizing topology design method for the Walker constellation. This method optimizes the connection relationships of inter-orbit links to construct a topology that better suits the characteristics of service traffic, thereby maximizing network capacity and reducing onboard resource consumption. However, this method is a static, geometrically rule-based topology optimization, unable to dynamically optimize the topology according to regional service needs and real-time traffic changes. Furthermore, it aims to increase the constellation network throughput capacity and cannot effectively solve the problem of unbalanced load on inter-satellite links, nor does it have the ability to autonomously handle sudden traffic changes. In resource-constrained low-Earth orbit satellite constellations, inter-satellite links continuously consume energy. Fixed link topologies, due to their lack of flexibility, often lead to redundant links being idle, resulting in wasted onboard resources and low utilization efficiency, seriously affecting satellite service life and constellation performance. Summary of the Invention
[0003] This invention provides a method and system for dynamic inter-satellite link establishment in a low-Earth orbit satellite constellation, as well as electronic equipment and computer-readable storage media. It can achieve dynamic topology optimization based on regional service needs and real-time traffic changes, which not only realizes inter-satellite link load balancing but also improves resource utilization. It achieves a balance between resource conservation and constellation network performance, and can effectively improve satellite service life and constellation efficiency.
[0004] According to one aspect of the present invention, a method for dynamic inter-satellite link establishment in a low-Earth orbit satellite constellation is provided, comprising the following: Divide the global user base into grids and determine the business traffic for each user grid; The objective function is designed with the number of inter-satellite links saved and the amount of network throughput retained as optimization indicators. An inter-satellite link topology optimization model for low-Earth orbit satellite constellations is constructed based on the virtual topology method. In the inter-satellite link topology optimization model, the weight of each link is determined based on the service traffic of the user grid. The inter-satellite link topology optimization model is solved iteratively to obtain the optimized inter-satellite link topology.
[0005] Furthermore, the expression for the objective function is: ; in, express Comprehensive optimization indicators at any time and They represent The total number of inter-satellite links before and after optimization at any given moment. and They represent The maximum flow at any given moment before and after optimization.
[0006] Furthermore, the process of iteratively solving the inter-satellite link topology optimization model to obtain the optimized inter-satellite link topology includes the following: The inter-satellite link topology optimization model is initialized, and the initial maximum flow is calculated; Assess the criticality of each satellite, mark satellites visible in the user grid or sink as critical satellites, and include critical satellites in the first satellite set; Based on the initial maximum flow, the inter-satellite link simplification index of key satellites under the current inter-satellite link topology is evaluated. At least one inter-satellite link with the smallest inter-satellite link simplification index value is screened and deleted. The inter-satellite link topology optimization model is updated for the first time, and the key satellites whose inter-satellite links are disconnected are included in the second satellite set. Evaluate the inter-satellite link reconfigurability index between any two key satellites in the second satellite set, select at least one inter-satellite link with the largest inter-satellite link reconfigurability index value for reconfiguration, and update the inter-satellite link topology optimization model for the second time. The above process is iterated continuously until the convergence accuracy or the maximum number of iterations is reached, resulting in the optimized inter-satellite link topology.
[0007] Furthermore, the inter-satellite link scalability index is calculated based on the following formula: ; in, Indicates the first Inter-satellite link scalability index. Indicates the initial maximum flow. express Delete the first time Inter-satellite link topology optimization model after adding inter-satellite links. This represents the maximum flow algorithm function. express The inter-satellite link topology optimization model at time 1 after deleting the first... Maximum flow after inter-satellite links.
[0008] Furthermore, the inter-satellite link reconfigurability index is calculated based on the following formula: ; in, Indicates key satellites k and key satellites l Inter-satellite link reconfigurability metrics for reconstructing inter-satellite links. Indicates key satellites k and key satellites l Inter-satellite links reconstructed between them Indicates key satellites k and key satellites l The angle between them This represents the maximum inter-satellite elevation angle under the current inter-satellite link topology. Indicates key satellites k and key satellites l Inter-satellite link distance, This represents the maximum inter-satellite link distance under the current inter-satellite link topology. This represents the maximum flow algorithm function. This indicates that, based on the first updated inter-satellite link topology optimization model, on key satellites... k and key satellites l Inter-satellite link topology optimization model after reconstructing inter-satellite links. This indicates that the first updated inter-satellite link topology optimization model is applicable to key satellites. k and key satellites l The maximum flow after reconstructing inter-satellite links, This represents the weighting coefficient.
[0009] Furthermore, deleted inter-satellite links need to be excluded during the inter-satellite link reconstruction process.
[0010] Furthermore, the service traffic for each user grid is calculated based on the following formula: ; in, This represents the service traffic of the user grid. Indicates the position of the user grid. This represents the population of the user grid. Represents the total global population. This represents the total global business traffic.
[0011] In addition, the present invention also provides a dynamic inter-satellite link establishment system for a low-Earth orbit satellite constellation, comprising: The user grid partitioning module is used to partition global users into grids and determine the business traffic of each user grid. The optimization model construction module is used to design objective functions with the number of inter-satellite link savings and network throughput retention as optimization indicators. It constructs an inter-satellite link topology optimization model for low-Earth orbit satellite constellations based on the virtual topology method. In the inter-satellite link topology optimization model, the weight of each link is determined based on the service traffic of the user grid. The model iterative solution module is used to iteratively solve the inter-satellite link topology optimization model to obtain the optimized inter-satellite link topology.
[0012] In addition, the present invention also provides an electronic device, including a processor and a memory, wherein the memory stores a computer program, and the processor executes the steps of the method described above by calling the computer program stored in the memory.
[0013] In addition, the present invention provides a computer-readable storage medium for storing a computer program for dynamically establishing inter-satellite links for a low-Earth orbit satellite constellation, wherein the computer program executes the steps of the method described above when running on a computer.
[0014] The present invention has the following beneficial effects: The present invention provides a dynamic inter-satellite link establishment method for low-Earth orbit (LEO) satellite constellations. First, global users are divided into grids, and the service traffic of each user grid is determined, enabling service traffic distribution analysis. Then, when constructing the inter-satellite link topology optimization model, the weight of each link is determined based on the service traffic of the user grid. The service requirements of the user grid are spatiotemporally mapped to the dynamic coverage of the satellites to drive the on-demand reduction and reconstruction of inter-satellite links. Dynamic topology optimization can be achieved based on regional service needs and real-time traffic changes. Furthermore, the objective function is designed using the number of inter-satellite link savings and network throughput retention as optimization indicators. While ensuring the connectivity and performance of the LEO satellite constellation network, redundant links are dynamically eliminated and high-value links are reconstructed. This allows low-traffic satellites to focus on reducing redundant links, while high-traffic satellites focus on establishing high-value links to enhance performance. This not only achieves load balancing of inter-satellite links but also improves resource utilization, achieving a balance between resource conservation and constellation network performance, effectively improving satellite service life and constellation efficiency.
[0015] In addition, the inter-satellite link dynamic link establishment system for the low-Earth orbit satellite constellation of the present invention also has the above-mentioned advantages.
[0016] In addition to the objectives, features, and advantages described above, the present invention has other objectives, features, and advantages. The invention will now be described in further detail with reference to the figures. Attached Figure Description
[0017] The accompanying drawings, which form part of this application, are used to provide a further understanding of the invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an undue limitation of the invention. In the drawings: Figure 1 This is a flowchart illustrating the dynamic inter-satellite link establishment method for a low-Earth orbit satellite constellation according to a preferred embodiment of this application. Figure 2 This is a schematic diagram of an adjacency matrix of a satellite network constructed in a preferred embodiment of this application; Figure 3 yes Figure 1 A schematic diagram of the sub-process of step S3; Figure 4 This is a schematic diagram of the low-Earth orbit satellite constellation distribution during simulation experiments in a preferred embodiment of this application; Figure 5 This is a schematic diagram comparing the number of inter-satellite links between the optimized topology and the original topology for all time slices during simulation experiments in a preferred embodiment of this application. Figure 6 This is a schematic diagram illustrating the percentage of inter-satellite links saved by the optimized topology after all time slices compared to the original topology during simulation experiments in a preferred embodiment of this application. Figure 7This is a schematic diagram comparing the network throughput of the optimized topology after all time slices with the original topology during simulation experiments in a preferred embodiment of this application. Figure 8 This is a schematic diagram illustrating the percentage loss in network throughput of all time-slice optimized topologies compared to the original topologies during simulation experiments in a preferred embodiment of this application. Figure 9 This is a schematic diagram of the module structure of a dynamic inter-satellite link establishment system for a low-Earth orbit satellite constellation according to another embodiment of this application. Detailed Implementation
[0018] It should be noted that, unless otherwise specified, the embodiments and features described in this application can be combined with each other. This application will now be described in detail with reference to the accompanying drawings and embodiments.
[0019] like Figure 1 As shown, a preferred embodiment of this application provides a method for dynamic inter-satellite link establishment for a low-Earth orbit satellite constellation, including the following: Step S1: Divide the global user base into grids and determine the business traffic for each user grid; Step S2: Design an objective function with the number of inter-satellite link savings and network throughput retention as optimization indicators. Construct an inter-satellite link topology optimization model for the low-Earth orbit satellite constellation based on the virtual topology method. In the inter-satellite link topology optimization model, the weight of each link is determined based on the service traffic of the user grid. Step S3: Iteratively solve the inter-satellite link topology optimization model to obtain the optimized inter-satellite link topology.
[0020] It is understandable that the dynamic inter-satellite link establishment method for the low-Earth orbit (LEO) satellite constellation in this embodiment first divides the global user network into grids and determines the service traffic of each user grid, realizing service traffic distribution analysis. Then, when constructing the inter-satellite link topology optimization model, the weight of each link is determined based on the service traffic of the user grid, and the service requirements of the user grid are spatiotemporally mapped with the dynamic coverage of the satellites to drive the on-demand reduction and reconstruction of inter-satellite links. Dynamic topology optimization can be achieved according to regional service requirements and real-time traffic changes. Furthermore, the objective function is designed with the number of inter-satellite link savings and the network throughput retention as optimization indicators. Under the premise of ensuring the connectivity and performance of the LEO satellite constellation network, redundant links are dynamically eliminated and high-value links are reconstructed. This allows low-traffic satellites to focus on reducing redundant links, while high-traffic satellites focus on establishing high-value links to enhance performance. This not only achieves inter-satellite link load balancing but also improves resource utilization, achieving a balance between resource conservation and constellation network performance, which can effectively improve satellite service life and constellation efficiency.
[0021] It is understandable that traffic volume is not evenly distributed across different geographical regions globally. With the same capacity for a single inter-satellite link, a satellite covering a less busy area theoretically requires fewer inter-satellite links than a satellite covering a more busy area. While a regular grid-like topology formed under fixed inter-satellite link connections offers good stability and reliability, the same number of inter-satellite links means idle links exist between satellites covering less busy areas. Even if these links have no traffic, they still need to maintain a connection, resulting in wasted link resources. Therefore, to conserve onboard resources, this invention proposes a resource-saving dynamic inter-satellite link topology optimization approach. The core optimization logic is based on a regular grid-like topology, analyzing the traffic distribution in different regions to reconstruct and optimize links, thereby improving onboard resource utilization.
[0022] In step S1, to determine the distribution of service volume in various geographical regions globally, this application uses population size to comprehensively reflect the local network service demand. Specifically, the Earth's population distribution is statistically analyzed by latitude and longitude. To reduce the processing load of subsequent models, the globe is divided into several 5°×5° grids according to latitude and longitude, totaling 72×36 grids. Indicates the corresponding grid. , .For example, This represents a grid located in the region of 180°W-175°W and 90°N-85°N, and so on. Specifically, this application calculates the service traffic for each user grid based on the following formula: ; in, This represents the service traffic of the user grid. Indicates the position of the user grid. This represents the population of the user grid. Represents the total global population. This represents the total global business traffic.
[0023] It is understood that this application calculates the real-time service traffic of each user grid based on the proportion of the population in each user grid to the total global population. This can accurately reflect the global service traffic distribution at any given time, providing an accurate data-driven foundation for subsequent inter-satellite link optimization.
[0024] Furthermore, due to the high-speed motion of satellites, the constellation network topology is constantly changing. The large number of satellites in a low-Earth orbit (LEO) small satellite constellation exacerbates the overhead of dynamic topology management. Currently, commonly used dynamic topology management methods include virtual topology and virtual node methods. In step S2, this invention employs the virtual topology method to process the dynamic topology of the LEO satellite constellation, converting the time domain... Discretely divided into several time slices The constellation network topology remains unchanged within each time slice.
[0025] Specifically, establish a virtual super source point. In the graphical model, all user grids are connected. Each user grid is connected to the satellite with the largest elevation angle to form a user link, the link capacity of which is [missing information]. Simultaneously, establish a virtual super hub. In the graphical model, connect all gateway stations (i.e., sinks) that handle inter-satellite traffic. For each gateway station, establish a feeder link with the two satellites with the highest elevation angles. The link capacity is... In addition, the inter-satellite link capacity is Then, combining graph theory, the network topology of the low-Earth orbit satellite constellation is abstracted into a weighted time-varying graph model: , This represents the set of nodes in the graph model (including virtual super source, virtual super sink, and satellite nodes). This represents the set of edges in the graph model (including user links, inter-satellite links, and feeder links). express The weighted matrix, Represents a node i and nodes j The actual network forwarding traffic between them As a node i and nodes j The weight values of the links between them. Indicates time, , , It changes constantly over time, but in each time slice The internal parameters remain unchanged. Optimization variable selection. , is a variable in the range [0,1], if node i and nodes j If a link is established between them, then If no link is established, then For example, the adjacency matrix of a certain satellite network constructed in this invention is as follows: Figure 2 As shown, the initial values of the optimization variables are determined by the link building relationships of each link under the regular grid topology link building mode. The regular grid topology link building mode is an existing technology, and the specific link building process will not be described in detail here.
[0026] Since each user grid is only connected to the satellite node with the highest elevation angle, the actual network traffic of each user link can be directly determined. A satellite node can connect to multiple user grids simultaneously, so the actual network forwarding traffic of each satellite node can be calculated by summing the service traffic within the user grid currently covered by each satellite node, thus determining the actual network forwarding traffic of each inter-satellite link at any given time. In addition, since each sink selects the two satellites with the highest elevation angles to establish a feeder link, the sum of the actual network forwarding traffic of these two satellite nodes can be used as the actual network forwarding traffic of the feeder link.
[0027] Furthermore, in low-Earth orbit satellite constellations, the partial disconnection of inter-satellite links has a relatively small impact on the network's latency and forwarding hop count, but a significant impact on network throughput performance. Therefore, this application uses the number of inter-satellite link savings and the amount of network throughput retention as optimization indicators to design the objective function of the inter-satellite link topology optimization model. Specifically, it is assumed that in the total time domain... In The total number of inter-satellite links under the rule grid+ mesh topology at any given time (i.e., the inter-satellite link topology before optimization) is: The maximum flow algorithm is used to calculate the virtual super source. To virtual super-collection point Maximum Flow The calculation formula is: , ,in, express The total number of inter-satellite links before optimization. express The maximum flow before optimization. express A weighted time-varying graphical model for each time step. This represents the maximum flow algorithm function. The maximum flow algorithm is a mature and readily available algorithm; its specific calculation expression and principles will not be elaborated upon here. After inter-satellite link topology optimization, in The link establishment relationship at each moment This indicates that, based on this, a system is formed. weighted matrix , This indicates the nodes after topology optimization design. i and nodes j The actual network forwarding traffic between them will then form a new weighted time-varying graph model. The total number of inter-satellite links at this time is The virtual super source is also calculated using the maximum flow algorithm. To virtual super-collection point Maximum Flow The calculation formula is: , , express The total number of inter-satellite links at all times after optimization. express The current is always at the optimized maximum flow. Next, the inter-satellite link savings and network throughput reserves are normalized respectively, and the objective function is expressed as: ; in, express Comprehensive optimization indicators for each moment.
[0028] It is understandable that existing topology optimization technologies aim at global network performance and are not designed for real-world scenarios with highly concentrated local services (such as my country's low-Earth orbit constellation primarily serving densely populated areas in and around China). Global optimization can easily lead to an imbalance between insufficient links in high-traffic areas and excessive links in low-traffic areas, failing to meet regional service demands. This invention, however, determines the weight of each link in the inter-satellite link topology optimization model based on the service traffic of the user grid. It spatiotemporally maps the service demands of the user grid with the dynamic coverage of satellites, driving the on-demand reduction and reconstruction of inter-satellite links during the optimization process. Dynamic topology optimization can be achieved based on regional service demands and real-time traffic changes. Furthermore, the objective function is designed using the number of inter-satellite link savings and network throughput retention as optimization indicators. While ensuring the connectivity and performance of the low-Earth orbit satellite constellation network, it dynamically eliminates redundant links and reconstructs high-value links. This allows low-traffic satellites to focus on reducing redundant links, while high-traffic satellites focus on establishing high-value links to enhance performance. This not only achieves load balancing of inter-satellite links but also improves resource utilization, achieving a balance between resource conservation and constellation network performance, effectively improving satellite service life and constellation efficiency.
[0029] In addition, the inter-satellite link topology optimization model also includes the following constraints: link capacity constraint, adjacency matrix symmetry constraint, satellite-to-ground visibility constraint, and inter-satellite link establishment constraint. Among these, the link capacity constraint is: Let express Time Node i Transmitted to node j The actual link traffic, if the link is a user link, has the following constraints: If the link is an inter-satellite link, then the following constraints apply: In addition, the weighted matrix It can be expressed by the following mathematical formula: The symmetry constraint of the adjacency matrix can be expressed as: Because, in engineering applications, inter-satellite links are bidirectional links, therefore Time Node i Transmitted to node j The links and corresponding weights should be related to the nodes. j Transmitted to node i The same applies. The satellite-to-ground visibility constraint is as follows: the minimum elevation angle between the satellite and the ground node (user grid or gateway station) is set to 25°, and the calculated elevation angle between the ground node and the satellite is denoted as... If the two need to establish a link, then there are Inter-satellite link establishment constraints specifically refer to whether an inter-satellite link can be established between two satellites. This typically involves calculating the relative positions and angular relationships between the two satellites, assuming the Earth's radius is... The orbital altitudes of satellite A and satellite B are respectively , Instantaneous latitude and longitude respectively , This indicates that the geocentric angle between satellite A and satellite B is... Distance is Define clearance ,but: ; ; ; To avoid the influence of Earth and the atmosphere on inter-satellite links, the distance between inter-satellite links and the ground must be higher than that of Earth. H ,like If so, satellite A and satellite B can establish an inter-satellite link; otherwise, an inter-satellite link cannot be established.
[0030] In addition, such as Figure 3 As shown, in step S3, the process of iteratively solving the inter-satellite link topology optimization model to obtain the optimized inter-satellite link topology includes the following: Step S31: Initialize the inter-satellite link topology optimization model and calculate the initial maximum flow; Step S32: Assess the criticality of each satellite, mark satellites visible in the user grid or sink as critical satellites, and add critical satellites to the first satellite set; Step S33: Based on the initial maximum flow, evaluate the inter-satellite link simplification index of key satellites under the current inter-satellite link topology, filter and delete at least one inter-satellite link with the smallest inter-satellite link simplification index value, and perform the first update of the inter-satellite link topology optimization model, and include the key satellites whose inter-satellite links have been disconnected into the second satellite set. Step S34: Evaluate the inter-satellite link reconfigurability index between any two key satellites in the second satellite set, select at least one inter-satellite link with the largest inter-satellite link reconfigurability index value for reconfiguration, and update the inter-satellite link topology optimization model for the second time. Step S35: Iterate the above process continuously until the convergence accuracy or the maximum number of iterations is reached, and obtain the optimized inter-satellite link topology.
[0031] Specifically, after constructing the inter-satellite link topology optimization model (i.e., the weighted time-varying graph model), the inter-satellite link topology optimization model is first initialized, that is, the optimization variables are determined under the regular grid-like topology link building mode. The initial value of the initial value, and the specific initialization process, are existing technologies and will not be elaborated here. Furthermore, the initial maximum flow under the initial topology, calculated based on the maximum flow algorithm, can be expressed as: , This represents the initial maximum flow. Then, for each satellite, if it is not visible to either the user grid or the sink (i.e., its elevation angle is less than the minimum elevation angle limit), then for the current optimization task, this satellite and its connected inter-satellite links do not participate in the forwarding of service traffic. Therefore, it is defined as a non-critical satellite, and satellites visible to the user grid or sink are selected and marked as critical satellites. These critical satellites are then included in the first satellite set P. Next, based on the initial maximum flow, the inter-satellite link culling index of critical satellites under the current inter-satellite link topology is evaluated. Specifically, the inter-satellite link culling index is calculated based on the following formula: ; in, Indicates the first Inter-satellite link scalability index. The smaller the value, the more likely the first element will be deleted. The smaller the impact on network throughput after adding inter-satellite links, the better. Indicates the initial maximum flow. express Delete the first time Inter-satellite link topology optimization model after adding inter-satellite links. This represents the maximum flow algorithm function. express The inter-satellite link topology optimization model at time 1 after deleting the first... Find the maximum flow after all inter-satellite links. Iterate through all inter-satellite links and delete... The inter-satellite link with the smallest value is identified, and the inter-satellite link topology optimization model is updated for the first time. The updated model is denoted as [model name missing]. Simultaneously, the critical satellites whose inter-satellite links have been disconnected are included in the second satellite set Q. Then, the inter-satellite link reconfigurability index between any two critical satellites in the second satellite set Q is evaluated, specifically calculated based on the following formula: ; in, Indicates key satellites k and key satellites l Inter-satellite link reconfigurability metrics for reconstructing inter-satellite links. Indicates key satellites k and key satellites l Inter-satellite links reconstructed between them Indicates key satellites k and key satellites l The angle between them This represents the maximum inter-satellite elevation angle under the current inter-satellite link topology. Indicates key satellites k and key satellites l Inter-satellite link distance, This represents the maximum inter-satellite link distance under the current inter-satellite link topology. This represents the maximum flow algorithm function. This indicates that, based on the first updated inter-satellite link topology optimization model, on key satellites... k and key satellites l Inter-satellite link topology optimization model after reconstructing inter-satellite links. This indicates that the first updated inter-satellite link topology optimization model is applicable to key satellites. k and key satellites l The maximum flow after reconstructing inter-satellite links, This represents the weighting coefficient, which can be set according to actual needs, for example, all of them can be set to 1. The larger the value, the less interference the inter-satellite link suffers from Earth's obstruction or atmospheric scattering, and the stronger the link establishment stability. The smaller the value, the less the link transmission attenuation, and the better the communication quality and energy efficiency. The larger the value, the greater the throughput. Finally, iterate through steps S32 to S35 until convergence accuracy is achieved (i.e., ...). If the number of iterations is less than a preset threshold, or if the maximum number of iterations is reached, the optimal solution is obtained, thus yielding the optimized inter-satellite link topology optimization model. This yields the optimized inter-satellite link topology.
[0032] Optionally, to avoid invalid cycles of deletion and reconstruction, redundant inter-satellite links that have been deleted need to be excluded during the inter-satellite link reconstruction process.
[0033] It is understood that this invention proposes for the first time an inter-satellite link scalability index and an inter-satellite link reconfigurability index. The inter-satellite link scalability index can accurately quantify the instantaneous impact of a link on network throughput, so as to identify and remove redundant links with the least impact on network performance. The inter-satellite link reconfigurability index comprehensively considers inter-satellite elevation angle, link distance and throughput, and can evaluate and select potential links with high link establishment stability, good communication quality and energy efficiency for reconstruction after link removal. The entire optimization process ensures the efficiency and accuracy of the solution through a two-stage iterative operation of first removing and then reconstructing. Furthermore, the redundant links that have been removed are excluded during the reconstruction process, avoiding invalid link switching cycles.
[0034] In addition, to verify the effectiveness of the inter-satellite link dynamic link establishment method of this invention, simulation experiments were also conducted. Specifically, a visualization platform developed based on the Cesium library was used to perform local region simulations of the algorithm and dynamic topology optimization model. The simulation scenario covered the area surrounding China, including Southeast Asia and the western Pacific Ocean, and was divided into several grids with latitude and longitude of 5°×5°. Figure 4 The satellite constellation distribution is shown. Figure 4 The solid black lines in the diagram represent inter-satellite links. When designing the dynamic topology of the constellation network, this invention is based on the idea of Finite State Automaton (FSA), dividing continuous time into multiple time slices. Each time slice is designed independently; for example, each time slice is set to 20 seconds, and the total time domain is set to 20 minutes, resulting in 60 time slices. Optimized topologies are designed for each time slice, and since the satellite distribution differs within each time slice, different optimized topologies are obtained. The solid red lines in the diagram represent reconstructed inter-satellite links, and the spheres represent gateway stations. The optimized topologies for all time slices are analyzed, and the changes in the number of inter-satellite links and network throughput are statistically analyzed. The statistical results are shown below. Figures 5 to 8 As shown, the inter-satellite link dynamic link establishment method of the present invention greatly reduces the number of inter-satellite links while ensuring the connectivity and performance of the low-Earth orbit satellite constellation network.
[0035] In addition, such as Figure 9 As shown, another embodiment of the present invention also provides a dynamic inter-satellite link establishment system for a low-Earth orbit satellite constellation, preferably employing the dynamic inter-satellite link establishment method for a low-Earth orbit satellite constellation as described above, comprising: The user grid partitioning module is used to partition global users into grids and determine the business traffic of each user grid. The optimization model construction module is used to design objective functions with the number of inter-satellite link savings and network throughput retention as optimization indicators. It constructs an inter-satellite link topology optimization model for low-Earth orbit satellite constellations based on the virtual topology method. In the inter-satellite link topology optimization model, the weight of each link is determined based on the service traffic of the user grid. The model iterative solution module is used to iteratively solve the inter-satellite link topology optimization model to obtain the optimized inter-satellite link topology.
[0036] It is understood that the dynamic inter-satellite link establishment system for the low-Earth orbit (LEO) satellite constellation in this embodiment first divides the global user network into grids and determines the service traffic of each user grid, thus realizing service traffic distribution analysis. Then, when constructing the inter-satellite link topology optimization model, the weight of each link is determined based on the service traffic of the user grid, and the service requirements of the user grid are spatiotemporally mapped with the dynamic coverage of the satellites to drive the on-demand reduction and reconstruction of inter-satellite links. Dynamic topology optimization can be achieved according to regional service requirements and real-time traffic changes. Furthermore, the objective function is designed with the number of inter-satellite link savings and the network throughput retention as optimization indicators. Under the premise of ensuring the connectivity and performance of the LEO satellite constellation network, redundant links are dynamically eliminated and high-value links are reconstructed. This allows low-traffic satellites to focus on reducing redundant links, while high-traffic satellites focus on establishing high-value links to enhance performance. This not only achieves inter-satellite link load balancing but also improves resource utilization, achieving a balance between resource conservation and constellation network performance, which can effectively improve satellite service life and constellation efficiency.
[0037] In addition, another embodiment of the present invention provides an electronic device including a processor and a memory, wherein the memory stores a computer program, and the processor executes the steps of the method described above by calling the computer program stored in the memory.
[0038] In addition, another embodiment of the present invention provides a computer-readable storage medium for storing a computer program for dynamically establishing inter-satellite links for a low-Earth orbit satellite constellation, wherein the computer program executes the steps of the method described above when running on a computer.
[0039] Common computer-readable storage media include: floppy disks, flexible disks, hard disks, magnetic tapes, any other magnetic media, CD-ROMs, any other optical media, punch cards, paper tape, any other physical media with perforated patterns, random access memory (RAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), flash erasable programmable read-only memory (FLASH-EPROM), any other memory chips or cartridges, or any other media readable by a computer. Instructions may further be transmitted or received by a transmission medium. The term transmission medium can include any tangible or intangible medium used to store, encode, or carry instructions for execution by a machine, and includes digital or analog carrier communication signals or intangible media that facilitate communication of such instructions. Transmission media include coaxial cables, copper wires, and optical fibers, which contain conductors for transmitting a bus of computer data signals.
[0040] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code. The solutions in the embodiments of this application can be implemented in various computer languages, such as the object-oriented programming language Java and the interpreted scripting language JavaScript.
[0041] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.
[0042] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.
[0043] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.
[0044] Although preferred embodiments of this application have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments as well as all changes and modifications falling within the scope of this application.
[0045] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the spirit and scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.
[0046] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.
Claims
1. A method for dynamic inter-satellite link establishment in a low-Earth orbit satellite constellation, characterized in that, Includes the following: Divide the global user base into grids and determine the business traffic for each user grid; The objective function is designed with the number of inter-satellite links saved and the amount of network throughput retained as optimization indicators. An inter-satellite link topology optimization model for low-Earth orbit satellite constellations is constructed based on the virtual topology method. In the inter-satellite link topology optimization model, the weight of each link is determined based on the service traffic of the user grid. The inter-satellite link topology optimization model is solved iteratively to obtain the optimized inter-satellite link topology.
2. The method for dynamic inter-satellite link establishment for low-Earth orbit satellite constellations as described in claim 1, characterized in that, The expression for the objective function is: ; in, express Comprehensive optimization indicators at any time and They represent The total number of inter-satellite links before and after optimization at any given moment. and They represent The maximum flow at any given moment before and after optimization.
3. The method for dynamic inter-satellite link establishment for low-Earth orbit satellite constellations as described in claim 1, characterized in that, The process of iteratively solving the inter-satellite link topology optimization model to obtain the optimized inter-satellite link topology includes the following: The inter-satellite link topology optimization model is initialized, and the initial maximum flow is calculated; Assess the criticality of each satellite, mark satellites visible in the user grid or sink as critical satellites, and include critical satellites in the first satellite set; Based on the initial maximum flow, the inter-satellite link simplification index of key satellites under the current inter-satellite link topology is evaluated. At least one inter-satellite link with the smallest inter-satellite link simplification index value is screened and deleted. The inter-satellite link topology optimization model is updated for the first time, and the key satellites whose inter-satellite links are disconnected are included in the second satellite set. Evaluate the inter-satellite link reconfigurability index between any two key satellites in the second satellite set, select at least one inter-satellite link with the largest inter-satellite link reconfigurability index value for reconfiguration, and update the inter-satellite link topology optimization model for the second time. The above process is iterated continuously until the convergence accuracy or the maximum number of iterations is reached, resulting in the optimized inter-satellite link topology.
4. The method for dynamic inter-satellite link establishment for low-Earth orbit satellite constellations as described in claim 3, characterized in that, The inter-satellite link simplification index is calculated based on the following formula: ; in, Indicates the first Inter-satellite link scalability index. Indicates the initial maximum flow. express Delete the first time Inter-satellite link topology optimization model after adding inter-satellite links. This represents the maximum flow algorithm function. express The inter-satellite link topology optimization model at time 1 after deleting the first... Maximum flow after inter-satellite links.
5. The method for dynamic inter-satellite link establishment for a low-Earth orbit satellite constellation as described in claim 3, characterized in that, The inter-satellite link reconfigurability metric is calculated based on the following formula: ; in, Indicates key satellites k and key satellites l Inter-satellite link reconfigurability metrics for reconstructing inter-satellite links. Indicates key satellites k and key satellites l Inter-satellite links reconstructed between them Indicates key satellites k and key satellites l The angle between them This represents the maximum inter-satellite elevation angle under the current inter-satellite link topology. Indicates key satellites k and key satellites l Inter-satellite link distance, This represents the maximum inter-satellite link distance under the current inter-satellite link topology. This represents the maximum flow algorithm function. This indicates that, based on the first updated inter-satellite link topology optimization model, on key satellites... k and key satellites l Inter-satellite link topology optimization model after reconstructing inter-satellite links. This indicates that the first updated inter-satellite link topology optimization model is applicable to key satellites. k and key satellites l The maximum flow after reconstructing inter-satellite links, This represents the weighting coefficient.
6. The method for dynamic inter-satellite link establishment for a low-Earth orbit satellite constellation as described in claim 5, characterized in that, During the inter-satellite link reconstruction process, deleted inter-satellite links must be excluded.
7. The method for dynamic inter-satellite link establishment for a low-Earth orbit satellite constellation as described in claim 1, characterized in that, The service traffic for each user grid is calculated based on the following formula: ; in, This represents the service traffic of the user grid. Indicates the position of the user grid. This represents the population of the user grid. Represents the total global population. This represents the total global business traffic.
8. A dynamic inter-satellite link establishment system for a low-Earth orbit satellite constellation, characterized in that, include: The user grid partitioning module is used to partition global users into grids and determine the business traffic of each user grid. The optimization model construction module is used to design objective functions with the number of inter-satellite link savings and network throughput retention as optimization indicators. It constructs an inter-satellite link topology optimization model for low-Earth orbit satellite constellations based on the virtual topology method. In the inter-satellite link topology optimization model, the weight of each link is determined based on the service traffic of the user grid. The model iterative solution module is used to iteratively solve the inter-satellite link topology optimization model to obtain the optimized inter-satellite link topology.
9. An electronic device, characterized in that, The method includes a processor and a memory, wherein the memory stores a computer program, and the processor executes the steps of the method as described in any one of claims 1 to 7 by calling the computer program stored in the memory.
10. A computer-readable storage medium for storing a computer program for dynamically establishing inter-satellite links for a low-Earth orbit satellite constellation, characterized in that, The computer program, when run on a computer, performs the steps of the method as described in any one of claims 1 to 7.
Citation Information
Patent Citations
Capacity maximization topology design method for Walker constellation
CN115801593B
