A dynamic and static combined topology management method, device and medium based on low-orbit constellation

Abstract

This invention discloses a dynamic and static combined topology management method, device, and medium based on a low-Earth orbit (LEO) constellation, relating to the field of satellite communication. Specifically, the method is computationally simple, can significantly compress storage space, and reduce the occupation of processing and network resources. It can realize complete topology storage of the onboard router and real-time synchronous updates of the entire network topology, which is of great significance for ensuring the reliability and stability of the entire LEO constellation.

Description

Technical Field

[0001] This invention relates to the field of satellite communications, and specifically to a dynamic and static combined topology management method, device, and medium based on a low-Earth orbit constellation. Background Technology

[0002] The statements in this section are provided only as background information in connection with this disclosure and may not constitute prior art.

[0003] Satellite network topology represents the positions and link states between satellite nodes, forming the basis for routing and addressing between them. However, low-Earth orbit (LEO) satellites move at speeds exceeding the first cosmic velocity, and their position information, except for a relatively fixed orbital altitude, involves rapidly changing longitude and latitude. The relative positions and distances between satellite nodes can constantly change due to orbital variations. If a distance-based metric is used to construct the network topology, this topology is constantly evolving, and the computational complexity is unacceptable for onboard processors. In contrast, a hop-count-based network topology, with a constant number of hops between nodes, can mask the continuously changing distance information.

[0004] To update the satellite topology in real time with both regular and irregular changes, the traditional method is to divide the regularly changing topology into multiple time slices according to the change cycle or a fixed time period. Each time slice contains the connection relationships between each node and all other nodes; this relationship can be considered a static topology. Static topology is typically pre-uploaded from the ground. Because it involves storing different topologies across multiple time slices, the storage space for static topology is generally large. Irregular changes, on the other hand, represent the dynamic connection relationships of all nodes in real time and can be considered a dynamic topology. Dynamic topology is generally maintained and updated autonomously on-board, without requiring pre-upload from the ground.

[0005] If the traditional adjacency matrix method is used to store the complete static topology during the constellation's operating cycle, a large amount of storage space is required. Taking 288 satellite nodes as an example, if the time slices are divided into 96, the adjacency matrix storage space for a single time slice is 288*288=81K Byte, and the static storage space for the entire operating cycle is 81K Byte*96=7.6M Byte. This is unacceptable for onboard routers with very limited storage space.

[0006] Conventional methods for dynamic topology storage and synchronization using adjacency matrices, besides consuming significant storage space, primarily suffer from the problem of requiring substantial network and processing resources for topology synchronization. Taking the commonly used adjacency matrix diffusion as an example, a node detecting a dynamic topology change diffuses its topology adjacency matrix to all nodes in the satellite network. Each diffusion message is 81KB. Assuming each node receives two flood packets during the diffusion process, the entire diffusion process consumes 81.2KB * 2^88 * 2 = 45.6MB of network resources. Summary of the Invention

[0007] The purpose of this invention is to provide a static and dynamic topology management method, device, and medium based on a low-Earth orbit (LEO) constellation, which combines static and dynamic topology storage and synchronization while taking into account the storage and processing capabilities of onboard equipment. This method is computationally simple, can significantly compress storage space, and reduce the occupation of processing and network resources. It can realize complete topology storage of onboard routers and real-time synchronous updates of the entire network topology, which is of great significance for ensuring the reliability and stability of the entire LEO constellation.

[0008] Furthermore, this invention addresses the issue of large storage space requirements for static topology by compressing the topology within a complete time slice using a horizontal link state linked list, based on constellation operation rules. This transforms the adjacency matrix, which consumes a significant amount of storage space, into a link state linked list, greatly reducing storage requirements. This invention also addresses the issue of high network resource consumption during dynamic topology synchronization by fully utilizing the characteristics of constellation topology layout. It converts a two-dimensional adjacency matrix into a one-dimensional link ID, thereby reducing the consumption of processing and network resources during topology diffusion.

[0009] The technical solution of the present invention is as follows:

[0010] A dynamic and static topology management method based on low-Earth orbit constellations includes:

[0011] Step S1: By receiving the lateral link status list injected from the ground, identify the lateral links that are regularly interrupted within the effective time window and map them to the static link ID status table;

[0012] Step S2: Establish a dynamic link ID status table based on the satellite node relationship. The dynamic link ID status table is updated based on irregular temporary changes, and the dynamic link ID status table is compressed and then distributed to all neighboring nodes.

