Node sensitivity analysis method influencing huge satellite base communication performance degradation

Through the node sensitivity analysis method, double-row metadata is read and SGP4 track model is initialized, molecular constellations and orbital planes are divided, communication domain and gateway conditions are set, and the communication situation and delay between nodes are calculated, which solves the problem of unmeasurable in the existing technology. The problem of changes in communication performance of giant constellations has achieved effective evaluation of communication performance changes and guaranteed link stability.

CN118944740AActive Publication Date: 2024-11-12HARBIN INST OF TECH
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202411174489.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-26
Publication Date
2024-11-12
Estimated Expiration
2044-08-26

AI Technical Summary

Technical Problem

There is a lack of a method in the prior art to measure the impact and sensitivity of the number of constellation satellites on communication delay performance, and it is impossible to effectively evaluate the changes in communication performance of giant constellations.

Method used

A node sensitivity analysis method is proposed, by reading dual-row metadata, initializing the SGP4 orbital model, dividing molecular constellations and orbital planes, setting communication domains and gateway conditions, calculating the communication situation and delay between nodes, and performing pathfinding analysis. Implement node sensitivity analysis.

Benefits of technology

This method can simply, generally and intuitively measure the performance changes of the communications of giant constellations, reduce the impact on other links, ensure that the link is basically uninterrupted, and is suitable for measuring the latency performance of giant constellations.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118944740A_ABST
    Figure CN118944740A_ABST
Patent Text Reader

Abstract

The invention discloses a node sensitivity analysis method influencing huge satellite base communication performance degradation, and relates to the field of spacecraft system simulation. The problem that in the prior art, a method for measuring the sensitivity of performance changes such as communication time delay caused by the change of the number of satellites in a constellation is lacked is solved. The method comprises the following steps: reading parameter values under different double-row metadata segments according to a format of double-row metadata recording, and storing the parameter values to SGP4 track model structure variables; dividing different sub-constellations in the giant constellation according to the orbit inclination angle or the orbit semi-major axis; satellites in each orbital plane are set to form a routing domain, gateway on-off conditions are set, satellite nodes are set to be capable of communicating in the domains, and connectivity of the nodes in different domains is limited; the connection condition between the nodes is updated, and the on-off condition and time delay between the nodes are output; and path finding is carried out and a path finding result is output so that node sensitivity analysis is completed. And the method is also suitable for the measurement field of giant constellation communication time delay.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to the technical field of spacecraft system simulation. Background Art

[0002] The method for parsing the constellation double-row metadata and realizing orbit recursion in the prior art is:

[0003] Read and identify constellation two-line metadata in a common format;

[0004] Initialize the model according to the SGP4 orbital model and the actual variables read;

[0005] Recursively infer the track status based on the current time.

[0006] Divide routing communication domains and gateways according to constellation configuration:

[0007] The constellation configuration is determined based on the six orbital numbers that make up the constellation satellites: sub-constellations are divided according to the orbital semi-major axis and orbital inclination, the orbital plane is divided according to the right ascension of the ascending node, and the satellites in the orbital plane are numbered and sorted according to the perigee angular distance + mean anomaly angle.

[0008] Satellites on the same orbital plane are divided into the same communication domain, and adjacent satellites (nodes) within the domain can communicate unconditionally.

[0009] Gateway nodes are set up to connect each orbital plane, and the connectivity between gateway nodes is subject to constraints such as relative distance, relative speed, and earth occlusion.

[0010] Find the path based on the node path table:

[0011] According to the above division, considering the intra-domain connectivity, the connectivity between gateway nodes is calculated and a connectivity matrix is ​​generated. If there is no connectivity, the corresponding value is -1, and if there is connectivity, the corresponding value is communication delay.

[0012] Use path-finding algorithms such as Dijkstra algorithm to find all paths from the source node to the target node;

[0013] Record the requested bandwidth for each request and the remaining available bandwidth of the satellite node, and store the path finding results;

[0014] The pathfinding results are retrieved upon request and displayed visually in the software.

