Giant satellite base communication performance degradation analysis method for throughput sensitivity

Through the statistical and time-segmentation technology of constellation double row metadata, the impact of dynamic changes on throughput is evaluated, and the problem of inability to effectively measure the throughput performance of dynamically changing constellation in the existing technology is solved, and more accurate and stable performance evaluation is achieved .

CN119030590AActive Publication Date: 2024-11-26HARBIN INST OF TECH
View PDF 3 Cites 0 Cited by

Patent Information

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

AI Technical Summary

Technical Problem

There is a lack of methods in the prior art to evaluate the impact of dynamically changing constellations on communication throughput performance, especially in the process of satellite number changes and constellation reconstruction, and it is impossible to effectively measure the changes and sensitivity of throughput performance.

Method used

By collecting constellation dual-row metadata, preset time period and step size, statistics and time period splicing available links between satellites, performing simulations to evaluate the average number of available links, adjusting the number of links to reflect actual throughput changes, providing more Accurate performance evaluation.

Benefits of technology

Improve the accuracy of the number of links and throughput changes under dynamically changing constellations, reduce the uncertainty of simulation results, improve the accuracy and practicality of evaluating system performance changes, and achieve a smoother and even throughput Reduce the process.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119030590A_ABST
    Figure CN119030590A_ABST
Patent Text Reader

Abstract

The invention discloses a huge satellite base communication performance degradation analysis method for throughput sensitivity, and aims to solve the problems that in the prior art, a current measurement method for the performance such as constellation throughput is based on a designed fixed constellation, the influence on the performance such as throughput is lack of evaluation, and in addition, the throughput sensitivity is poor. According to the technical scheme provided by the invention, the method comprises the following steps: acquiring double-row metadata of a constellation to be measured, and presetting a specific time period and step length; according to the to-be-measured constellation double-row metadata, presetting a specific time period and step lengths, and obtaining all available links and corresponding satellite names under each step length; performing time period splicing on all the available links, and performing deletion according to a preset standard; and simulating the constellation to be tested according to all the deleted available links to obtain the average number of available links in the preset specific time period. The method is suitable for the sensitivity test of the throughput of the constellation.
Need to check novelty before this filing date? Find Prior Art

Description

Background Art

[0001] In the prior art, the method for parsing the constellation double-row metadata and implementing orbit recursion is:

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

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

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

[0005] The steps to divide the routing communication domain and gateway according to the constellation configuration are:

[0006] 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.

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

[0008] 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.

[0009] The steps of path finding according to the node path table are:

[0010] 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.

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

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

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

[0014] However, the current method for measuring constellation throughput 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 no way to evaluate the impact of dynamic processes such as the dynamic increase or decrease in the number of satellites and constellation reconstruction on performance such as throughput. In addition, there is no method to measure the sensitivity of the constellation to changes in the number of satellites and changes in performance such as throughput. Summary of the invention

[0015] In order to solve the technical problems existing in the prior art, the current measurement method for constellation throughput and other performance is based on a fixed constellation that has been designed, and there is a lack of evaluation method for the impact of dynamic processes such as dynamic increase or decrease in the number of satellites and constellation reconstruction on performance such as throughput, and there is a lack of method for measuring changes in performance such as throughput, the technical solution provided by the present invention is:

[0016] A method for analyzing the performance degradation of giant star communication for throughput sensitivity, comprising:

[0017] The steps of collecting two-row metadata of the constellation to be measured and presetting a specific time period and step length;

[0018] According to the two-row metadata of the constellation to be measured, the preset specific time period and the step length, a step is obtained including all available links and corresponding satellite names under each step length;

[0019] The step of splicing all the available links into time periods and deleting them according to preset standards;

[0020] The step of simulating the constellation to be tested according to all the deleted available links to obtain the average number of available links in the preset specific time period.

[0021] Furthermore, a preferred implementation is provided, which displays all available links and corresponding satellite names at each step size in a table.

[0022] Furthermore, a preferred embodiment is provided, wherein the table includes start and end connection times.