[0013] Step S3: Merge the static link ID status table and the dynamic link ID status table.

[0014] Further, step S1 includes:

[0015] Step S11: Receive the horizontal link status list from the ground; the horizontal link status list has two elements, namely: the effective time of each different time slice and the ID of the first orbit satellite node in each horizontal link;

[0016] Step S12: By comparing the effective time of the next lateral link status list with the timer, obtain the ID of the first orbital satellite node in the current regularly interrupted lateral link when the effective time is reached;

[0017] Step S13: Based on the satellite node ID of the first track in the currently regularly interrupted horizontal link, calculate the satellite node IDs of all tracks in the currently regularly interrupted horizontal link and map them to the static link ID status table, which represents the static connection relationship of all links.

[0018] Further, step S2 includes:

[0019] Step S21: Establish a dynamic link ID state table based on the topology of the satellite nodes. In the initial dynamic link ID state table, the topology between all nodes and their neighboring nodes is connected.

[0020] Step S22: Obtain the connection changes between the current node and its neighboring nodes through real-time bidirectional hello detection, including changes from connected to disconnected and from disconnected to restored, and map the changes to the dynamic link ID status table;

[0021] Step S23: After the dynamic link ID status table changes, it is further compressed and then propagated to neighboring nodes.

[0022] Furthermore, the lateral link status list is constructed as follows:

[0023] Step A: According to the satellite's operational patterns, the ground control center divides the satellite's operational cycle into different time slices and records the start time T0 and effective time T of each time slice within the entire operational cycle. i ;

[0024] Step B: Group the satellite nodes horizontally using their IDs;

[0025] Step C: Use a lateral link status list to store the effective time of each time slice and the ID of the first orbital satellite node whose lateral link is interrupted in the current time slice.

[0026] Furthermore, the dynamic link ID status table is constructed as follows:

[0027] Step 1: Number all links within the constellation and generate link IDs;

[0028] Step II: Based on the link ID, convert the link status between all satellite nodes into a one-dimensional dynamic link ID status table and initialize it to a fully connected state;

[0029] Step 3: Obtain the connection changes between the current node and its neighboring nodes through real-time bidirectional hello detection, and map the changes to the dynamic link ID status table.

[0030] Furthermore, the dynamic link ID status table has two elements: link ID and link status; where link status 0 indicates disconnection and 1 indicates connection.

[0031] Furthermore, the connection change includes: changing from connected to disconnected and changing from disconnected to connected.

[0032] Furthermore, the dynamic link ID status table is compressed using binary.

[0033] The present invention also proposes a dynamic-static combined topology management device based on a low-Earth orbit constellation, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps of the dynamic-static combined topology management method based on a low-Earth orbit constellation as described above.

[0034] The present invention also proposes a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the above-described dynamic-static combined topology management method based on a low-Earth orbit constellation.

[0035] The present invention proposes a dynamic and static combined topology management method based on a low-Earth orbit constellation, and its specific application process is as follows:

[0036] First, the ground control center establishes an adjacency topology based on the motion cycle characteristics of the satellite nodes within the constellation and the inter-satellite link connections between the satellite nodes, and represents each node with a satellite ID;

[0037] Secondly, based on the cyclical pattern of constellation operation, satellite node IDs are incorporated into the horizontal link group status list. The latter indicates whether the temporary link of a group of horizontally connected satellites is interrupted. When satellites enter or leave the polar region, the horizontal link group status list is updated to obtain the number of satellite groups whose temporary links are interrupted in the current time slice.

[0038] Then, the non-periodic changes between satellite nodes are represented by the link ID, thereby obtaining the dynamic topology between satellite nodes;

[0039] Finally, when the dynamic topology of the link changes, only the link IDs whose link states have changed are propagated, thereby achieving synchronization of the dynamic topology.

[0040] Compared with existing technologies, the advantages of this invention are:

[0041] This invention, verified through a simulation system, achieves extremely simplified storage of static topology and real-time synchronization of dynamic topology, while significantly reducing the consumption of network and processing resources. Attached Figure Description

[0042] Figure 1 A flowchart illustrating a dynamic and static topology management method based on a low-Earth orbit constellation;

[0043] Figure 2 This is a time slice diagram;

[0044] Figure 3 This is a schematic diagram of a horizontal link;

[0045] Figure 4 This is a diagram illustrating the link ID.

[0046] Figure 5 The intent of the compressed link ID status representation;

[0047] Figure 6 This is a schematic diagram of an inter-satellite link. Detailed Implementation