[0015] In summary, the current method for measuring constellation communication delay and other performance is based on a fixed constellation that has been designed, and the number of satellites, location distribution and relative phase relationship in the constellation remain basically unchanged. There is a lack of evaluation methods for the impact of dynamic processes such as the dynamic increase or decrease in the number of satellites and constellation reconstruction on performance such as communication delay. In addition, there is a lack of methods to measure the sensitivity of the constellation to changes in the number of satellites, which brings about changes in performance such as communication delay. Summary of the invention

[0016] The present invention aims to solve the problem in the prior art that there is a lack of a method to measure the sensitivity of the constellation to changes in the number of satellites, which leads to changes in performance such as communication delay.

[0017] To solve the above technical problems, the present invention is achieved through the following technical solutions:

[0018] Solution 1: The present invention proposes a node sensitivity analysis method that affects the degradation of the communication performance of the giant star constellation, and the node sensitivity analysis method comprises the following steps:

[0019] Step 1: Read the parameter values ​​under different double-line metadata segments according to the format of the double-line metadata record and save them to the SGP4 orbit model structure variable;

[0020] Step 2: Initialize the orbit model of the SGP4 orbit model structure variable described in step 1 to obtain the six orbit elements under the double-row metadata orbit epoch and the position and velocity under the J2000 coordinate system;

[0021] Step 3: Combine the simulation time and simulation step length to calculate the time difference between the simulation time and the orbit epoch, substitute it into the SGP4 orbit model calculation function, and perform orbit recursion and data output;

[0022] Step 4: Divide the giant constellation into different sub-constellations according to the orbital inclination or the orbital semi-major axis;

[0023] Step 5: based on step 4, divide different orbital planes within the sub-constellation according to the right ascension of the ascending node and the orbital inclination;

[0024] Step 6: Based on step 5, determine the relative phase relationship of the satellites in the orbital plane according to the latitude argument, and sort them;

[0025] Step 7: Based on the orbital plane and sub-constellation divided in step 6, set the satellites in each orbital plane to form a routing domain, set the gateway on / off conditions, set the satellite nodes to be able to communicate within the domain, and limit the connectivity of nodes in different domains;

[0026] Step 8: According to the communication domain and link request set in step 7, update the connectivity between nodes, output the on / off status and delay between nodes, and use it as a reference for the sensitivity test method;

[0027] Step 9: Based on the connectivity between the output nodes calculated in step 8, perform pathfinding and output the pathfinding results to complete the node sensitivity analysis.

[0028] Further, a preferred implementation manner is provided, in step 7, the method of setting the satellite nodes to be able to communicate within the domain and limiting the connectivity of nodes in different domains is:

[0029] Step 71: Collect the double-row metadata, scheduled time and step length of the constellation to be measured;

[0030] Step 72: based on the dual-row metadata of the constellation to be measured, the scheduled time and the step length collected in step 71, obtain the number of available links at the scheduled time;

[0031] Step 73: Calculate the set V1 of nodes whose shortest path edge number to the link source node is 1 and the set V2 of nodes whose shortest path edge number to the link target node is 1 among the available links at the predetermined time; determine whether the intersection V3 of the sets V1 and V2 is an empty set; if the set V3 is not an empty set, proceed to step 74; if the set V3 is an empty set, repeat step 73;

[0032] Step 74: Delete the intersection V3 described in step 73, calculate whether the link source node and the target node in each available link are connected, if there is connectivity, increase the number of shortest path edges to the adjacent nodes of the source and target nodes in step 73, and repeat step 74. If there is no connectivity, record the depth of this deletion and execute step 75;

[0033] Step 75: If the number of available links is greater than the number of link requests, the number of available links at the next moment is calculated, and the constellation to be tested is simulated according to the deletion depth to obtain the number of link requests at the predetermined moment.

[0034] Furthermore, a preferred implementation is provided, in which the method for the node with the shortest path edge number of 1 between the number of source nodes and the number of target nodes described in step seven-three to reach the next adjacent node is that both nodes need to pass through at least one edge to reach the next adjacent node of the source node and the target node.