[0023] Furthermore, a preferred implementation is provided, in which in the table, all available links under each step length are arranged in order of start and end connection times.

[0024] Furthermore, a preferred implementation is provided, in which the integer part and the decimal part of all the available links are time-spliced ​​respectively.

[0025] Furthermore, a preferred embodiment is provided, which also includes the step of obtaining the reduction ratio of the average available links.

[0026] Based on the same inventive concept, the present invention also provides a device for analyzing the performance degradation of a giant star constellation communication for throughput sensitivity, comprising:

[0027] A module for collecting two-row metadata of the constellation to be measured and presetting a specific time period and step size;

[0028] According to the two-row metadata of the constellation to be measured, the preset specific time period and the step length, a module including all available links and corresponding satellite names under each step length is obtained;

[0029] A module for splicing all available links into time periods and deleting them according to preset standards;

[0030] A module for simulating the constellation to be tested according to all the deleted available links to obtain an average number of available links in the preset specific time period.

[0031] Based on the same inventive concept, the present invention also provides a computer storage medium for storing a computer program, and when the computer reads the computer program, the computer executes the described method.

[0032] Based on the same inventive concept, the present invention also provides a computer, including a processor and a storage medium. When the processor reads a computer program stored in the storage medium, the computer executes the method described.

[0033] Based on the same inventive concept, the present invention also provides a computer program product, which is a computer program. When the computer program is executed, the method described above is implemented.

[0034] Compared with the prior art, the technical solution provided by the present invention is beneficial in that:

[0035] The present invention provides a method for analyzing the degradation of communication performance of a giant satellite constellation for throughput sensitivity. By dynamically counting and adjusting the connectivity and link throughput between satellites, the challenge of throughput sensitivity testing under dynamically changing constellations is solved. Compared with the traditional static constellation evaluation method, this dynamic counting and splicing method can more accurately reflect the changing trend of the number of links and throughput when the constellation configuration is constantly changing. The effect brought by the dynamic statistics part is to improve the accuracy of the test, making the simulation results closer to the actual satellite operating environment.

[0036] The present invention provides a method for analyzing the degradation of the communication performance of the giant star constellation for throughput sensitivity. Through the time period splicing technology, the scheme can reasonably allocate the time points of link deletion, making the throughput reduction process smoother and more uniform. This splicing method avoids the sudden change phenomenon in the link adjustment process in the traditional method, reduces the uncertainty in the simulation results, and improves the stability and predictability of the results.

[0037] The present invention provides a method for analyzing the degradation of giant star constellation communication performance for throughput sensitivity. Through the step of adjusting the simulation results, the final test results can more accurately reflect the actual throughput after the number of links is reduced. Compared with the static simulation method in the existing research, this adjusted simulation can better simulate the impact of dynamic changes on throughput, and improve the accuracy and practicality of evaluating the impact of constellation dynamic changes on system performance.

[0038] The present invention provides a method for analyzing the degradation of communication performance of a giant star constellation with respect to throughput sensitivity, which is suitable for use in the work of performing sensitivity testing on the throughput of a constellation. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] Figure 1 This is a flowchart of statistical calculations.

[0040] Figure 2 Calculate the flow chart for the integer part.

[0041] Figure 3 Calculate the flow chart for the decimal part.

[0042] Figure 4 This is a schematic diagram of the number of available links before processing;

[0043] Figure 5 Schematic diagram of the number of available links after processing. DETAILED DESCRIPTION

[0044] In order to make the advantages and benefits of the technical solution provided by the present invention more clearly reflected, the technical solution provided by the present invention is now further described in detail with reference to the accompanying drawings, specifically:

[0045] Embodiment 1: This embodiment provides a method for analyzing the degradation of communication performance of a giant star constellation with respect to throughput sensitivity, including:

[0046] The steps of collecting two-row metadata of the constellation to be measured and presetting a specific time period and step length;

[0047] According to the two-row metadata of the constellation to be measured, the preset specific time period and the step length, a step is obtained including all available links and corresponding satellite names under each step length;

[0048] The step of splicing all the available links into time periods and deleting them according to preset standards;

