Dynamic and static combined topology management method and device based on low-orbit constellation and medium

Abstract

The invention discloses a dynamic and static combined topology management method and device based on a low orbit constellation and a medium, and relates to the field of satellite communication. Specifically, the method is simple in calculation, can greatly compress the storage space, reduces the occupation of processing resources and network resources, can realize the complete topology storage of the spaceborne router and the topology real-time synchronous updating of the whole network, and has important significance for ensuring the reliability and stability of the whole low-orbit constellation.

Description

Technical Field

[0001] The present invention relates to the field of satellite communications, and in particular to a dynamic and static combined topology management method, device and medium based on a low-orbit constellation. Background Art

[0002] The statements in this section merely provide background information related to the present disclosure and may not constitute prior art.

[0003] The satellite network topology represents the position and link status between satellite nodes, and is the basis for routing addressing between satellite nodes. During operation, the speed of low-orbit satellites is greater than the first cosmic speed. In addition to the relatively fixed orbital altitude, the longitude and latitude of the sub-satellite point change rapidly. The relative position and distance between satellite nodes may change all the time due to different orbits. If the network topology is constructed based on distance measurement, the topology will keep changing all the time. The computational overhead of this complexity is unacceptable for the onboard processor. The network topology based on hop count measurement can shield the constantly changing distance information while keeping the routing hop count between nodes unchanged.

[0004] In order to update the regular and irregular changes of satellite topology in real time, the traditional method is to cut the regularly changing topology into multiple time slices according to the change cycle or fixed time. Each time slice contains the connection relationship between each node and all other nodes. This relationship can be regarded as a static topology. Static topology is generally recorded in advance by the ground. Because it involves the storage of different topologies of multiple time slices, the storage space of static topology is generally large. Irregular changes represent the dynamic connection relationship of all current nodes in real time, which can be regarded as a dynamic topology. Dynamic topology is generally maintained and updated autonomously on the satellite, without the need for advance recording on the ground.

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

[0006] The conventional method of using adjacency matrix for dynamic topology storage and synchronization not only takes up a large amount of storage space, but also takes up a lot of network resources and processing resources when synchronizing the topology. Taking the commonly used adjacency matrix diffusion as an example, the node with dynamic topology changes diffuses the topology adjacency matrix to all nodes in the satellite network. Each topology diffusion message is 81K Byte. During the diffusion process, if each node receives 2 flooding packets, the entire diffusion process will consume 81.2K*288*2=45.6MByte of network resources. Summary of the invention

[0007] The purpose of the present invention is to provide a static and dynamic topology management method, device and medium based on a low-orbit constellation in order to realize static topology storage and dynamic topology synchronization in a low-orbit constellation, while taking into account the storage capacity and processing capacity of onboard equipment. The method is simple in calculation, can greatly compress the storage space, and reduce the occupation of processing resources and network resources. It can realize the complete topology storage of onboard routers and the real-time synchronous update of the topology of the entire network, which is of great significance to the reliability and stability of the entire low-orbit constellation.

[0008] Furthermore, the present invention aims at the problem of large storage space of static topology, and according to the operation law of constellation, compresses the topology within the complete time slice through the horizontal link state linked list, thereby converting the adjacency matrix that occupies a large storage space into a link state linked list, greatly reducing the storage space. Aiming at the problem of large network resource occupation by dynamic topology synchronization, the present invention makes full use of the characteristics of constellation topology layout, converts the two-dimensional adjacency matrix into a one-dimensional link ID, thereby reducing the occupation of topology diffusion process processing resources and network resources.

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

[0010] A dynamic and static combined topology management method based on a low-orbit constellation, comprising:

[0011] Step S1: by receiving the horizontal link status list injected from the ground, identifying the regularly interrupted horizontal links within the effective time window, and mapping them to the static link ID status table;

[0012] Step S2: A dynamic link ID state table is established according to the satellite node relationship. The dynamic link ID state table is updated based on irregular temporary changes, and the dynamic link ID state table is compressed and diffused to all neighboring nodes.

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

[0014] Furthermore, the step S1 comprises:

[0015] Step S11: receiving a 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 first orbit satellite node ID in each horizontal link;

[0016] Step S12: Compare the effective time of the next horizontal link state list through the timer, and obtain the first orbit satellite node ID in the horizontal link that is currently regularly interrupted when the effective time is reached;