[0035] Furthermore, a preferred implementation is provided, in which the method for selecting the number of shortest path edges for increasing the nodes to reach the source and destination nodes in step seventy-four is: if the current number of edges of the shortest path is 1, then remove the nodes with at least 1 edge reaching the source and destination nodes, and the number of edges of the remaining nodes to reach the source and destination nodes is at least 2; that is, if the current number of edges of the shortest path is k, remove the nodes with at least k edge reaching the source and destination nodes, and the number of edges of the remaining nodes to reach the source and destination nodes is at least k+1.

[0036] Furthermore, a preferred implementation is provided, in which all links in the number of available links in step seven-two intersect only at the source node and the target node, and the remaining nodes do not overlap.

[0037] Furthermore, a preferred implementation is provided, in which the number of available links in step 72 does not exceed the minimum number of available nodes of the source node and the target node.

[0038] Further, a preferred implementation is provided, in which the number of available links in step 71 is expressed as: n≤min{nsource n destination}, where n is the number of available links, n source is the number of nodes that can connect to the source node, n destination is the minimum number of nodes that the target node can connect to.

[0039] Solution 2: A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the steps of a node sensitivity analysis method affecting the degradation of the communication performance of the Giant Star Constellation as described in any one of Solution 1.

[0040] Solution 3: A computer device includes a memory and a processor, wherein the memory stores a computer program. When the processor runs the computer program stored in the memory, the processor executes a node sensitivity analysis method that affects the degradation of the communication performance of the Superstar constellation as described in any one of Solution 1.

[0041] Solution 4: A computer program product, as a computer program, when the computer program is executed, implements the node sensitivity analysis method that affects the degradation of the communication performance of the Superstar constellation described in Solution 1.

[0042] The present invention is beneficial in that:

[0043] In order to solve the problem in the prior art that there is a lack of a method to measure the sensitivity of the constellation to changes in the number of satellites, which leads to changes in performance such as communication delay, the present invention proposes a node sensitivity analysis method that affects the degradation of the communication performance of the giant star constellation. The method described in the present invention does not consider the configuration of the object and is simple, universal, intuitive and effective.

[0044] The node sensitivity analysis method affecting the degradation of the communication performance of the Giant Star Constellation described in the present invention can meet the task requirements by limiting the depth of deletion and reduce the impact on other links.

[0045] The node sensitivity analysis method affecting the degradation of the communication performance of the Giant Star constellation described in the present invention takes into account the impact of deleting satellite nodes on the link connection in the whole time period, ensuring that the link is basically not interrupted in the set time period.

[0046] The present invention is also applicable to the field of measuring performance such as giant constellation communication delay. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Figure 1 A schematic diagram of the framework of a node sensitivity analysis method that affects the degradation of the communication performance of the Supergiant constellation described in Implementation Method 1.

[0048] Figure 2 This is a complete deletion example diagram described in Implementation Example 10.

[0049] (a) The left figure is a schematic diagram of the original connectivity without processing.

[0050] (a) The right figure is a schematic diagram of the connectivity after removing nodes 1 and 15 from the left figure (a).

[0051] (b) The left picture is a schematic diagram of the connectivity after removing nodes 2 and 20 from the right picture of (a).

[0052] (b) The right picture is a schematic diagram of the connectivity after removing 5 nodes from the left picture of (b).

[0053] (c) The left picture is a schematic diagram obtained by removing nodes 9 and 21 from the right picture of (b).

[0054] (c) The right picture is a schematic diagram of the connectivity after removing 22 nodes from the left picture in (c).

[0055] (d) is a schematic diagram of the connectivity obtained after removing nodes 8 and 16 from the right figure of (c).

[0056] Figure 3 This is a schematic diagram of a curve showing the variation of the delay caused by the path length alone over time in the tenth implementation mode.

[0057] Figure 4 This is a schematic diagram of a curve showing how the total delay considering node delay varies with time according to the tenth implementation mode.

[0058] Figure 5 This is a schematic diagram of a curve showing the variation of communication delay over time according to the tenth implementation mode.

[0059] Figure 6 A flowchart of a node sensitivity analysis method that affects the degradation of the communication performance of the Supergiant constellation as described in Implementation Example 10. DETAILED DESCRIPTION