[0049] The step of simulating the constellation to be tested according to all the deleted available links to obtain the average number of available links in the preset specific time period.

[0050] Specific:

[0051] A throughput sensitivity test method for dynamically changing constellations. This method evaluates the impact of dynamic changes in constellation configuration on throughput in a specific time period by counting and splicing inter-satellite connectivity and link throughput. The overall process includes three main steps: counting available links, splicing time periods, and adjusting the number of links based on simulation results.

[0052] include:

[0053] Count available links

[0054] Step input: constellation two-line metadata, specific time period and step size.

[0055] Process: For each time step in the specified time period, count all available links between the source node and the target node. Generate a table containing the start and end connection times by recording all available links and corresponding satellite names between the source node and the target node at each moment.

[0056] Step output: A table containing the number of all available links and the corresponding satellite names at each time step (Table 1).

[0057] Time period splicing

[0058] Step input: Table1 generated by the previous step.

[0059] Process: Sort the records in Table 1 in ascending order according to "End Connection Time" and "Start Connection Time". According to the calculated number of links that need to be reduced, splice the time periods according to the integer part and the decimal part respectively, and select the appropriate time periods and links to delete to ensure that the process of reducing the number of links in a specific time period remains uniform.

[0060] Step output: The concatenated table Table2 contains the reduced link records.

[0061] Adjust the number of links and calculate the simulation results

[0062] Step input: the concatenated table Table2.

[0063] Procedure: According to the link records in Table 2, simulate the constellation system and calculate the average number of available links in a specific period after adjustment.

[0064] Step output: simulation results, including the average number of available links before and after adjustment and their reduction ratio.

[0065] Through the process of statistics, splicing and adjustment, the sensitivity of dynamically changing constellation configuration to throughput is quantitatively analyzed. There is a close logical relationship between the steps, and the output of each step is the input of the next step to ensure the accuracy and effectiveness of the final simulation results.

[0066] Implementation method 2: This implementation method further limits the throughput-sensitive Supergiant constellation communication performance degradation analysis method provided in implementation method 2, and displays all available links and corresponding satellite names under each step size in a table.

[0067] Implementation method three: This implementation method is a further limitation of the Superstar constellation communication performance degradation analysis method for throughput sensitivity provided in implementation method three, wherein the table includes the start and end connection times.

[0068] Implementation method 4: This implementation method is a further limitation of the throughput-sensitive Superstar communication performance degradation analysis method provided in implementation method 1. In the table, all available links under each step size are arranged in the order of start and end connection time.

[0069] Implementation mode 5: This implementation mode further limits the Superstar communication performance degradation analysis method for throughput sensitivity provided in implementation mode 1, and performs time segment splicing on the integer part and the decimal part of all the available links respectively.

[0070] Embodiment 6: This embodiment further limits the Superstar communication performance degradation analysis method for throughput sensitivity provided in embodiment 1, and also includes the step of obtaining the reduction ratio of the average available links.

[0071] Embodiment 7: This embodiment provides a device for analyzing the degradation of communication performance of a giant star constellation for throughput sensitivity, including:

[0072] A module for collecting two-row metadata of the constellation to be measured and presetting a specific time period and step size;

[0073] According to the two-row metadata of the constellation to be measured, the preset specific time period and the step length, a module including all available links and corresponding satellite names under each step length is obtained;

[0074] A module for splicing all available links into time periods and deleting them according to preset standards;

[0075] A module for simulating the constellation to be tested according to all the deleted available links to obtain an average number of available links in the preset specific time period.

[0076] Embodiment 8: This embodiment provides a computer storage medium for storing a computer program. When the computer reads the computer program, the computer executes the method provided in embodiment 1.

[0077] Embodiment 9: This embodiment provides a computer, including a processor and a storage medium. When the processor reads a computer program stored in the storage medium, the computer executes the method provided in embodiment 1.

[0078] Embodiment 10: This embodiment provides a computer program product, which is a computer program. When the computer program is executed, the method provided in embodiment 1 is implemented.