[0048] It should be noted that relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0049] The features and performance of the present invention will be further described in detail below with reference to embodiments.

[0050] Example 1

[0051] The primary technical challenge addressed in this embodiment is handling the periodic topology changes of satellites, i.e., storing the static topology. However, a satellite's static topology does not remain constant throughout its operational cycle. For example, polar-orbiting satellites typically temporarily interrupt lateral links in high-latitude regions, resulting in topology changes during this period. A common approach is to pre-store these regular changes on the satellite nodes, and then simultaneously switch the topology across all satellite nodes when the satellite is about to enter or leave the polar region. This periodic topology change can be represented using time slices, dividing the regular changes within the satellite's operational cycle into different discrete time slices. This divides a continuous periodic topology into multiple smaller, discrete periodic topologies, facilitating network-wide synchronization during topology switching. A common topology representation is an N*N (N being the number of satellite nodes) neighbor matrix. Storing topology information for multiple different time slices requires T*N*N (T being the number of time slices) of storage space, which is generally insufficient for the large-scale topology storage required by onboard processors. Currently, both operational and planned low-Earth orbit constellations typically have no more than four inter-satellite links: front, rear, left, and right. This means that the vast majority of the content in the N*N adjacency matrix is ​​redundant, allowing for compression of the adjacency matrix. Furthermore, temporary interruptions in inter-satellite links primarily occur in the left and right links, enabling further compression of the static topology.

[0052] The second technical problem to be solved in this embodiment is the storage and synchronization of dynamic topology. Dynamic topology represents the temporary link changes between satellite nodes at the current moment, which cannot be predicted in advance. The commonly used representation method for dynamic topology is also an N*N adjacency matrix. Because dynamic topology only needs to store the link relationships at the current moment, it only needs to store the link relationships of all time slices compared to static topology, so the storage space occupied is relatively small. However, because dynamic topology changes irregularly and cannot be predicted, the changes in dynamic topology need to be diffused between satellites to achieve topology synchronization. If diffusion is carried out in the form of an adjacency matrix, the network resources and processing resources occupied are large, which will put a lot of pressure on the satellite router. Therefore, this embodiment proposes a link ID-based representation method, which converts the two-dimensional adjacency matrix into a one-dimensional link ID. This processing can not only reduce storage space, but also reduce the network resources and processing resources occupied during the diffusion process. On this basis, since there are only two states for link on / off changes, the link ID can be compressed from 1 byte to 1 bit, thereby further reducing the network resources occupied during the diffusion process.

[0053] For details, please refer to Figure 1 A dynamic and static topology management method based on low-Earth orbit constellations includes:

[0054] Step S1: By receiving the lateral link status list injected from the ground, identify the lateral links that are regularly interrupted within the effective time window and map them to the static link ID status table;

[0055] Step S2: Establish a dynamic link ID status table based on the satellite node relationship. The dynamic link ID status table is updated based on irregular temporary changes, and the dynamic link ID status table is compressed and then distributed to all neighboring nodes.

[0056] Step S3: Merge the static link ID status table and the dynamic link ID status table for use in routing table calculation, etc.

[0057] In this embodiment, specifically, step S1 includes:

[0058] Step S11: Receive the horizontal link status list SnapSatList[M] from the ground; the horizontal link status list has two elements, namely: the effective time (M) of each different time slice and the ID of the first orbit satellite node in each horizontal link (M_SatID);

[0059] Step S12: By comparing the effective time of the next lateral link status list with the timer, when the effective time is reached, obtain the first orbit satellite node ID (M_SatID) in the current regularly interrupted lateral link;

[0060] Step S13: Based on the satellite node ID of the first track in the currently regularly interrupted horizontal link, calculate the satellite node IDs of all tracks in the currently regularly interrupted horizontal link and map them to the static link ID status table. The static link ID status table represents the static connection relationship of all links; that is, if the M_SatID temporary link is interrupted, then the temporary links of the satellites (M_SatID, M_SatID+M, ..., M_SatID+(N-1)M) in the corresponding horizontal link group are all interrupted.

[0061] In this specific example, step S2 includes:

[0062] Step S21: Establish a dynamic link ID state table based on the topology of the satellite nodes. In the initial dynamic link ID state table, the topology between all nodes and their neighboring nodes is connected.

[0063] Step S22: Obtain the connection changes between the current node and its neighboring nodes through real-time bidirectional hello detection, including changes from connected to disconnected and from disconnected to restored, and map the changes to the dynamic link ID status table;