[0060] In order to make the purpose, technical solutions and advantages of the implementation methods of the present application clearer, the technical solutions in the implementation methods of the present application will be clearly and completely described below in conjunction with the drawings in the implementation methods of the present application. Obviously, the described implementation methods are only part of the implementation methods of the present application, not all of the implementation methods.

[0061] Implementation method 1: This implementation method provides a node sensitivity analysis method that affects the degradation of the communication performance of the giant star constellation. The node sensitivity analysis method comprises the following steps:

[0062] Step 1: Read the parameter values ​​under different double-line metadata segments according to the format of the double-line metadata record and save them to the SGP4 orbit model structure variable;

[0063] Step 2: Initialize the orbit model of the SGP4 orbit model structure variable described in step 1 to obtain the six orbit elements under the double-row metadata orbit epoch and the position and velocity under the J2000 coordinate system;

[0064] Step 3: Combine the simulation time and simulation step length to calculate the time difference between the simulation time and the orbit epoch, substitute it into the SGP4 orbit model calculation function, and perform orbit recursion and data output;

[0065] Step 4: Divide the giant constellation into different sub-constellations according to the orbital inclination or the orbital semi-major axis;

[0066] Step 5: based on step 4, divide different orbital planes within the sub-constellation according to the right ascension of the ascending node and the orbital inclination;

[0067] Step 6: Based on step 5, determine the relative phase relationship of the satellites in the orbital plane according to the latitude argument, and sort them;

[0068] Step 7: Based on the orbital plane and sub-constellation divided in step 6, set the satellites in each orbital plane to form a routing domain, set the gateway on / off conditions, set the satellite nodes to be able to communicate within the domain, and limit the connectivity of nodes in different domains;

[0069] Step 8: According to the communication domain and link request set in step 7, update the connectivity between nodes, output the on / off status and delay between nodes, and use it as a reference for the sensitivity test method;

[0070] Step 9: Based on the connectivity between the output nodes calculated in step 8, perform pathfinding and output the pathfinding results to complete the node sensitivity analysis.

[0071] Implementation method 2: This implementation method further limits the node sensitivity analysis method that affects the degradation of the communication performance of the giant star constellation described in implementation method 1. In step 7, the method of setting the satellite nodes to be able to communicate within the domain and limiting the connectivity of nodes in different domains is as follows:

[0072] Step 71: Collect the double-row metadata, scheduled time and step length of the constellation to be measured;

[0073] Step 72: based on the dual-row metadata of the constellation to be measured, the scheduled time and the step length collected in step 71, obtain the number of available links at the scheduled time;

[0074] Step 73: Calculate the set V1 of nodes whose shortest path edge number to the link source node is 1 and the set V2 of nodes whose shortest path edge number to the link target node is 1 among the available links at the predetermined time; determine whether the intersection V3 of the sets V1 and V2 is an empty set; if the set V3 is not an empty set, proceed to step 74; if the set V3 is an empty set, repeat step 73;

[0075] Step 74: Delete the intersection V3 described in step 73, calculate whether the link source node and the target node in each available link are connected, if there is connectivity, increase the number of shortest path edges to the adjacent nodes of the source and target nodes in step 73, and repeat step 74. If there is no connectivity, record the depth of this deletion and execute step 75;

[0076] Step 75: If the number of available links is greater than the number of link requests, the number of available links at the next moment is calculated, and the constellation to be tested is simulated according to the deletion depth to obtain the number of link requests at the predetermined moment.

[0077] Implementation method three: This implementation method is a further limitation of the node sensitivity analysis method that affects the communication performance degradation of the Giant Star Constellation described in implementation method two. The method for the node with the number of source nodes and the number of target nodes described in step seven-three whose shortest path edge number is 1 to reach the next adjacent node is that both nodes need to pass through at least one edge to reach the next adjacent node of the source node and the target node.