[0079] Implementation Method XI: Combination Figure 1-5 This embodiment is described in detail by using specific examples to further describe the technical solution provided above. Specifically:

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

[0081] Step 2: Based on step 1, the orbit model is initialized according to the physical meaning of the SGP4 orbit model variables to obtain the six orbital elements under the double-row metadata orbit epoch and the position and velocity in the J2000 coordinate system;

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

[0083] Step 4, dividing different sub-constellations within the giant constellation according to orbital inclination or orbital semi-major axis;

[0084] Step 5: Based on step 4, different orbital planes within the sub-constellation are divided according to the right ascension of the ascending node and the orbital inclination;

[0085] Step 6, based on step 5, determine the relative phase relationship of the satellites in the orbital plane according to the latitude argument (the sum of the perigee angular distance and the true anomaly angle), and sort them;

[0086] 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;

[0087] Step 8: According to the communication domain and link request set in step 7, the connectivity between nodes is updated, and the on / off status and delay between nodes are output for reference of the sensitivity test method;

[0088] Step 9: Based on the connectivity calculated in step 8, perform pathfinding and output the pathfinding result.

[0089] By counting the satellite connectivity of the link source and destination nodes within a certain period of time T and splicing the time periods, the number of available links between the source and destination nodes can be reduced, thereby weakening the communication throughput capacity.

[0090] 1. Statistics

[0091] For the step-by-step calculation method, the available link conditions of the two places at a series of times are obtained, including the number of all available links between the source and destination nodes and the corresponding satellite names (numbers) at each time. The neighboring nodes connected to the source node within the time period can be obtained. The neighboring nodes are directly connected to the source and destination nodes, and are not indirectly connected through other nodes. The start and end times of the activation of the neighboring nodes of the source / destination nodes are obtained in chronological order. The specific execution process is as follows:

[0092] Create a new table header Table1: Satellite name (number) Start connection time End connection time

[0093] Read the name (number) Name_j of the neighboring node satellite of the jth link at the i-th time;

[0094] If the table contains Name_j, find the Name_j row and set the end connection time of the row to +1; if the table does not contain the Name_j row, add a Name_j row, set the start connection time of the row to i, and set the end connection time to i;

[0095] This continues until j reaches the number of available links at the current time, and then proceeds to the next time i+1; this continues until i reaches the end time of time period T.

[0096] Flowchart as Figure 1 shown.

[0097] (II) Time period splicing

[0098] Considering that the reduction of the number of available links needs to be kept uniform within the specified time period T, the set of neighboring node satellites connected to the source / destination node within the time period T is called S. This method selects different connected time periods corresponding to the members in S according to certain rules to meet the need for uniform reduction time. The specific steps are:

[0099] For the statistically obtained table Table1, arrange the elements in the table in ascending order by the "End Connection Time" column, and then arrange the elements in the table in ascending order by the "Start Connection Time" column, so as to facilitate splicing and use;

[0100] Get the average number of available links Ca2 in time period T at location D after weight reduction, and then get the average number of links that need to be reduced Cc = Ca1-Ca2, that is, the number of time periods that need to be spliced. Generally, Cc is not an integer, so Cc needs to be decomposed into the integer part CcI and the decimal part CcF, Cc = CcI + CcF, and spliced ​​separately;

[0101] Generate the same table header Table2 as Table1, and set the current number of reduced links Cn = 0;

[0102] Integer part:

[0103]

[0104] Fractional part:

[0105]

[0106] Flowchart as Figure 2 and 3 shown.

[0107] The average number of available links at discrete moments is calculated as follows:

[0108]

[0109] Where, T b is the connection start time, T e is the end time of connectivity, δ step is the step size of discrete operation, T e -T b is δ step Integer multiples of C i T b +i*δ step The number of available links at a given moment.

[0110] The advantages are:

[0111] 1. It does not need to consider the configuration of the object. It is simple, universal, intuitive and effective.

[0112] 2. The task requirements can be met by limiting the deletion depth and reducing the impact on other links;

[0113] 3. Considering the impact of deleting satellite nodes on link connections during the entire period, ensure that the link is basically uninterrupted during the set period.