[0064] Step S23: After the dynamic link ID status table changes, it is further compressed and then propagated to neighboring nodes.

[0065] In this embodiment, the construction of the lateral link state list (i.e., compressed storage of the static topology) is specifically as follows:

[0066] Step A: According to the satellite's operational patterns, the ground control center divides the satellite's operational cycle into different time slices and records the start time T0 and effective time T of each time slice within the entire operational cycle. i It should be noted that the time slices are divided based on snapshots where the link changes, rather than using a fixed-length method. The polar threshold is set to 70°, meaning that the left and right links are interrupted in areas where the latitude is greater than 70° north or south. Figure 2 As shown;

[0067] Step B: Group the satellite nodes horizontally using IDs; for example... Figure 3 As shown, assuming M represents the number of satellites in orbit and N represents the number of orbits, then any satellite (SatID) has at most four neighbors (front Fr_SatID, back Bk_SatID, left Le_SatID, and right Ri_SatID), satisfying the following relationship:

[0068]

[0069] Step C: Store the effective time of each time slice and the ID of the first orbital satellite node whose lateral link is interrupted in the current time slice using a lateral link status list; as shown in Table 1, if SatID K-P If the temporary link is interrupted, then the satellites in the corresponding lateral link group (SatID) K-P SatID K-P +M, ..., SatID K-P All temporary links (+(N-1)M) are interrupted. Here, K represents the number of time slices, P represents the maximum number of interrupted lateral links within a time slice, and M represents the number of tracks.

[0070] Table 1 Lateral Link Status Table

[0071]

[0072]

[0073] In this specific example, the dynamic link ID status table is constructed as follows:

[0074] Step 1: Number all links within the constellation and generate link IDs; it should be noted that, for example... Figure 4As shown, each satellite node has at most 4 links, namely the front Flk, the rear Blk, the left LlK, and the right Rlk. However, the nodes in the first orbit and the last orbit have only 3 links. The numbering rules are as follows:

[0075] if((sat(i)<N): the first orbit

[0076] Forward Flk: Flk = sat(i);

[0077] Backward Blk: if(sat(i + 1) = N), Blk = sat(i + 1)-N; else Blk = sat(i + 1);

[0078] Left LlK: LlK = NA;

[0079] Right Rlk: Rlk = sat(i)+M;

[0080] else if(sat(i)>M - N): the last orbit

[0081] Forward Flk: Flk = sat(i);

[0082] Backward Blk: if(sat(i + 1) % N == 0), Blk = sat(i + 1)-N; else Blk = sat(i + 1);

[0083] Left LlK: LlK = sat(i)+M - N;

[0084] Right Rlk: Rlk = NA;

[0085] Else: the middle orbit

[0086] Forward Flk: Flk = sat(i);

[0087] Backward Blk: if(sat(i + 1) % N == 0), Blk = sat(i + 1)-N; else Blk = sat(i + 1);

[0088] Left LlK: LlK = sat(i)+M - N;

[0089] Right Rlk: Rlk = sat(i)+M

[0090] Among them, N is the number of satellites in a single orbit, M is the total number of satellites in the entire constellation, NA represents invalid, and sat(i) is the satellite node ID;

[0091] Step II: Based on the link ID, convert the link status between all satellite nodes into a one-dimensional dynamic link ID status table and initialize it to a fully connected state, as shown in Table 2. The dynamic link ID status table has two elements: link ID and link status. Link status 0 indicates disconnection and 1 indicates connection. Each link status occupies 1 byte, that is, the entire link ID status table occupies 2N bytes, where N represents the number of satellite nodes in the constellation.

[0092] Table 2 Initial Dynamic Link ID Status Table

[0093] Link ID 0 1 2 3 4 5 6 7 8 … 2N-1 Link status 1 1 1 1 1 1 1 1 1 1 1

[0094] Step III: Obtain the connection changes between the current node and its neighboring nodes through real-time bidirectional hello detection, and map these changes to the dynamic link ID status table. The connection changes include: changes from connected to disconnected and changes from disconnected to connected. For example, if the link between Sat1 and Sat2 is disconnected, the link status list changes as follows:

[0095] Table 3 Updated Dynamic Link ID Status Table

[0096] Link ID 0 1 2 3 4 5 6 7 8 … 2N-1 Link status 1 1 0 1 1 1 1 1 1 1 1

[0097] In this embodiment, specifically, after the dynamic link ID status table changes, the link ID status table is further compressed to 1 / 8 of its original size and flooded out from all ports. That is, topology synchronization is achieved through the link ID status table. The diffusion message of the link ID status table is as follows:

[0098] Table 4 Link ID Status Table Propagation Message

[0099]

[0100] The source satellite ID is filled with the ID of the reporting satellite node during the first hop of propagation. However, during propagation, this field changes to the ID of the satellite node that receives the message and continues to transmit it. The destination satellite ID is filled with the ID of the satellite receiving the message, and this field also changes continuously during transmission. The message sequence number starts from 0 and is filled by the reporting satellite node, incrementing cumulatively. However, this field cannot be changed during transmission. Additionally, the sequence numbers of messages sent simultaneously to neighbors in the same link ID status table are not incremented. The reporting node ID is the ID of the satellite node that detected the link change, and this field remains unchanged during propagation. The message sequence number plus the reporting node ID serves as a matching field, which can be used as a criterion for preventing message duplication during propagation, thus avoiding message flooding. The link ID status table is a compressed status table, compressing the 2*N byte link ID status table to 2*N / 8 bytes. The compression diagram is shown below. Figure 5 As shown.

[0101] This embodiment also proposes a dynamic-static combined topology management device based on a low-Earth orbit constellation, including: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps of the dynamic-static combined topology management method based on a low-Earth orbit constellation as described above. Preferably, the computer program can run on a terminal device, such as a personal computer.

[0102] This embodiment also proposes a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the above-described dynamic-static combined topology management method based on a low-Earth orbit constellation. However, the apparatus of the present invention is not limited thereto. In this document, the readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0103] A readable medium can be a readable signal medium or a readable storage medium. A readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0104] The computer-readable storage medium may include data signals propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. The readable storage medium may also be any readable medium other than a readable storage medium, capable of transmitting, propagating, or transmitting programs for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the readable storage medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0105] Program code for performing the operations of this invention can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0106] Example 2