[0078] Implementation method 4. This implementation method is a further limitation of the node sensitivity analysis method that affects the degradation of the communication performance of the Giant Star Constellation described in implementation method 2. In step 74, the method for selecting the number of shortest path edges of adjacent nodes reaching the source and target nodes in step 73 is added as follows: if the current number of shortest path edges is 1, then remove the nodes with at least 1 edge number reaching the source and destination nodes, and the number of edges of the remaining nodes reaching the source and destination nodes is at least 2; that is, if the current number of shortest path edges is k, remove the nodes with at least k edge number reaching the source and destination nodes, and the number of edges of the remaining nodes reaching the source and destination nodes is at least k+1.

[0079] Implementation method five: This implementation method is a further limitation of the node sensitivity analysis method that affects the degradation of the communication performance of the Giant Star Constellation described in implementation method two. All the links in the number of available links described in step seven two only intersect at the source node and the target node, and the remaining nodes do not overlap.

[0080] Implementation method six: This implementation method is a further limitation of the node sensitivity analysis method that affects the degradation of the communication performance of the Giant Star Constellation described in implementation method five. In step seven-two, the number of available links does not exceed the minimum value of the number of available nodes of the source node and the target node.

[0081] Implementation 7. This implementation is a further limitation of the node sensitivity analysis method that affects the degradation of the communication performance of the giant star constellation described in Implementation 6. In step 7.1, the number of available links is expressed as: n≤min{n source n destination}, where n is the number of available links, n source is the number of nodes that can connect to the source node, n destinationis the minimum number of nodes that the target node can connect to.

[0082] Embodiment 8: A computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method described in any one of embodiments 1 to 6 are implemented.

[0083] Embodiment 9: A computer device includes a memory and a processor, wherein the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor executes the method described in any one of embodiments 1 to 7.

[0084] Embodiment 10: A computer program product, which is a computer program, implements the method described in embodiment 1 when the computer program is executed.

[0085] Implementation eleven: This implementation provides an example, which is used to explain the above implementations one to nine. The specific example is as follows:

[0086] See also Figures 1 to 6 To illustrate this implementation, two rows of metadata of the XL constellation on September 18, 2023 are imported, with a total of 4729 satellites. In order to meet the requirements of adjacent connectivity of co-orbital links and position and velocity constraints of off-orbital links, satellites in the same orbital plane are divided into the same domain. According to the current Walker configuration of the XL constellation, there are 194 orbital planes, which can be divided into 194 domains. The number of domains contained in each sub-constellation is shown in Table 1 below.

[0087] Table 1 XL communication domain division

[0088] Sub-constellation Number of communication domains G-1 72 G-4 72 G-2 17 G-3 5 G-5 28

[0089] The simulation process uses the following simplifying assumptions and inferences:

[0090] Simplified Assumption 1: All nodes are allowed to connect to nodes in different domains. Since the inter-orbit forwarding settings of the XL constellation are unknown, in order to obtain all theoretically available links, it is assumed that there is a possibility of establishing links between inter-orbit satellites, that is, nodes in each domain may establish links with nodes in adjacent domains. Therefore, for any node, it is considered that it can be used as a gateway and has the "permission" to connect to nodes outside the domain.

[0091] Considering that there is no need to quantitatively describe the bandwidth and throughput of the XL constellation during the link degradation simulation, but rather qualitatively requires that the throughput be reduced to 1 / 10 of the original, the bandwidth setting of the XL constellation does not use the actual XL uplink and downlink bandwidth. In this link simulation calculation, the bandwidth of the XL satellite is uniformly set to 10Mb / s.

[0092] Simplified Assumption 2: Node bandwidth is consistent. It is assumed that the bandwidth of all nodes is the same, and the bandwidth difference between satellites is not considered.

[0093] Corollary 2-1: All available links between the source and destination only intersect at the source and destination nodes, and the other nodes do not overlap. To achieve the maximum transmission rate, each time a link is established, the node transmission rate on the link is equal to the node bandwidth. Therefore, when other available links are established at the same time, the nodes on the link are unavailable due to full-rate transmission. Ultimately, the available links are independent of each other, presenting a cluster of curves starting from the source node and ending at the destination node, with no intersection between them. For the convenience of description, the concept of "number of available links" is used instead of "throughput rate".