[0114] The disadvantages are:

[0115] 1. Each time you delete a node, you need to consider the impact of the deletion operation on the whole system, and the process of deleting nodes cannot completely avoid the impact of the deletion order;

[0116] 2. If the step size is reduced or the period is extended, the calculation time increases proportionally;

[0117] 3. In addition, there is no evidence to prove that this method can delete the minimum number of satellites.

[0118] Combination Figure 4-5 , provide experimental examples:

[0119] Import two rows of metadata for the STARLINK constellation on September 18, 2023, for a total of 4729 satellites.

[0120] In order to meet the requirements of adjacent connectivity of co-orbit links and position and velocity constraints of off-orbit 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:

[0121] Table 1 XL communication domain division

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

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

[0124] 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.

[0125] 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.

[0126] 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.

[0127] 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".

[0128] 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:

[0129] n≤min{n source ndestination}

[0130] Therefore, under this assumption, the number of available links is constrained by the number of available source and destination links.

[0131] The simulation conditions are shown in Table 2:

[0132] Table 2 Details of simulation conditions

[0133]

[0134] Under normal circumstances, the average number of available links is maintained between 20 and 22. By analyzing the connectivity of the connected area during this period, and retaining 1 / 10 of the available links, 133 satellites can be removed through statistics and calculations. The results are as follows:

[0135] Table 3 Comparison of available link numbers before and after clearing

[0136]

[0137] The technical solution provided by the present invention is further described in detail above through several specific implementation modes in order to highlight the advantages and benefits of the technical solution provided by the present invention. However, the several specific implementation modes described above are not intended to be used as limitations on the present invention. Any reasonable modification and improvement of the present invention, combination of implementation modes and equivalent substitution within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for analyzing the performance degradation of giant star communication based on throughput sensitivity, characterized in that: include: The steps of collecting two-row metadata of the constellation to be measured and presetting a specific time period and step length; According to the two-row metadata of the constellation to be measured, the preset specific time period and the step length, a step is obtained including all available links and corresponding satellite names under each step length; The step of splicing all the available links into time periods and deleting them according to preset standards; The step of simulating the constellation to be tested according to all the deleted available links to obtain the average number of available links in the preset specific time period.

2. The method for analyzing the performance degradation of the giant star communication system for throughput sensitivity according to claim 1, characterized in that: All available links and corresponding satellite names under each step are displayed in a table.

3. The method for analyzing the performance degradation of the giant star communication system for throughput sensitivity according to claim 2, characterized in that: The table contains the start and end connection times.

4. The method for analyzing the performance degradation of the giant star communication system according to claim 3, wherein: In the table, all available links under each step are arranged in order of start and end connection times.

5. The method for analyzing the performance degradation of the giant star communication system for throughput sensitivity according to claim 1, characterized in that: All the available links, the integer part and the decimal part are time-spliced ​​respectively.

6. The method for analyzing the performance degradation of the giant star communication system for throughput sensitivity according to claim 1, characterized in that: The method also includes the step of obtaining a reduction ratio of the average available links.

7. A device for analyzing the performance degradation of a giant star constellation communication for throughput sensitivity, characterized in that: include: A module for collecting two-row metadata of the constellation to be measured and presetting a specific time period and step size; According to the two-row metadata of the constellation to be measured, the preset specific time period and the step length, a module including all available links and corresponding satellite names under each step length is obtained; A module for splicing all available links into time periods and deleting them according to preset standards; A module for simulating the constellation to be tested according to all the deleted available links to obtain an average number of available links in the preset specific time period.

8. A computer storage medium for storing a computing program, characterized in that: When the computer reads the computer program, the computer executes the method of claim 1.

9. A computer, comprising a processor and a storage medium, characterized in that: When the processor reads the computer program stored in the storage medium, the computer executes the method of claim 1 .

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

  • Inter-satellite link simulation system based on navigational satellite constellation

    CN108337036A

  • Network performance evaluation method and system for space-ground integrated network

    CN112187386A

  • Satellite communication system

    JP1997247069A