[0107] Please see Figure 6 Taking a polar-orbiting constellation of 24*12=288 bytes as an example, the static time slice period, based on the Iridium satellites, involves the mirror image of all satellites within two orbital periods. After this mirror image, 11*2 satellites pass evenly through the polar region, resulting in two topological changes, totaling 44 times. Therefore, dividing the orbital period into 44 time slices facilitates management. Similarly, the currently selected orbital period undergoes 24*2*2=96 topological changes. Therefore, the total storage space requirement for static topology information is 96*288*288 bytes = 7.6 megabytes.

[0108] Using a horizontal link status list, the disconnection and reconstruction of inter-satellite links across different orbits are performed in a W-shaped chain (with a maximum difference of 1-2 seconds). For example, the disconnection and reconstruction of the inter-satellite link between 0-24-48-72-96-120-144-168-192-216-240-264 are performed as a whole. All satellites within the constellation are grouped by W-shaped links, with group 0 representing 0-24-48-72-96-120-144-168-192-216-240-264. Therefore, when the inter-satellite link in group 0 is disconnected, only group 0 needs to be recorded. With a polar threshold of 70°, simulations show that at least 4 and at most 6 W-shaped inter-satellite links are disconnected during a complete operating cycle. Therefore, at time t, only a maximum of 6 satellite IDs from orbit 1 need to be recorded to fully represent the topology of the entire constellation.

[0109] Table 5. Lateral Link ID Status Table for 288 Constellations

[0110]

[0111]

[0112] Therefore, the storage space occupied by the simplified static topology information storage method using the lateral link ID status table is:

[0113] T*(K*M+S), where T is the number of time slices, K is the number of inter-satellite link groups in the high-latitude region, M is the number of bytes occupied by the first orbit satellite ID in each group, and S is the number of bytes occupied by the effective time of the time slice. T is 96, K is 6, M is 1 byte, and S is 4 bytes, requiring a total of only 960 bytes of storage space.

[0114] Table 6 Link ID Status Table for 288 Constellations

[0115] Link ID 0 1 2 3 4 5 6 7 8 … 575 Link status

[0116] For dynamic topology synchronization, the conventional adjacency matrix diffusion method uses 81KByte for each topology packet. During the diffusion process, assuming each node receives two flood packets, the entire diffusion process consumes 81.2K * 288 * 2 = 45.6M Byte of network resources. However, the link ID-based compressed diffusion method uses only 2 * 288 / 8 = 72Byte for each packet's topology content. The diffusion process still uses 72Byte * 288 * 2 = 40.5KByte for the topology content.