[0094] Corollary 2-2: The number of available links does not exceed the minimum value of the number of available nodes of the source and destination nodes. Based on the above assumptions, since the available links have no intersections with each other, it can be further concluded that the number of available links n must be less than the number of nodes n that can be connected to the source node. source The number of nodes that can be connected to the target node n destination The minimum value of is expressed as:

[0095] n≤min{n source n destination}

[0096] Therefore, under this assumption, the number of available links is restricted by the source and destination coverage multiplicity, and the simulation conditions are shown in Table 2 below.

[0097] Table 2 Details of simulation conditions

[0098]

[0099]

[0100] Time delay includes cumulative path length delay and cumulative node delay, and the relationship between these two delay components is very close. Figure 2 In the figure, the left picture of Figure (a) is the original unprocessed connectivity. First, check whether T-KP, T-KK, and TG have a path that can be connected in one hop. Nodes 1 and 15 meet the conditions. After removing nodes 1 and 15, the connectivity changes from the left picture of Figure (a) to the right picture of Figure (a). Continue to check whether T-KP has a 2-hop path. And remove the nodes that are close to the target node within 2 hops. Nodes 2 and 20 meet the conditions. After removing them, we get the left picture of Figure (b);

[0101] Figure (b) shows whether T-KP has a 3-hop path after removing nodes 2 and 20. Nodes 5 that are close to the target node and within 2 hops are removed. After removing 5 nodes, we get the right figure of Figure (b), which shows whether T-KP has a 4-hop path. Nodes 9 and 21 that are close to the target node and within 2 hops are removed.

[0102] The left picture of Figure (c) is obtained after removing nodes 9 and 21 from the right picture of Figure (b). We continue to check whether T-KP has a 5-hop path. We also remove nodes that are 2 hops away from the target node. Node 22 meets the condition. After removing node 22, we get the right picture of Figure (c). We check whether T-KP has a 6-hop path. We also remove nodes that are 2 hops away from the target node. Nodes 8 and 16 meet the condition.

[0103] The left figure of Figure (d) is consistent with the right figure of Figure (c). The right figure of Figure (d) is the connectivity after removing nodes 8 and 16, and checks whether there is a 7-hop path for T-KP. If there is no T-KP connectivity path, cancel this operation and keep the connectivity of the left figure of Figure (d). Similarly, continue to filter out paths such as TG and T-KK. If all multi-links have been deleted, filter out in the next time step.

[0104] For the processing of connectivity corresponding to different time steps, before removing the node in each step, a check will be performed in other steps to see whether the two places are connected, and then determine whether this operation should be retained.

[0105] See also Figure 3 , Figure 4 As shown, Figure 3 , Figure 4 They are respectively the delay-time curve considering only the path length and the total delay-time curve considering the node delay. Figures 3 to 5 In the figure, G is the time delay variation curve of the shortest path from T to G, KK (Kunsan) is the time delay variation curve of the shortest path from T to KK, KP (Kadena) is the time delay variation curve of the shortest path from T to KP, G-average is the average value of curve G in the time period, KK-average is the average value of the delay connecting KK in the time period, and KP-average is the average value of the curve connecting KP in the time period, which can be used to measure the instantaneous fluctuation and average state of communication delay. It is easy to find that the delay mean varies with the distance of communication, and the operation of the constellation produces a small range of changes in the link length, which in turn produces a small fluctuation in the delay. The total delay is based on the path delay, and the node processing delay is added according to the number of link hops. The delay added for each node is 3.09ms.

[0106] The effect of using this clearing method is as follows:

[0107] Table 3 Changes in request delay before and after clearing

[0108] Link Request Delay before clearing (ms) Delay after clearing (ms) Delay multiple TG 17.1 89 5.2 T-KK 8.78 59.9 6.82 T-KP 6.6 56.4 8.54