[0017] Step S13: Based on the satellite node ID of the first orbit in the current regularly interrupted lateral link, the satellite node IDs of all orbits in the current regularly interrupted lateral link are calculated and mapped to the static link ID status table, which represents the static connection relationship of all links.

[0018] Furthermore, the step S2 comprises:

[0019] Step S21: A dynamic link ID state table is established according to the topological relationship of the satellite nodes. The topological relationship between all nodes and neighbor nodes in the initial dynamic link ID state table is in a connected state.

[0020] Step S22: obtaining the connection change between the current node and the adjacent node through real-time bidirectional hello detection, including the change from connected to disconnected and the recovery from disconnected, and mapping the change to the dynamic link ID state table;

[0021] Step S23: After the dynamic link ID state table changes, it is further compressed and diffused to adjacent nodes.

[0022] Furthermore, the construction of the lateral link state list is as follows:

[0023] Step A: According to the satellite operation rules, the ground control center divides the satellite operation cycle into different time slices and records the start time T of the time slice in the entire operation cycle. 0 and the effective time T of each time slice i ;

[0024] Step B: grouping satellite nodes horizontally in the form of IDs;

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

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

[0027] Step I: Number all links in the constellation and generate link IDs;

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

[0029] Step III: Obtain the connection changes between the current node and the adjacent node through real-time bidirectional hello detection, and map the changes into the dynamic link ID state table.

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

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

[0032] Furthermore, the dynamic link ID state table is compressed in binary format.

[0033] The present invention also proposes a dynamic and static combined topology management device based on a low-orbit constellation, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of a dynamic and static combined topology management method based on a low-orbit constellation when executing the computer program.

[0034] The present invention also proposes a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the steps of the above-mentioned dynamic and static combined topology management method based on a low-orbit constellation.

[0035] The present invention proposes a dynamic and static combined topology management method based on a low-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 satellite nodes in the constellation and the inter-satellite link connection relationship between satellite nodes, and represents each node with a satellite ID.

[0037] Secondly, according to the periodic law of the constellation operation, the satellite node ID is compiled into the horizontal link group status list, which indicates whether the temporary link of a group of horizontally connected satellites is interrupted. When the satellite enters and leaves the polar region, the horizontal link group status list is updated to obtain several groups of satellites whose temporary links are interrupted in the current time slice;

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

[0039] Finally, when the dynamic topology of the link changes, only the link ID of the link whose status has changed is diffused, thereby achieving synchronization of the dynamic topology.

[0040] Compared with the prior art, the present invention has the following beneficial effects:

[0041] The present invention realizes extremely simplified storage of static topology and real-time synchronization of dynamic topology through verification of a simulation system, and greatly reduces consumption of network resources and processing resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1 The present invention is a flow chart of a dynamic and static combined topology management method based on a low-orbit constellation;

[0043] Figure 2 It is a schematic diagram of time slice;

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

[0045] Figure 4 is a schematic diagram of link ID;

[0046] Figure 5 It is intended to represent the compressed link ID status;

[0047] Figure 6 This is a schematic diagram of the intersatellite link. DETAILED DESCRIPTION

[0048] It should be noted that relational terms such as "first" and "second" are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0049] The features and performance of the present invention are further described in detail below in conjunction with the embodiments.

[0050] Embodiment 1

[0051] The technical problem to be solved in this embodiment is: the processing of periodic topological changes of satellites, that is, the storage of static topology. However, the static topology of satellites does not remain unchanged during the operation cycle. For example, polar orbit satellites generally temporarily interrupt the horizontal link when they are in high latitudes, and the topology during this period of time has changed. The usual processing method is to store this regular change in the satellite node in advance, and when the satellite is about to enter or leave the polar region, all satellite nodes in the whole network switch the topology at the same time. This periodic topological change can be represented by time slices, that is, the regular changes in the satellite operation cycle are divided into different discrete time slices, so that the topology of a continuous cycle is divided into different small topologies of multiple discrete cycles, which is convenient for the whole network synchronization when the topology is switched. The common topological representation method is the neighbor matrix of N*N (N is the number of satellite nodes). If the topological information of multiple different time slices is to be stored, a storage space of T*N*N (T is the number of time slices) is required, and the storage space of the onboard processor is generally small, which cannot meet the topological storage of such a large space. Currently, the number of intersatellite links in the low-orbit constellations in orbit and those being planned generally does not exceed 4, namely front, back, left, and right. This means that most of the content in the N*N adjacency matrix is ​​redundant, so the adjacency matrix can be compressed based on this feature. At the same time, temporary interruptions of intersatellite links occur in the left and right links, so the static topology can be further compressed on this basis.