[0117] The static topology storage method proposed in this invention, which simplifies the storage space of the static topology using a horizontal link ID status table, significantly reduces the storage space from 7.6 M bytes to 960 bytes, achieving a storage space compression rate of 99.999%, thus greatly saving storage space. The proposed dynamic topology storage and synchronization method based on link IDs significantly reduces the network resource consumption for dynamic topology synchronization from 45.6 M bytes to 40.5 K bytes, a reduction of 99.9%.

[0118] The embodiments described above merely illustrate specific implementation methods of this application, and while the descriptions are detailed and specific, they should not be construed as limiting the scope of protection of this application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of the technical solution of this application, and these modifications and improvements all fall within the scope of protection of this application.

[0119] This background section is provided to generally present the context of the invention. The work of the currently named inventors, the work to the extent described in this background section, and aspects of this section that did not constitute prior art at the time of application are neither expressly nor impliedly acknowledged as prior art to the invention.

Claims

1. A dynamic and static combined topology management method based on a low-Earth orbit constellation, characterized in that, include: Step S1: By receiving the lateral link status list injected from the ground, identify the lateral links that are regularly interrupted within the effective time window and map them to the static link ID status table; Step S2: Establish a dynamic link ID status table based on the satellite node relationship. The dynamic link ID status table is updated based on irregular temporary changes, and the dynamic link ID status table is compressed and then distributed to all neighboring nodes. Step S3: Merge the static link ID status table and the dynamic link ID status table; The horizontal link status list is constructed as follows: Step A: According to the satellite's operational patterns, the ground control center divides the satellite's operational cycle into different time slices and records the start time T0 and effective time T of each time slice within the entire operational cycle. i ; Step B: Group the satellite nodes horizontally using their IDs; Step C: Use a lateral link status list to store the effective time of each time slice and the ID of the first orbital satellite node whose lateral link is interrupted in the current time slice; The dynamic link ID status table is constructed as follows: Step 1: Number all links within the constellation and generate link IDs; Step II: Based on the link ID, convert the link status between all satellite nodes into a one-dimensional dynamic link ID status table and initialize it to a fully connected state; Step 3: Obtain the connection changes between the current node and its neighboring nodes through real-time bidirectional hello detection, and map the changes to the dynamic link ID status table.

2. The dynamic and static combined topology management method based on a low-Earth orbit constellation according to claim 1, characterized in that, Step S1 includes: Step S11: Receive the horizontal link status list from the ground; the horizontal link status list has two elements, namely: the effective time of each different time slice and the ID of the first orbit satellite node in each horizontal link; Step S12: By comparing the effective time of the next lateral link status list with the timer, obtain the ID of the first orbital satellite node in the current regularly interrupted lateral link when the effective time is reached; Step S13: Based on the satellite node ID of the first track in the currently regularly interrupted horizontal link, calculate the satellite node IDs of all tracks in the currently regularly interrupted horizontal link and map them to the static link ID status table, which represents the static connection relationship of all links.

3. The dynamic and static combined topology management method based on a low-Earth orbit constellation according to claim 2, characterized in that, Step S2 includes: Step S21: Establish a dynamic link ID state table based on the topology of the satellite nodes. In the initial dynamic link ID state table, the topology between all nodes and their neighboring nodes is connected. Step S22: Obtain the connection changes between the current node and its neighboring nodes through real-time bidirectional hello detection, including changes from connected to disconnected and from disconnected to connected, and map the changes to the dynamic link ID status table; Step S23: After the dynamic link ID status table changes, it is further compressed and then propagated to neighboring nodes.

4. The dynamic and static combined topology management method based on a low-Earth orbit constellation according to claim 1, characterized in that, The dynamic link ID status table has two elements: link ID and link status; where link status 0 indicates disconnection and 1 indicates connection.

5. A dynamic-static combined topology management method based on a low-Earth orbit constellation according to claim 4, characterized in that, The connection changes include: from connected to disconnected and from disconnected to connected.

6. The dynamic and static combined topology management method based on a low-Earth orbit constellation according to claim 1, characterized in that, The dynamic link ID status table is compressed using binary.

7. A dynamic-static combined topology management device based on a low-Earth orbit constellation, comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, when the processor executes the computer program, it implements the steps of a dynamic-static combined topology management method based on a low-Earth orbit constellation as described in any one of claims 1-6.

8. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements the steps of a dynamic and static combined topology management method based on a low-orbit constellation as described in any one of claims 1-6.

Images