[0109] It can be seen that the delay increase multiple meets the requirements. The delay fluctuates greatly, which may be caused by limiting the deletion depth n≤10. Since the number of link hops of TG fluctuates between 2 and 3, with an average value of 2.3, the number of hops after degradation must be at least 10, so the limit of n≤10 is obtained. In addition, it can be seen that the trends of the three links in some periods remain relatively consistent. This is because the mutual occupation of each link request (TG, T-KK, T-KP) is not considered. The calculation process only ensures that multiple paths within a single request do not overlap. Therefore, the similar trends are caused by the partial overlap of the paths of the three requests.

[0110] Figure 1 Any process or method description in the flowchart described in or otherwise described herein can be understood as representing a module, fragment or portion of a code including one or more executable instructions for implementing the steps of a custom logic function or process, and the scope of the preferred embodiment of the present invention includes other implementations, in which the functions may be performed in a substantially simultaneous manner or in a reverse order according to the functions involved, which should be understood by a person skilled in the art of the present invention. The logic and / or steps represented in the flowchart or otherwise described herein illustrate the possible implementation architecture, functions and operations of the apparatus and methods according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for implementing the specified logic function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in an order different from that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in reverse order, depending on the functions involved. It is also noted that each block in the block diagram or flowchart, and combinations of blocks in the block diagram or flowchart, may be implemented by a dedicated hardware-based system that performs the specified functions or operations, or may be implemented by a combination of dedicated hardware and computer instructions. For example, what may be considered as an ordered list of executable instructions for implementing a logical function may be embodied in any computer-readable medium for use by, or in conjunction with, an instruction execution system, apparatus, or device (such as a computer-based system, a system including a processor, or other system that can fetch instructions from and execute instructions in an instruction execution system, apparatus, or device).

[0111] For the purposes of the present specification, "computer-readable medium" may be any device that can contain, store, communicate, propagate or transmit a program for use with an instruction execution system, device or equipment or in conjunction with these instruction execution systems, devices or equipment. More specific examples of computer-readable media (non-exhaustive list) include the following: an electrical connection with one or N wirings (electronic device), a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and editable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program may be printed, because the program may be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, interpreting or processing in other suitable ways as necessary, and then stored in a computer memory. It should be understood that the various parts of the present invention may be implemented in hardware, software, firmware or a combination thereof. In the above embodiments, the N steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented using any one of the following technologies known in the art or a combination thereof: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0112] Those skilled in the art will appreciate that the above are only preferred embodiments of the present invention, and the various embodiments of the present disclosure and / or the features described in the claims may be combined or combined in various ways, even if such combinations or combinations are not explicitly described in the present disclosure. It is not intended to limit the present invention. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art may still modify the technical solutions described in the aforementioned embodiments, or perform equivalent substitutions on some of the technical features therein. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention shall be included in the protection scope of the present invention.

[0113] Although preferred embodiments of the present invention have been described, additional changes and modifications may be made to these embodiments by those skilled in the art once the basic inventive concepts are known. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention. Obviously, those skilled in the art may make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. A node sensitivity analysis method that affects the degradation of the communication performance of the giant star constellation, characterized in that: The method comprises the following steps: Step 1: Read the parameter values ​​under different double-line metadata segments according to the format of the double-line metadata record and save them to the SGP4 orbit model structure variable; Step 2: Initialize the orbit model of the SGP4 orbit model structure variable described in step 1 to obtain the six orbit elements under the double-row metadata orbit epoch and the position and velocity under the J2000 coordinate system; Step 3: Combine the simulation time and simulation step length to calculate the time difference between the simulation time and the orbit epoch, substitute it into the SGP4 orbit model calculation function, and perform orbit recursion and data output; Step 4: Divide the giant constellation into different sub-constellations according to the orbital inclination or the orbital semi-major axis; Step 5: based on step 4, divide different orbital planes within the sub-constellation according to the right ascension of the ascending node and the orbital inclination; Step 6: Based on step 5, determine the relative phase relationship of the satellites in the orbital plane according to the latitude argument, and sort them; Step 7: Based on the orbital plane and sub-constellation divided in step 6, set the satellites in each orbital plane to form a routing domain, set the gateway on / off conditions, set the satellite nodes to be able to communicate within the domain, and limit the connectivity of nodes in different domains; Step 8: According to the communication domain and link request set in step 7, update the connectivity between nodes, output the on / off status and delay between nodes, and use it as a reference for the sensitivity test method; Step 9: Based on the connectivity between the output nodes calculated in step 8, perform pathfinding and output the pathfinding results to complete the node sensitivity analysis.