[0052] The second technical problem to be solved in this embodiment is: 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 of dynamic topology is also N*N adjacency matrix. Because dynamic topology only needs to store the link relationship at the current moment, it only needs to store the link relationship of all time slices compared to static topology, and the storage space is relatively small. However, because dynamic topology is irregular and unpredictable, this leads to the need for the change of dynamic topology to be diffused between satellites, so that topology synchronization can be achieved. If diffusion is performed in the form of adjacency matrix, the occupied network resources and processing resources are large, which will bring great pressure to the onboard router. Therefore, this embodiment proposes a representation method based on link ID, which converts the two-dimensional adjacency matrix into a one-dimensional link ID. Such processing can not only reduce storage space, but also reduce the occupation of network resources and processing resources in the diffusion process. On this basis, there are only two states for the on / off change of the link, and the link ID can be compressed from 1 byte of space to 1 bit, thereby further reducing the network resource occupation of the diffusion process.

[0053] For details, please refer to Figure 1 , a dynamic and static combined topology management method based on a low-orbit constellation, comprising:

[0054] Step S1: by receiving the horizontal link status list injected from the ground, identifying the regularly interrupted horizontal links within the effective time window, and mapping them to the static link ID status table;

[0055] Step S2: A dynamic link ID state table is established according to the satellite node relationship. The dynamic link ID state table is updated based on irregular temporary changes, and the dynamic link ID state table is compressed and diffused to all neighboring nodes.

[0056] Step S3: The static link ID state table and the dynamic link ID state table are merged for use in routing table calculation, etc.

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

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

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

[0060] Step S13: According to the satellite node ID of the first orbit in the current regularly interrupted lateral link, the satellite node IDs of all orbits in the current regularly interrupted lateral link are calculated and mapped to the static link ID status table, which represents the static connection relationship of all links; that is, if the M_SatID temporary link is interrupted, the corresponding satellite (M_SatID, M_SatID+M, ..., M_SatID+(N-1)M) temporary links in the lateral link group are all interrupted.

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

[0062] Step S21: A dynamic link ID state table is established according to the topological relationship of the satellite nodes. The topological relationship between all nodes and neighbor nodes in the initial dynamic link ID state table is in a connected state.

[0063] Step S22: obtaining the connection change between the current node and the adjacent node through real-time bidirectional hello detection, including the change from connected to disconnected and the recovery from disconnected, and mapping the change to the dynamic link ID state table;

[0064] Step S23: After the dynamic link ID state table changes, it is further compressed and diffused to adjacent nodes.

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

[0066] Step A: According to the satellite operation rules, the ground control center divides the satellite operation cycle into different time slices and records the start time T of the time slice in the entire operation cycle. 0 and the effective time T of each time slice i It should be noted that the division of time slices is based on the snapshot of link changes, rather than a fixed length division. The polar region threshold is set to 70°, that is, the left and right links are interrupted in areas with latitudes greater than 70° north and south; Figure 2 As shown;

[0067] Step B: Group satellite nodes horizontally in the form of IDs; Figure 3 As shown, assuming that M represents the number of satellites in orbit and N represents the number of orbits, the neighbors of any satellite (SatID) are composed of at most four satellites (front Fr_SatID, back Bk_SatID, left Le_SatID, right Ri_SatID), and the following relationship is satisfied:

[0068]

[0069] Step C: Use the lateral link status list to store the effective time of each time slice and the first orbit satellite node ID of the lateral link interruption in the current time slice; as shown in Table 1, if SatID K-P If the temporary link is interrupted, the satellite (SatID K-P , SatID K-P +M, ..., SatID K-P +(N-1)M) temporary links are all interrupted. Where K represents the number of time slices, P represents the maximum number of horizontal links interrupted in a time slice, and M represents the number of tracks.

[0070] Table 1 Horizontal link status table

[0071]

[0072]

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

[0074] Step I: Number all links in the constellation and generate link IDs; it should be noted that, Figure 4As shown, each satellite node has at most 4 links: the front Flk, the rear Blk, the left LlK, and the right Rlk. However, the nodes in the first and last orbits 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: Convert the link status between all satellite nodes into a one-dimensional dynamic link ID status table according to the link ID, and initialize it to a fully connected state, as shown in Table 2; the dynamic link ID status table has two elements, namely: link ID and link status; wherein 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 state 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 change between the current node and the adjacent node through real-time bidirectional hello detection, and map the change to the dynamic link ID state table; the connection change includes: from connected to disconnected and from disconnected to connected; for example, if the link between Sat1 and Sat2 is disconnected, the link state list is changed to:

[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 state table changes, the link ID state table is further compressed to 1 / 8 of the original size and flooded from all ports, that is, topology synchronization is achieved through the link ID state table. The flooding message of the link ID state table is as follows:

[0098] Table 4 Link ID state table diffusion message

[0099]

[0100] The source satellite ID is filled with the ID of the reporting satellite node at the first hop of diffusion, but during the propagation process, this field will become the ID of the satellite node that continues to transmit after receiving the message. The destination satellite ID is filled with the ID of the satellite that receives the message, and this field will also change during the transmission process. The message sequence number starts from 0 and is filled by the reporting satellite node and increases cumulatively, but this field cannot be changed during the transmission process. In addition, the information sequence numbers of the same link ID state table sent to surrounding neighbors at the same time are not accumulated. The reporting node ID is the ID of the satellite node that discovers the link change, and this field remains unchanged during the diffusion process. The message sequence number + reporting node ID is used as a matching field, which can be used as a judgment basis for anti-duplication of diffusion messages to avoid message flooding. The link ID state table is a compressed state table, that is, the link ID state table that occupies 2*N bytes is compressed to 2*N / 8. The compression diagram is as follows Figure 5 shown.

[0101] This embodiment also proposes a dynamic and static combined topology management device based on a low-orbit constellation, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of a dynamic and static combined topology management method based on a low-orbit constellation as described above when executing the computer program; preferably, the computer program can be executed on a terminal device, such as a personal computer.

[0102] This embodiment also proposes a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the steps of a dynamic and static combined topology management method based on a low-orbit constellation as described above; however, the device of the present invention is not limited to this. In this document, the readable storage medium can be any tangible medium that contains or stores a program, which can be used by or in combination with an instruction execution system, device or device.

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

[0104] The computer readable storage medium may include a data signal propagated in a baseband or as part of a carrier wave, wherein a readable program code is carried. This propagated data signal may take a variety of forms, including but not limited to an electromagnetic signal, an optical signal, or any suitable combination of the above. The readable storage medium may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by an instruction execution system, an apparatus, or a device or used in combination with it. The program code contained on the readable storage medium may be transmitted with any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the above.

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

[0106] Embodiment 2

[0107] See also Figure 6 , taking the polar orbit constellation of 24*12=288 as an example, the static time slice period is selected according to Iridium. After all satellites are mirrored in two orbital periods, 11*2 satellites evenly pass through the polar region and there are two topological changes, a total of 44 times. Therefore, the orbital period is divided into 44 time slices for easy management. Based on the same logic, the currently selected orbital period undergoes 24*2*2=96 topological changes. Therefore, the total storage space requirement for static topological information is 96*288*288Byte=7.6M Byte.

[0108] Through the horizontal link status linked list, the disconnection and reconstruction of intersatellite links in different orbits are carried out in the form of W-shaped handles (with a maximum difference of 1 to 2 seconds). For example, the disconnection and reconstruction of the intersatellite links between 0-24-48-72-96-120-144-168-192-216-240-264 are carried out as a whole. All satellites in the constellation are classified into groups according to W-shaped links, that is, group 0 represents 0-24-48-72-96-120-144-168-192-216-240-264. Therefore, when the intersatellite link of group 0 is disconnected, only the number group 0 needs to be recorded. When the polar threshold is 70°, it is found through simulation that in a complete operation cycle, at least 4 groups and at most 6 groups of "W"-shaped intersatellite links are disconnected. Therefore, at time t, only 6 satellite IDs of the first orbit need to be recorded to fully represent the topological relationship of the entire constellation.

[0109] Table 5 Horizontal link ID status table of 288 constellation

[0110]

[0111]

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

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

[0114] Table 6 Link ID status table of 288 constellation

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

[0116] For the synchronization of dynamic topology, conventional adjacency matrix diffusion is used, and each topology message is 81KByte. During the diffusion process, each node receives two flooding packets, and the entire diffusion process will consume 81.2K*288*2=45.6M Byte of network resources. However, based on the link ID compression diffusion method, each message topology content only occupies 2*288 / 8=72Byte. The diffusion process is still calculated based on each node receiving two flooding packets. The entire diffusion process topology content only consumes 72Byte*288*2=40.5K Byte.

[0117] The static topology storage method proposed by the present invention through the simplification of the horizontal link ID state table greatly compresses the storage space of the static topology from 7.6M Byte to 960Byte, and the storage space compression rate reaches 99.999%, which greatly saves the storage space of the static topology. The proposed dynamic topology storage and synchronization method based on link ID greatly reduces the network resource consumption of dynamic topology synchronization from 45.6M Byte to 40.5K Byte, reducing network resource consumption by 99.9%.

[0118] The above-mentioned embodiments only express the specific implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the protection scope of the present application. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the technical solution concept of the present application, and these all belong to the protection scope of the present application.

[0119] This background section is provided to generally present the context of the invention, and the work of the presently 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 explicitly nor implicitly admitted to be prior art to the present invention.

Claims

1. A dynamic and static combined topology management method based on low-orbit constellation, characterized in that: include: Step S1: by receiving the horizontal link status list injected from the ground, identifying the regularly interrupted horizontal links within the effective time window, and mapping them to the static link ID status table; Step S2: A dynamic link ID state table is established according to the satellite node relationship. The dynamic link ID state table is updated based on irregular temporary changes, and the dynamic link ID state table is compressed and diffused to all neighboring nodes. Step S3: Merge the static link ID state table and the dynamic link ID state table.

2. According to claim 1, a dynamic and static combined topology management method based on a low-orbit constellation is characterized in that: The step S1 comprises: Step S11: receiving the horizontal link status list recorded on the ground; the horizontal link status list has two elements, namely: the effective time of each different time slice and the first orbit satellite node ID in each horizontal link; Step S12: Compare the effective time of the next horizontal link state list through the timer, and obtain the first orbit satellite node ID in the horizontal link that is currently regularly interrupted when the effective time is reached; Step S13: Based on the satellite node ID of the first orbit in the current regularly interrupted lateral link, the satellite node IDs of all orbits in the current regularly interrupted lateral link are calculated and mapped to the static link ID status table, which represents the static connection relationship of all links.

3. The method for dynamic and static combined topology management based on low-orbit constellation according to claim 2 is characterized in that: The step S2 comprises: Step S21: A dynamic link ID state table is established according to the topological relationship of the satellite nodes. The topological relationship between all nodes and neighbor nodes in the initial dynamic link ID state table is in a connected state. Step S22: obtaining the connection change between the current node and the adjacent node through real-time bidirectional hello detection, including the change from connected to disconnected and the recovery from disconnected, and mapping the change to the dynamic link ID state table; Step S23: After the dynamic link ID state table changes, it is further compressed and diffused to adjacent nodes.

4. The method for dynamic and static combined topology management based on low-orbit constellation according to claim 1 is characterized in that: The construction of the lateral link state list is as follows: Step A: According to the satellite operation rules, the ground control center divides the satellite operation cycle into different time slices and records the start time T0 of the time slice in the entire operation cycle and the effective time T0 of each time slice. i ; Step B: grouping satellite nodes horizontally in the form of IDs; Step C: Use the lateral link status list to store the effective time of each time slice and the first satellite node ID whose lateral link is interrupted in the current time slice.

5. The method for dynamic and static combined topology management based on low-orbit constellation according to claim 1 is characterized in that: The dynamic link ID state table is constructed as follows: Step I: Number all links in the constellation and generate link IDs; Step II: Convert the link status between all satellite nodes into a one-dimensional dynamic link ID state table according to the link ID, and initialize it to a fully connected state; Step III: Obtain the connection changes between the current node and the adjacent node through real-time bidirectional hello detection, and map the changes into the dynamic link ID state table.

6. The method for dynamic and static combined topology management based on low-orbit constellation according to claim 5 is characterized in that: The dynamic link ID state table has two elements, namely: link ID and link state; wherein, link state 0 indicates disconnection, and 1 indicates connection.

7. The method for dynamic and static combined topology management based on low-orbit constellation according to claim 6 is characterized in that: The connection change includes: changing from connected to disconnected and recovering from disconnected to connected.

8. The method for dynamic and static combined topology management based on low-orbit constellation according to claim 5 is characterized in that: The dynamic link ID state table is compressed in binary format.

9. A dynamic and static combined topology management device based on a low-orbit constellation, comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor 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 to 8 when executing the computer program.

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

Images