2. The node sensitivity analysis method affecting the degradation of the communication performance of the giant star constellation according to claim 1 is characterized in that: In step 7, the satellite nodes are set to be able to communicate within the domain. The method of limiting the connectivity of nodes in different domains is as follows: Step 71: Collect the double-row metadata, scheduled time and step length of the constellation to be measured; Step 72: based on the dual-row metadata of the constellation to be measured, the scheduled time and the step length collected in step 71, obtain the number of available links at the scheduled time; Step 73: Calculate the set V1 of nodes whose shortest path edge number to the link source node is 1 and the set V2 of nodes whose shortest path edge number to the link target node is 1 among the available links at the predetermined time; determine whether the intersection V3 of the sets V1 and V2 is an empty set; if the set V3 is not an empty set, proceed to S4; if the set V3 is an empty set, repeat S3; Step 74: Delete the intersection V3 described in step 73, calculate whether the link source node and the target node in each available link are connected, if there is connectivity, increase the number of shortest path edges to the adjacent nodes of the source and target nodes in step 73, and repeat step 74. If there is no connectivity, record the depth of this deletion and execute step 75; Step 75: If the number of available links is greater than the number of link requests, the number of available links at the next moment is calculated, and the constellation to be tested is simulated according to the deletion depth to obtain the number of link requests at the predetermined moment.

3. The node sensitivity analysis method affecting the degradation of the communication performance of the giant star according to claim 2 is characterized in that: The method for the node with the shortest path edge number of the source node number and the target node number as described in step 7-3 to reach the next adjacent node is: both need to pass through at least one edge to reach the next adjacent node of the source node and the target node.

4. The node sensitivity analysis method affecting the degradation of the communication performance of the giant star according to claim 2 is characterized in that: The method for selecting the number of shortest path edges of the adjacent nodes reaching the source and target nodes in step 73 in step 74 is as follows: if the current number of shortest path edges is 1, then remove the nodes with at least 1 edge reaching the source and target nodes, and the number of edges of the remaining nodes reaching the source and target nodes is at least 2; that is, if the current number of shortest path edges is k, remove the nodes with at least k edge reaching the source and target nodes, and the number of edges of the remaining nodes reaching the source and target nodes is at least k+1.

5. The node sensitivity analysis method affecting the degradation of the communication performance of the giant star according to claim 2 is characterized in that: All links in the number of available links described in step 72 intersect only at the source node and the target node, and the remaining nodes do not overlap.

6. The node sensitivity analysis method affecting the degradation of the communication performance of the giant star according to claim 5 is characterized in that: In step 72, the number of available links does not exceed the minimum value of the number of available nodes of the source node and the target node.

7. The node sensitivity analysis method affecting the degradation of the communication performance of the giant star according to claim 6 is characterized in that: The number of available links in step 71 is expressed as: n≤min{n source n destination }, where n is the number of available links, n source is the number of nodes that can connect to the source node, n destination is the minimum number of nodes that the target node can connect to.

8. A computer-readable storage medium, characterized in that The computer-readable storage medium is used to store a computer program, and the computer program executes the method according to any one of claims 1 to 7.

9. A computer device comprising a memory and a processor, characterized in that A computer program is stored in the memory. When the processor runs the computer program stored in the memory, the processor implements the method according to any one of claims 1 to 7.

10. A computer program product, being a computer program, characterized in that When the computer program is executed, the method of claim 1 is implemented.

Citation Information

Patent Citations

  • Hierarchical network operation and maintenance and resource management and control system and method for giant satellite constellation

    CN113328777A

  • Giant constellation collaborative earth observation task planning optimization method and device and medium

    CN116883704A

  • Giant constellation function domain division routing method based on non-dominated sorting genetic algorithm

    CN117424636A

  • Perception-limited giant satellite base state data to-ground transmission path planning method

    CN117614511A