Low earth orbit satellite network measurement method, device, equipment, medium and product

Abstract

The invention relates to a low earth orbit satellite network measurement method, device and equipment, a medium and a product. The method comprises the steps that a topological graph of a low earth orbit satellite network is acquired, an Euler loop is determined according to the topological graph, and the topological graph comprises a plurality of satellite vertexes and edges between the adjacent satellite vertexes; determining a detection path set according to the Euler loop, and determining a report path set according to the detection path set; and collecting network state information of each satellite vertex based on the detection path set, and transmitting the network state information of each satellite vertex to a ground station for network measurement based on the report path set. By adopting the method, the whole-network state measurement of the super-large-scale low-orbit satellite network can be realized.

Description

Technical Field

[0001] This application relates to the field of satellite communication technology, and in particular to a method, apparatus, equipment, medium and product for measuring low-Earth orbit satellite networks. Background Technology

[0002] In recent years, with the continuous development of low-cost satellite platforms and advanced satellite communication equipment, the deployment of ultra-large-scale low-Earth orbit (LEO) satellite constellations has become increasingly widespread, and ultra-large constellation networks have gradually become one of the research hotspots in space network technology. Ultra-large constellation networks deploy hundreds of thousands of satellites in Low Earth Orbit (LEO), providing ground users with low-latency, high-bandwidth global coverage, and are an indispensable supplement to terrestrial networks. Besides some typical LEO satellite constellations, such as Iridium, more and more research is focusing on ultra-large-scale LEO satellite constellations. As the application of ultra-large-scale LEO satellite networks becomes increasingly widespread, effective network measurement research is needed to help satellite networks provide reliable service quality.

[0003] In traditional technology, the measurement of ultra-large-scale low-Earth orbit satellite networks is carried out through in-band network telemetry (INT) network monitoring methods. However, the INT network monitoring method is only a low-level primitive, which can only collect network status information of satellites hop by hop from a single detection path and cannot directly monitor the status of the entire network. Summary of the Invention

[0004] Therefore, it is necessary to provide a method, apparatus, equipment, medium, and product for measuring the entire network status of ultra-large-scale low-Earth orbit satellite networks, addressing the aforementioned technical problems.

[0005] Firstly, this application provides a method for measuring low-Earth orbit satellite networks, including:

[0006] Obtain the topology of the low-Earth orbit satellite network and determine the Eulerian circuit based on the topology, where the topology includes multiple satellite vertices and edges between adjacent satellite vertices;

[0007] The detection path set is determined based on the Euler circuit, and the reporting path set is determined based on the detection path set.

[0008] The network status information of each satellite vertex is collected based on the detection path set, and the network status information of each satellite vertex is transmitted to the ground station for network measurement based on the report path set.

[0009] In one embodiment, determining the probe path set based on the Euler circuit includes:

[0010] Determine the directly connected satellite vertices among multiple satellite vertices, and divide the Eulerian circuit at the directly connected satellite vertices to obtain the initial set of road segments;

[0011] Multiple initial road segments in the initial road segment set are spliced ​​together to obtain the detection path set.

[0012] In one embodiment, the initial road segments in the initial road segment set are spliced ​​together to obtain the detection path set, which includes:

[0013] The initial road segments in the initial road segment set are filtered according to a preset length threshold, and the filtered initial road segments are added to the road segment set to be spliced.

[0014] For initial road segments that are not selected, segmentation is performed at the nearest neighbor satellite vertices of the current level corresponding to the directly connected satellite vertices to obtain current level sub-road segments. The current level sub-road segments are then filtered according to a preset length threshold. The selected current level sub-road segments are added to the set of road segments to be spliced. The unselected current level sub-road segments are updated to the unselected initial road segments. The next level nearest neighbor satellite vertices corresponding to the directly connected satellite vertices are updated to the current level nearest neighbor satellite vertices. The process returns to the step of segmenting the unselected initial road segments at the nearest neighbor satellite vertices of the current level corresponding to the directly connected satellite vertices, until all the segmented current level sub-road segments are selected.

[0015] Adjacent road segments in the set of road segments to be spliced ​​are spliced ​​together to obtain multiple detection paths, and the multiple detection paths constitute a detection path set, wherein the path length of each detection path is less than or equal to a preset length threshold.

[0016] In one embodiment, the unselected initial road segment is the initial road segment with a length greater than a preset length threshold, the selected current level sub-road segment is the current level sub-road segment with a length less than or equal to the preset length threshold, and the unselected current level sub-road segment is the current level sub-road segment with a length greater than the preset length threshold.

[0017] For initial road segments that are not selected, segmentation is performed at the nearest neighbor satellite vertices of the current level corresponding to the directly connected satellite vertices to obtain current level sub-road segments. These current level sub-road segments are then filtered according to a preset length threshold. The selected current level sub-road segments are added to the set of road segments to be spliced, and the unselected current level sub-road segments are updated to include the unselected initial road segments:

[0018] For an initial road segment whose length is greater than a preset length threshold, the nearest neighbor satellite vertex of the current level that is directly connected to the satellite vertex in the initial road segment is determined, and the initial road segment is divided at the nearest neighbor satellite vertex of the current level to obtain the current level sub-road segment;

[0019] The current level sub-segments are filtered according to a preset length threshold. The current level sub-segments with a length less than or equal to the preset length threshold are added to the set of segments to be spliced. The current level sub-segments with a length greater than the preset length threshold that are not filtered are updated to the initial segments that are not filtered.

[0020] In one embodiment, adjacent road segments in the set of road segments to be spliced ​​are spliced ​​together to obtain multiple detection paths, including:

[0021] The longest road segment is determined from the set of road segments to be spliced. Starting with the longest road segment, adjacent road segments are spliced ​​under the constraint of a preset length threshold to obtain multiple detection paths.

[0022] In one embodiment, determining the reporting path set based on the probe path set includes:

[0023] For each probe path in the probe path set, if the endpoint of the probe path is not directly connected to a satellite vertex, determine the shortest path from the endpoint of the path to the nearest directly connected satellite vertex, and obtain the report path set based on the shortest path.

[0024] Secondly, this application also provides a low-Earth orbit satellite network measurement device, comprising:

[0025] The loop determination module is used to obtain the topology map of the low-Earth orbit satellite network and determine the Eulerian circuit based on the topology map, wherein the topology map includes multiple satellite vertices and edges between adjacent satellite vertices.

[0026] The path planning module is used to determine the set of detection paths based on the Eulerian circuit, and to determine the set of reporting paths based on the set of detection paths.

[0027] The network measurement module is used to collect network status information of each satellite vertex based on the detection path set, and to transmit the network status information of each satellite vertex to the ground station for network measurement based on the report path set.

[0028] Thirdly, this application also provides a communication device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to perform the following steps:

[0029] Obtain the topology of the low-Earth orbit satellite network and determine the Eulerian circuit based on the topology, where the topology includes multiple satellite vertices and edges between adjacent satellite vertices;

[0030] The detection path set is determined based on the Euler circuit, and the reporting path set is determined based on the detection path set.

[0031] The network status information of each satellite vertex is collected based on the detection path set, and the network status information of each satellite vertex is transmitted to the ground station for network measurement based on the report path set.

[0032] Fourthly, this application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, performs the following steps:

[0033] Obtain the topology of the low-Earth orbit satellite network and determine the Eulerian circuit based on the topology, where the topology includes multiple satellite vertices and edges between adjacent satellite vertices;

[0034] The detection path set is determined based on the Euler circuit, and the reporting path set is determined based on the detection path set.

[0035] The network status information of each satellite vertex is collected based on the detection path set, and the network status information of each satellite vertex is transmitted to the ground station for network measurement based on the report path set.

[0036] Fifthly, this application also provides a computer program product, including a computer program that, when executed by a processor, performs the following steps:

[0037] Obtain the topology of the low-Earth orbit satellite network and determine the Eulerian circuit based on the topology, where the topology includes multiple satellite vertices and edges between adjacent satellite vertices;

[0038] The detection path set is determined based on the Euler circuit, and the reporting path set is determined based on the detection path set.

[0039] The network status information of each satellite vertex is collected based on the detection path set, and the network status information of each satellite vertex is transmitted to the ground station for network measurement based on the report path set.

[0040] The aforementioned method, apparatus, communication equipment, computer-readable storage medium, and computer program product for measuring low-Earth orbit (LEO) satellite networks acquire a topology map of the LEO satellite network and determine Eulerian circuits based on the topology map. Since an Eulerian circuit is a closed loop that traverses every edge in the topology map, it achieves direct coverage of the entire network. Furthermore, it determines a set of probe paths using Eulerian circuits, enabling the planning of multiple probe paths to cover all ISLs (Integrated Satellite Lines) in a large-scale LEO satellite network, thus achieving full network coverage of the probe path set. Based on the probe path set, it collects network status information for each satellite vertex and transmits this information to the ground station for network measurement based on the reported path set. This achieves the goal of comprehensive collection of satellite network status information, facilitating the monitoring and management of large-scale LEO satellite networks. This method is based on Intense Pointing (INT) for LEO satellite network measurement, thereby enabling fine-grained measurement of the entire LEO satellite network. Attached Figure Description

[0041] To more clearly illustrate the technical solutions in the embodiments of this application or related technologies, the drawings used in the description of the embodiments of this application or related technologies will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0042] Figure 1 This is a flowchart illustrating a low-Earth orbit satellite network measurement method in one embodiment;

[0043] Figure 2 This is a schematic diagram of the Walker-delta constellation in one embodiment;

[0044] Figure 3 This is a schematic diagram of links in a low-Earth orbit satellite network in one embodiment;

[0045] Figure 4 This is a flowchart illustrating the process of determining the detection path set based on an Eulerian circuit in one embodiment.

[0046] Figure 5 This is a flowchart illustrating the process of splicing together the initial road segments in the initial road segment set to obtain the detection path set in one embodiment.

[0047] Figure 6 This is a network topology planar unfolded diagram of a LEO8*6 constellation in one embodiment;

[0048] Figure 7 This is a schematic diagram illustrating the process of obtaining the detection path set in the LEO8*6 constellation in one embodiment;

[0049] Figure 8 This is a schematic diagram of the process for obtaining the report path set in a LEO8*6 constellation in one embodiment;

[0050] Figure 9 This is a flowchart illustrating a low-Earth orbit satellite network measurement method in another embodiment;

[0051] Figure 10 This is a structural block diagram of a low-Earth orbit satellite network measurement device in one embodiment;

[0052] Figure 11 This is an internal structural diagram of a communication device in one embodiment. Detailed Implementation

[0053] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0054] It should be noted that the terms "first," "second," etc., used in this application can be used to describe various elements, but these elements are not limited by these terms. These terms are only used to distinguish the first element from the second element. The terms "comprising" and "having," and any variations thereof, used in this application, are intended to cover non-exclusive inclusion. The term "multiple" used in this application refers to two or more. The term "and / or" used in this application refers to one of the embodiments, or any combination of multiple embodiments.

[0055] Traditionally, the Inductively coupled Intercept (INT) network monitoring method is used to measure the status of ultra-large-scale low-Earth orbit (LEO) satellite networks. INT is a framework for collecting network status information using data plane services, independent of the control plane. It involves embedding telemetry commands in data packets, with forwarding devices filling in the information and reporting it level by level for real-time network status monitoring. However, INT is only a low-level primitive, capable of collecting satellite network status information hop-by-hop from a single probe path. The probe path in INT refers to the forwarding path of the data packet, which is generally the shortest or least-delay path, unable to cover the entire network. Therefore, INT cannot directly monitor the overall network status.

[0056] To address the aforementioned technical challenges, a measurement method for low-Earth orbit (LEO) satellite networks is proposed, which enables full-network status measurement of ultra-large-scale LEO satellite networks.

[0057] In one exemplary embodiment, such as Figure 1 As shown, a method for measuring low-Earth orbit satellite networks is provided. Taking the application of this method to communication equipment as an example, the method includes the following steps 102 to 106. Wherein:

[0058] Step 102: Obtain the topology of the low-Earth orbit satellite network and determine the Eulerian circuit based on the topology. The topology includes multiple satellite vertices and edges between adjacent satellite vertices.

[0059] Among them, the low-Earth orbit (LEO) satellite network is a very large-scale LEO satellite network. Most very large-scale LEO satellite networks adopt a Walker-type constellation structure (a satellite constellation structure designed according to parametric rules), with uniformly distributed and symmetrical circular or elliptical orbits. Several satellites periodically orbit the Earth in each orbit, with all satellites having the same orbital altitude and inclination, and are evenly distributed in each orbit. Based on the orbital inclination, Walker constellations can generally be divided into two categories: polar orbit constellations and inclined orbit constellations. This application's embodiments focus on the Walker-delta constellation, which consists of N×M satellites, where N is the number of orbital planes, M is the number of satellites in each plane, all orbits have the same inclination, and are equidistant along the equator. The difference in right ascension between the ascending nodes of adjacent planes is... M satellites are evenly distributed in each plane, and the phase difference between adjacent satellites is... The phase difference between satellites in adjacent planes is , where F is the phase factor. A Walker-delta constellation can be formally represented as α: NM / N / F, where each satellite can be represented by Sij, representing the j-th satellite in the i-th orbital plane. For example... Figure 2 The diagram shows the structure of a Walker-delta constellation, where solid dots represent satellites and lines connecting satellites represent inter-star links (ISLs). Low-Earth orbit satellite networks also contain satellite-to-ground links, which are links between ground stations and directly connected satellites. Directly connected satellites are those that communicate directly with ground stations. For example... Figure 3 The diagram illustrates links in a low-Earth orbit (LEO) satellite network. Intra-orbit ISLs (Intra-orbit Links) can be categorized into two types: intra-orbit ISLs and inter-orbit ISLs. Intra-orbit ISLs are the ISLs between a satellite and its adjacent satellites within the same orbit, while inter-orbit ISLs are the ISLs between a satellite and its adjacent satellites in adjacent orbits. (See also...) Figure 3 Satellite S11 established two intra-orbit ISLs with satellites S10 and S12, and two inter-orbit ISLs with satellites S01 and S21. For a Walker-delta constellation type LEO satellite network, each satellite has a maximum of four ISLs and can directly communicate with a maximum of four adjacent satellites: satellites adjacent to each other in the same orbit, and satellites adjacent to each other in adjacent orbits. The topology of the LEO satellite network remains relatively constant.

[0060] The topology graph of a low-Earth orbit (LEO) satellite network refers to the topological structure of the LEO satellite network obtained through undirected graph modeling. An Eulerian circuit is a circuit that traverses each edge of the graph exactly once.

[0061] In some implementations, undirected graphs are used because communication between satellites is typically bidirectional. To model the topology of a low-Earth orbit satellite network (with n orbital planes and m satellites in each orbital plane), where the vertex set... It includes multiple satellite vertices, each satellite vertex representing a satellite, i.e., a vertex set. The set of satellites, edge set The set of all inter-satellite links includes edges between adjacent satellite vertices. In the diagram, satellite is denoted by Vij, representing the j-th satellite in the i-th orbital plane. For the orbital plane number, This refers to the satellite's index within each orbital plane. Vertex set. There are a total of nm vertices. In the edge set... In the middle, inter-satellite links are used It means that among them , This can be represented by a pair of vertices. For example, V01-V23 represents the edge between V01 and V23, i.e., the ISL between satellites S01 and S23. The edge set contains 2nm edges. The vertex set of directly connected satellites to the ground station is... express, It is a set A subset of.

[0062] The Hierholzer algorithm (an algorithm for finding Eulerian circuits) is used to find an Eulerian circuit in the topological graph. An Eulerian circuit is a closed circuit that traverses each edge of the topological graph exactly once. Since each satellite in the low-Earth orbit satellite network has 4 inter-satellite links, each satellite vertex in the topological graph has 4 edges, meaning each satellite vertex will be traversed twice by the Eulerian circuit. Therefore, each satellite vertex will appear twice in the Eulerian circuit.

[0063] Step 104: Determine the detection path set based on the Euler circuit, and determine the reporting path set based on the detection path set.

[0064] The probe path set refers to the collection of INT probe paths planned based on the topology and link characteristics of the low-Earth orbit satellite network, used to collect network status information for the entire network. The report path set refers to the collection of report paths used to transmit network status information for the entire network.

[0065] INT has three important types of satellite nodes: (1) INT source satellite node: The INT source satellite is the starting satellite on the probe path. It inserts telemetry instructions between the original header and payload of the probe data packet to specify the network status information that downstream satellite nodes need to collect, such as input ports, output ports, queuing delay, queue occupancy, etc. The INT source satellite encapsulates the network status information into telemetry metadata, embeds its own telemetry metadata at the top of the INT metadata stack, and then forwards the probe data packet. (2) INT transmission satellite node: The INT transmission satellite is the intermediate satellite on the probe path other than the starting and ending points. The INT transmission satellite inserts its own telemetry metadata at the top of the INT metadata stack of the probe data packet and forwards the probe data packet to the downstream satellite node. (3) INT terminal satellite node: The INT terminal satellite is the ending satellite on the probe path. After receiving the probe data packet, the INT terminal satellite adds its own telemetry metadata to the top of the INT metadata stack and then generates a telemetry report. Subsequently, the INT terminal satellite transmits the telemetry report to the directly connected satellite via the reporting path. The directly connected satellite then sends the telemetry report to the ground station for further processing. The INT detection path refers to the path from the INT source satellite node to the INT terminal satellite node.

[0066] In some implementations, the Eulerian circuit is segmented at the directly connected satellite vertices, the length of the segmented segments is verified, and the segments are spliced ​​together to obtain multiple detection paths, which together form a detection path set. Each detection path in the detection path set is identified as directly connected to a satellite vertex, and a report path set is obtained based on the identification results.

[0067] Step 106: Collect network status information of each satellite vertex based on the detection path set, and transmit the network status information of each satellite vertex to the ground station for network measurement based on the report path set.

[0068] In some implementations, after planning and obtaining the set of detection paths and the set of reporting paths, detection data packets are sent to each detection path. The detection data packets collect data along the detection path to gather network status information of each satellite vertex on the detection path.

[0069] Furthermore, when a probe data packet enters the low-Earth orbit satellite network, the INT source satellite node on the probe path inserts telemetry instructions into the probe data packet to indicate the types of telemetry metadata that downstream satellite nodes need to add. Users can customize the network status information to be collected, such as ingress / egress numbers, ingress / egress timestamps, and queuing delays. Simultaneously, the INT source satellite node encapsulates the network status information into telemetry metadata, inserts its own telemetry metadata at the top of the INT metadata stack, and forwards the probe data packet to the next satellite node. Subsequently, at each satellite node on the probe path, the INT transmitting satellite node inserts its own telemetry metadata into the INT metadata stack and forwards the probe data packet to the next satellite node. After receiving the probe data packet, the INT terminal satellite node inserts its own telemetry metadata and extracts the INT telemetry metadata stack to create a telemetry report. The telemetry report contains telemetry metadata from all satellite nodes on the probe path. Finally, the INT terminal satellite node transmits the telemetry report to the directly connected satellite via the report path, and the directly connected satellite then sends the telemetry report to the ground station for further analysis and processing to achieve network measurement.

[0070] Further analysis and processing by the ground station can include statistical analysis of telemetry reports, link quality assessment, real-time network performance monitoring and feedback. Statistical analysis of telemetry reports to identify outliers and trends in the network helps to discover network performance fluctuations and potential problem areas. Link quality assessment, including metrics such as latency, packet loss rate, and bit error rate, helps to identify network bottlenecks and improve transmission protocols. Real-time network performance monitoring and feedback refers to the continuous tracking and feedback of network performance, which helps to promptly identify and resolve network problems, ensuring stable network operation.

[0071] In the aforementioned method for measuring low-Earth orbit (LEO) satellite networks, a topology map of the LEO satellite network is acquired, and Eulerian circuits are determined based on this map. Since an Eulerian circuit is a closed loop that traverses every edge in the topology map, it directly covers the entire network. A set of probe paths is then determined using these Eulerian circuits, allowing for the planning of multiple probe paths to cover all ISLs (Integrated Satellite Lines) in the ultra-large-scale LEO satellite network, thus achieving full network coverage. Network status information for each satellite vertex is collected based on the probe path set, and this information is transmitted to the ground station for network measurement based on the reported path set. This achieves comprehensive collection of satellite network status information, facilitating the monitoring and management of large-scale LEO satellite networks. This method is based on Intense Pointing (INT) for LEO satellite network measurement, thereby enabling fine-grained measurement of the entire LEO satellite network.

[0072] In one exemplary embodiment, such as Figure 4 As shown, in step 104, determining the detection path set based on the Eulerian circuit includes:

[0073] Step 402: Determine the directly connected satellite vertices among the multiple satellite vertices, and divide the Eulerian circuit at the directly connected satellite vertices to obtain the initial set of road segments.

[0074] Step 404: Piece together multiple initial road segments from the initial road segment set to obtain the detection path set.

[0075] The initial set of road segments refers to the set of road segments obtained by dividing the Eulerian circuit at the directly connected satellite vertices.

[0076] In some implementations, directly connected satellite vertices among a plurality of satellite vertices are determined, and the Eulerian circuit is divided at these directly connected satellite vertices to obtain a plurality of initial path segments. These initial path segments constitute an initial path segment set. For example, if the number of directly connected satellite vertices is... Then there will be Euler circuits There are 1 breakpoint, therefore, the initial set of road segments contains 1 breakpoint. There are 1 initial road segment, and the endpoints of each initial road segment belong to the set of directly connected satellite vertices. .

[0077] Under the constraints of a preset length threshold and path length balance, multiple initial road segments from the initial road segment set are concatenated to obtain a detection path set. The preset length threshold refers to the upper limit of the path length, and its constraint is that the length of each detection path in the detection path set should not exceed the preset length threshold. The constraint of path length balance is to minimize the variance of the path lengths in the detection path set, i.e. ,in, This represents the i-th detection path. Indicates the length of the detection path. , where is the average path length. This indicates the number of detection paths in the detection path set. Path length refers to the number of ISLs.

[0078] In this embodiment, since the directly connected satellites communicate directly with the ground station, the starting point and terminal of the detection path should be the directly connected satellite vertices during the time the low-Earth orbit satellite network maintains a connection with the ground station. By dividing the Eulerian circuit at the directly connected satellite vertices, an initial path segment set is obtained. Multiple initial path segments in the initial path segment set are then concatenated to obtain the detection path set. This ensures that the starting point and terminal of the detection path are as directly connected satellite vertices as possible, maximizing end-to-end measurement and meeting the detection path planning requirements under the actual deployment constraints of the ground station. Furthermore, under the constraints of a preset length threshold and path length balance, multiple initial path segments in the initial path segment set are concatenated to obtain the detection path set. Based on the topology model and link characteristics of the ultra-large-scale low-Earth orbit satellite network, an upper limit requirement for the detection path of the ultra-large-scale low-Earth orbit satellite constellation is proposed. This ensures that the length of all detection paths does not exceed the preset length threshold, enabling rapid collection of network status information from satellite nodes, solving the real-time measurement problem of the satellite network, and guaranteeing the timeliness of network-wide monitoring and centralized network control. The constraint of path length balance is taken into account to minimize the variance of path length in the detection path set, avoid excessive path length differences, avoid detection delay, and make it easier to find congested paths, thereby achieving balanced measurement of ultra-large-scale low-Earth orbit satellite networks.

[0079] In one exemplary embodiment, such as Figure 5 As shown, step 504 involves splicing the initial road segments in the initial road segment set to obtain the detection path set, which includes steps 502 to 506. Wherein:

[0080] Step 502: Filter the initial road segments in the initial road segment set according to the preset length threshold, and add the filtered initial road segments to the road segment set to be spliced.

[0081] Step 504: For the initial road segment that has not been selected, segment it at the nearest neighbor satellite vertex of the current level corresponding to the directly connected satellite vertex to obtain the current level sub-road segment. Filter the current level sub-road segment according to the preset length threshold, add the selected current level sub-road segment to the road segment set to be spliced, update the unselected current level sub-road segment to the unselected initial road segment, update the next level nearest neighbor satellite vertex corresponding to the directly connected satellite vertex to the current level nearest neighbor satellite vertex, and return to the step of segmenting the unselected initial road segment at the nearest neighbor satellite vertex of the current level corresponding to the directly connected satellite vertex, until all the segmented current level sub-road segments have been selected.

[0082] Step 506: Connect adjacent road segments in the set of road segments to be spliced ​​to obtain multiple detection paths, and form a detection path set from the multiple detection paths, wherein the path length of each detection path is less than or equal to a preset length threshold.

[0083] Here, the current-level nearest neighbor satellite vertex refers to at least one nearest neighbor satellite vertex used to segment the current road segment that exceeds a preset length threshold. For example, for an initial road segment that has not been filtered out, the current-level nearest neighbor satellite vertex corresponding to the directly connected satellite vertex is at least one satellite vertex that is one ISL away from the directly connected satellite node, and the next-level nearest neighbor satellite vertex corresponding to the directly connected satellite vertex is at least one satellite vertex that is two ISL away from the directly connected satellite node. It can be understood that the distance between the next-level nearest neighbor satellite vertex and the directly connected satellite node is one ISL greater than the distance between the current-level nearest neighbor satellite vertex and the directly connected satellite node.

[0084] In ultra-large-scale low-Earth orbit (LEO) satellite networks, the sheer number of satellites and the complexity of their inter-satellite links and structures significantly increase the complexity. Network status information collected along each probe path must be transmitted to the ground station via a reporting path. The central controller at the ground station needs to make timely decisions to address issues such as real-time traffic changes and link failures. Therefore, each round of network-wide status collection must be completed promptly, as satellite network status collection has real-time requirements. A probe path consists of a series of links, and the length of this link sequence is the probe path length. However, in ultra-large-scale LEO satellite networks, due to the massive number of satellites and inter-satellite links, probe paths can become excessively long, increasing the onboard storage pressure on satellite equipment and impacting the real-time response of global monitoring. Therefore, the length of the probe path should not be too long, placing higher demands on the satellite network's measurement scheme.

[0085] In some implementations, the initial road segments in the initial road segment set are filtered according to a preset length threshold. Initial road segments with a length less than or equal to the preset length threshold are selected and added to the road segment set to be spliced. For initial road segments with a length greater than the preset length threshold that are not selected, further segmentation is performed. The further segmentation process is as follows: the initial road segments that are not selected are segmented at the nearest neighbor satellite vertices of the current level corresponding to the directly connected satellite vertices to obtain current level sub-road segments. The current level sub-road segments are then filtered according to the preset length threshold, and the selected current level sub-road segments are added to the road segment set to be spliced. For any unselected sub-segments at the current level, update them to the unselected initial segments. Determine the next-level nearest neighbor satellite vertices corresponding to the directly connected satellite vertices, update these next-level nearest neighbor satellite vertices to the current-level nearest neighbor satellite vertices, and return to the step of segmenting the unselected initial segments at the current-level nearest neighbor satellite vertices corresponding to the directly connected satellite vertices. Repeat this process until all the segmented current-level sub-segments have been selected, completing the segment selection. After selection, the length of all segments in the set of segments to be spliced ​​is less than or equal to a preset length threshold.

[0086] It should be noted that if all the initial road segments in the initial road segment set are less than or equal to the preset length threshold, there is no need to continue the segmentation process, and it can be directly determined that all the initial road segments in the initial road segment set have been filtered.

[0087] Adjacent road segments in the set of road segments to be spliced ​​are spliced ​​together to obtain multiple detection paths, which together form a detection path set. The path length of each detection path is less than or equal to a preset length threshold.

[0088] In this embodiment, initial road segments in the initial road segment set are filtered according to a preset length threshold. The filtered initial road segments are added to the road segment set to be spliced. Unfiltered initial road segments are further segmented, ensuring that the length of all road segments in the road segment set to be spliced ​​is less than or equal to the preset length threshold. During the splicing of adjacent road segments in the road segment set to be spliced, it is also ensured that the path length of each detection path is less than or equal to the preset length threshold, effectively solving the real-time measurement problem of satellite networks and ensuring the timeliness of network-wide monitoring and centralized network control. Furthermore, for unfiltered initial road segments, after the first segmentation at the nearest neighbor satellite vertex of the current level, the current level sub-road segments are obtained. If there are still unfiltered road segments in the current level sub-road segments with a length greater than the preset length threshold, the current level sub-road segment is segmented a second time at the nearest neighbor satellite vertex of the next level. This segmentation and filtering process is repeated until all road segments are less than or equal to the preset length threshold, and the initial road segment filtering is completed. Thus, it is ensured that all road segments are less than or equal to the preset length threshold. It also ensures that even if the endpoint of the subsequent detection path cannot be a directly connected satellite, it still meets the requirement of being close to a directly connected satellite, thus ensuring, in actual path planning and deployment, that the starting point and ending point of the detection path are directly connected satellites or their neighboring satellites as much as possible.

[0089] In an exemplary embodiment, the unfiltered initial road segment is the initial road segment whose length is greater than a preset length threshold, the filtered current level sub-road segment is the current level sub-road segment whose length is less than or equal to the preset length threshold, and the unfiltered current level sub-road segment is the current level sub-road segment whose length is greater than the preset length threshold.

[0090] For initial road segments that are not selected, they are segmented at the nearest neighbor satellite vertices of the current level corresponding to the directly connected satellite vertices to obtain current level sub-road segments. These current level sub-road segments are then filtered according to a preset length threshold. The selected current level sub-road segments are added to the set of road segments to be spliced, and the unselected current level sub-road segments are updated to unselected initial road segments. This process includes: for initial road segments with a length greater than the preset length threshold, the nearest neighbor satellite vertices of the current level directly connected satellite vertices are determined within the initial road segment. The initial road segment is then segmented at these nearest neighbor satellite vertices to obtain current level sub-road segments. These current level sub-road segments are then filtered according to the preset length threshold. The selected current level sub-road segments with a length less than or equal to the preset length threshold are added to the set of road segments to be spliced, and the unselected current level sub-road segments with a length greater than the preset length threshold are updated to unselected initial road segments.

[0091] In some implementations, for initial road segments whose length exceeds a preset length threshold and are not selected, during the continued segmentation process, the nearest neighbor satellite vertices of the current level directly connected to the satellite vertices can be determined first within the initial road segment. The initial road segment is then segmented at the nearest neighbor satellite vertices of the current level to obtain the current level sub-road segments.

[0092] The current level sub-segments are filtered according to a preset length threshold. Sub-segments with a length less than or equal to the preset length threshold are added to the set of segments to be spliced. For sub-segments with a length greater than the preset length threshold that are not filtered out, the current level sub-segment is updated to the initial segment that was not filtered out, and the segmentation and filtering process continues until all the segmented current level sub-segments have been filtered out.

[0093] In this embodiment of the application, for the initial road segment that is not screened out, it is segmented at the nearest neighboring satellite vertex at the current level corresponding to the directly connected satellite vertex, so that the endpoint of the subsequent detection path can not be a directly connected satellite, but still meets the requirement of being close to a directly connected satellite. In actual path planning and deployment, it is possible to ensure that the starting point and ending point of the detection path are directly connected satellites or their nearest neighboring satellites as much as possible.

[0094] In an exemplary embodiment, multiple detection paths are obtained by splicing adjacent road segments in the set of road segments to be spliced, including: determining the longest road segment in the set of road segments to be spliced, starting with the longest road segment, and splicing adjacent road segments under the limitation of a preset length threshold to obtain multiple detection paths.

[0095] In some implementations, the longest road segment is determined from the set of road segments to be spliced, and the longest road segment is used as the starting point to splice it with adjacent road segments until the longest detection path with a length not exceeding a preset length threshold is formed.

[0096] For example, if the longest road segment is Its adjacent road section is Assuming , If a preset length threshold is set, the two segments are spliced ​​together to obtain a new road segment. Continue to obtain Adjacent road sections Assuming Then the splicing will end. That is, the set of detection paths One of the detection paths Subsequently, following this process, for the remaining road segments, adjacent road segments are spliced ​​together to form segments not exceeding [a certain value]. The longest path is found, and this process continues until all paths have been traversed, thus obtaining the complete set of detection paths. The length of each detection path does not exceed and is close to .

[0097] In this embodiment, starting with the longest road segment in the set of road segments to be spliced, adjacent road segments are spliced ​​within a preset length threshold to obtain multiple detection paths. Each splicing attempt aims to merge shorter road segments into longer ones, ensuring the final generated detection path is as close as possible to the preset length threshold. This approach aims to equalize the lengths of all detection paths to the preset threshold, reducing length differences between different detection paths and minimizing path length variance, thus achieving balanced measurement across the entire network. Furthermore, starting with the longest road segment, splicing is performed with adjacent road segments until a longest detection path with a length not exceeding the preset length threshold is obtained. Each spliced ​​path is the longest possible path, thereby reducing the number of detection paths, the number of detection data packets, and path overlap, minimizing measurement overhead.

[0098] In an exemplary embodiment, determining the report path set based on the probe path set includes: for each probe path in the probe path set, if the path endpoint of the probe path is not a directly connected satellite vertex, determining the shortest path from the path endpoint to the nearest directly connected satellite vertex, and obtaining the report path set based on the shortest path.

[0099] In some implementations, for the set of detection paths The endpoints of the detection path may not be in the set of directly connected satellite vertices. In this context, for example, the endpoint might be a 1-nearest neighbor vertex. If the endpoint of the probe path is not... Within this range, the probe data packet can be transmitted from the path endpoint satellite to the nearest directly connected satellite, and then from the directly connected satellite to the ground station. The shortest path from the path endpoint to the nearest directly connected satellite vertex is taken as a reporting path. Since the probe path endpoint must be the nearest neighbor satellite vertex of the directly connected satellite vertex, this transmission segment is very short and represents the minimum hop count path between the endpoint satellite and the directly connected satellite. If the path endpoint is in... If the path endpoint satellite is a directly connected satellite, it can directly transmit the probe data packets to the ground station without reporting the path.

[0100] In this embodiment, when the endpoint of the detection path is not a directly connected satellite vertex, the shortest path from the endpoint to the nearest directly connected satellite vertex is determined, and a report path set is obtained based on the shortest path. This satisfies the requirement that the report path should be as short as possible, thereby reducing the transmission overhead of network status data and reducing transmission time.

[0101] For example, taking a Walker-delta type LEO 8*6 constellation (8 orbital planes, 6 satellites in each plane) as an example, the planning process of the probe path set is described in detail. Figure 6 The diagram shown is a network topology planar unfolding of the LEO 8*6 constellation, where the preset length threshold for the detection path is set to... =15, the number of ground stations is 3, and the directly connected satellites of the ground stations are S23, S42, and S61. The corresponding directly connected satellite vertices are represented as V23, V42, and V61. The 1-nearest neighbor satellite vertices of directly connected satellite vertex V23 are 4: V22, V24, V13, and V33. The 2-nearest neighbor satellite vertices of directly connected satellite vertex V23 are 8: V21, V25, V03, V43, V12, V32, V14, and V34. The 1-nearest neighbor satellite vertices of directly connected satellite vertex V42 are V41, V43, V32, and V52. The 2-nearest neighbor satellite vertices of directly connected satellite vertex V42 are V40, V44, V22, V62, V31, V51, V33, and V53. The 1-nearest neighbor satellite vertices of directly connected satellite vertex V61 are V60, V62, V51, and V71. The 2-nearest neighbor satellite vertices of directly connected satellite vertex V61 are V65, V63, V41, V01, V50, V70, V52, and V72. The 1-nearest neighbor and 2-nearest neighbor satellite vertices of directly connected satellite vertices V42 and V61 are... Figure 6 Unmarked.

[0102] like Figure 7The diagram illustrates the process of obtaining the probe path set in the LEO 8*6 constellation. First, an Eulerian circuit is obtained from the LEO 8*6 constellation topology. Then, all directly connected satellite vertices are found, and the Eulerian circuit is divided at these vertices. Since there are 3 directly connected satellites in the constellation, there will be 6 breakpoints on the Eulerian circuit, resulting in 6 path segments. The endpoints of each path segment are the directly connected satellite vertices, denoted as V23, V42, and V61, respectively. Figure 7 As shown in (a). Among the 6 road segments detected, 2 segments (Seg3 and Seg6) have a length of 21, exceeding the preset length threshold of 15, therefore requiring further segmentation. Thus, Seg3 and Seg6 are further segmented, with the segmentation point being the 1-nearest neighbor satellite vertex of the directly connected satellite vertex (i.e., the satellite within 1 ISL distance of the directly connected satellite), as shown... Figure 7 As shown in (b), the 1-nearest neighbor satellite vertices on road segment Seg3 are V22 and V62. The 1-nearest neighbor satellite vertices on road segment Seg6 are V62, V60, V71, and V13. Seg3 and Seg6 are divided into 3 and 5 road segments respectively on their corresponding 1-nearest neighbor satellite vertices. Among them, the length of road segment Seg6-2 is found to be 18, which still exceeds the limit, so further division is required. Therefore, Seg6-2 is further divided, and the division point is the 2-nearest neighbor satellite vertex of the directly connected satellite vertex (i.e., the satellite that is 2 ISL distances away from the directly connected satellite), as shown in Figure 7 (c). For example, as Figure 4 As shown, the directly connected satellite vertex V23 has 8 2-nearest neighbor vertices. At this point, all road segments are less than or equal to the preset length threshold.

[0103] Next, adjacent road segments are concatenated into the longest possible segment that does not exceed a preset length threshold. For example, starting with road segment Seg5, since its length is 15, which equals the preset length threshold, Seg5 directly forms a detection path; following a counter-clockwise order, the next road segment is Seg4, since |Seg4| 15 and |Seg4|+|Seg3-5| Therefore, Seg4 cannot be concatenated with Seg3-5, and Seg4 directly forms a detection path; continuing in counter-clockwise order, the next segment is Seg3-5, which is concatenated with Seg3-4 to form a detection path of length 14; and so on, continuing to concatenate the remaining segments to form the longest segment not exceeding 15, until all segments have been traversed, such as... Figure 7 As shown in (d), the final road segments obtained from the above steps constitute the set of detection paths. .

[0104] like Figure 8 The diagram shows the process for obtaining the report path set in the LEO 8*6 constellation. First, for the probe path set... The detection path is used to determine whether the endpoint of each detection path is directly connected to a satellite vertex. Figure 5 As can be seen from the final detection path in (d), the endpoints of four paths are not all directly connected to the satellite vertex, i.e. , , and Their non-directly connected satellite endpoints are V71 and V25. Therefore, it is necessary to find the shortest path from the non-directly connected satellite endpoint to the nearest directly connected satellite vertex as the reporting path. Figure 6 As shown, since V71 is a 1-nearest neighbor satellite directly connected to satellite vertex V61, the reporting path is {V71-V61}, with a reporting path length of 1. Since V25 is a 2-nearest neighbor satellite directly connected to satellite vertex V23, the reporting path is {V25-V24-V23}, with a reporting path length of 2. Therefore, the set of reporting paths is... ={V71-V61, V25-V24-V23}.

[0105] In another exemplary embodiment, such as Figure 9 As shown, a method for measuring low-Earth orbit satellite networks is provided, including the following steps:

[0106] Step 902: Obtain the topology of the low-Earth orbit satellite network and determine the Eulerian circuit based on the topology. The topology includes multiple satellite vertices and edges between adjacent satellite vertices.

[0107] Step 904: Determine the directly connected satellite vertices among the multiple satellite vertices, and divide the Eulerian circuit at the directly connected satellite vertices to obtain the initial set of road segments.

[0108] Step 906: Filter the initial road segments in the initial road segment set according to the preset length threshold, and add the filtered initial road segments to the road segment set to be spliced.

[0109] Step 908: For initial road segments whose length is greater than a preset length threshold but not selected, determine the nearest neighbor satellite vertices of the current level that are directly connected to the satellite vertices in the initial road segments, and divide the initial road segments at the nearest neighbor satellite vertices of the current level to obtain the current level sub-road segments.

[0110] Step 910: Filter the current level sub-segments according to the preset length threshold, and add the current level sub-segments whose length is less than or equal to the preset length threshold to the set of segments to be spliced.

[0111] Step 912: Update the current-level sub-segments whose length exceeds the preset length threshold and are not selected to the initial segments that are not selected. Update the next-level nearest neighbor satellite vertices corresponding to the directly connected satellite vertices to the current-level nearest neighbor satellite vertices. Return to the step of segmenting the initial segments that are not selected at the current-level nearest neighbor satellite vertices corresponding to the directly connected satellite vertices, until all the segmented current-level sub-segments are selected.

[0112] Step 914: Determine the longest road segment in the set of road segments to be spliced, start with the longest road segment, and splice adjacent road segments under the constraint of a preset length threshold to obtain multiple detection paths, and form a detection path set from the multiple detection paths, wherein the path length of each detection path is less than or equal to the preset length threshold.

[0113] Step 916: For each detection path in the detection path set, if the endpoint of the detection path is not directly connected to a satellite vertex, determine the shortest path from the endpoint of the path to the nearest directly connected satellite vertex, and obtain the report path set based on the shortest path.

[0114] Step 918: Collect network status information of each satellite vertex based on the detection path set, and transmit the network status information of each satellite vertex to the ground station for network measurement based on the report path set.

[0115] In this embodiment, based on the topology model and link characteristics of the ultra-large-scale low-Earth orbit (LEO) satellite network, balanced path planning was performed. Under multiple constraints, including the actual deployment location of ground stations and the required probe path length, probe and reporting paths with balanced lengths were planned, which helps ensure the real-time performance of measurements in the ultra-large-scale satellite network. Furthermore, the probe paths achieve minimal path overlap while ensuring full network measurement coverage, thereby reducing additional measurement overhead. Shorter reporting paths facilitate efficient transmission of telemetry reports, ensuring the timeliness of measurement information transmission to ground stations via direct satellite connections. Based on the planned probe and reporting paths, INT probe data packets can perform fine-grained telemetry within the satellite network, thus enabling fine-grained measurements across the entire ultra-large-scale LEO constellation.

[0116] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages in other steps. It is understood that the steps in different embodiments can be freely combined as needed, and all non-contradictory solutions formed by such combinations are within the scope of protection of this application.

[0117] Based on the same inventive concept, this application also provides a low-Earth orbit (LEO) satellite network measurement device for implementing the LEO satellite network measurement method described above. The solution provided by this device is similar to the implementation described in the above method; therefore, the specific limitations in one or more LEO satellite network measurement device embodiments provided below can be found in the limitations of the LEO satellite network measurement method described above, and will not be repeated here.

[0118] In one exemplary embodiment, such as Figure 10 As shown, a low-Earth orbit satellite network measurement device is provided, comprising: a loop determination module 1002, a path planning module 1004, and a network measurement module 1006, wherein:

[0119] The loop determination module 1002 is used to obtain the topology map of the low-Earth orbit satellite network and determine the Eulerian circuit based on the topology map, wherein the topology map includes multiple satellite vertices and edges between adjacent satellite vertices.

[0120] The path planning module 1004 is used to determine the detection path set based on the Eulerian circuit and to determine the reporting path set based on the detection path set.

[0121] The network measurement module 1006 is used to collect network status information of each satellite vertex based on the detection path set, and to transmit the network status information of each satellite vertex to the ground station for network measurement based on the report path set.

[0122] In an exemplary embodiment, the path planning module 1004 is further configured to determine the directly connected satellite vertices among multiple satellite vertices, divide the Eulerian circuit at the directly connected satellite vertices to obtain an initial path segment set; and splice multiple initial path segments in the initial path segment set to obtain a detection path set.

[0123] In an exemplary embodiment, the path planning module 1004 is further configured to: filter the initial road segments in the initial road segment set according to a preset length threshold; add the filtered initial road segments to the road segment set to be spliced; for the unfiltered initial road segments, segment them at the nearest neighbor satellite vertex of the current level corresponding to the directly connected satellite vertex to obtain the current level sub-road segments; filter the current level sub-road segments according to the preset length threshold; add the filtered current level sub-road segments to the road segment set to be spliced; update the unfiltered current level sub-road segments to the unfiltered initial road segments; update the next level nearest neighbor satellite vertex corresponding to the directly connected satellite vertex to the current level nearest neighbor satellite vertex; return to the step of segmenting the unfiltered initial road segments at the nearest neighbor satellite vertex of the current level corresponding to the directly connected satellite vertex, until all the segmented current level sub-road segments are filtered out; splice adjacent road segments in the road segment set to be spliced ​​to obtain multiple detection paths, and the multiple detection paths constitute a detection path set, wherein the path length of each detection path is less than or equal to the preset length threshold.

[0124] In an exemplary embodiment, the unfiltered initial road segment is an initial road segment with a length greater than a preset length threshold, the filtered current-level sub-road segment is a current-level sub-road segment with a length less than or equal to the preset length threshold, and the unfiltered current-level sub-road segment is a current-level sub-road segment with a length greater than the preset length threshold. The path planning module 1004 is further configured to, for the initial road segment with a length greater than the preset length threshold, determine the current-level nearest neighbor satellite vertex directly connected to the satellite vertex in the initial road segment, segment the initial road segment at the current-level nearest neighbor satellite vertex to obtain the current-level sub-road segment; filter the current-level sub-road segment according to the preset length threshold, add the filtered current-level sub-road segment with a length less than or equal to the preset length threshold to the set of road segments to be spliced, and update the unfiltered current-level sub-road segment with a length greater than the preset length threshold to the unfiltered initial road segment.

[0125] In an exemplary embodiment, the path planning module 1004 is further configured to determine the longest road segment in the set of road segments to be spliced, and starting with the longest road segment, splice adjacent road segments under the constraint of a preset length threshold to obtain multiple detection paths.

[0126] In an exemplary embodiment, the path planning module 1004 is further configured to, for each probe path in the probe path set, determine the shortest path from the path endpoint to the nearest directly connected satellite vertex if the path endpoint of the probe path is not directly connected to a satellite vertex, and obtain a report path set based on the shortest path.

[0127] Each module in the aforementioned low-Earth orbit satellite network measurement device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in the processor of the communication device in hardware form or independent of it, or stored in the memory of the communication device in software form, so that the processor can call and execute the corresponding operations of each module.

[0128] In one exemplary embodiment, a communication device is provided, the internal structure of which can be shown in the following diagram. Figure 11 As shown, the communication device includes a processor, memory, input / output (I / O) interfaces, and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides the environment for the operating system and computer programs stored in the non-volatile storage media. The database stores data such as the topology map of the low-Earth orbit satellite network, Eulerian circuits, detection path sets, report path sets, and network status information of each satellite vertex. The I / O interfaces are used for information exchange between the processor and external devices. The communication interface is used for communication with external terminals via a network connection. When the computer program is executed by the processor, it implements a low-Earth orbit satellite network measurement method.

[0129] Those skilled in the art will understand that Figure 11 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the communication device to which the present application is applied. Specific communication devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0130] In one embodiment, a communication device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described method embodiments.

[0131] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the steps in the above method embodiments.

[0132] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above method embodiments.

[0133] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, artificial intelligence (AI) processors, etc., and are not limited to these.

[0134] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

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

Claims

1. A method for measuring low-Earth orbit satellite networks, characterized in that, The method includes: Obtain a topology map of a low-Earth orbit satellite network and determine an Eulerian circuit based on the topology map, wherein the topology map includes multiple satellite vertices and edges between adjacent satellite vertices; The detection path set is determined based on the Euler circuit, and the reporting path set is determined based on the detection path set. Based on the detection path set, network status information of each satellite vertex is collected, and based on the report path set, the network status information of each satellite vertex is transmitted to the ground station for network measurement.

2. The method according to claim 1, characterized in that, The step of determining the detection path set based on the Euler circuit includes: Identify the directly connected satellite vertices among multiple satellite vertices, and divide the Eulerian circuit at the directly connected satellite vertices to obtain an initial set of road segments; Multiple initial road segments in the initial road segment set are spliced ​​together to obtain the detection path set.

3. The method according to claim 2, characterized in that, The step of splicing the initial road segments in the initial road segment set to obtain the detection path set includes: The initial road segments in the initial road segment set are filtered according to a preset length threshold, and the filtered initial road segments are added to the road segment set to be spliced. For initial road segments that are not selected, segmentation is performed at the nearest neighbor satellite vertex at the current level corresponding to the directly connected satellite vertex to obtain current level sub-road segments. The current level sub-road segments are then filtered according to the preset length threshold. The selected current level sub-road segments are added to the set of road segments to be spliced. The unselected current level sub-road segments are updated to the unselected initial road segments. The next level nearest neighbor satellite vertex corresponding to the directly connected satellite vertex is updated to the current level nearest neighbor satellite vertex. The process returns to the step of segmenting the unselected initial road segments at the nearest neighbor satellite vertex at the current level corresponding to the directly connected satellite vertex, until all the segmented current level sub-road segments are selected. Adjacent road segments in the set of road segments to be spliced ​​are spliced ​​together to obtain multiple detection paths, and the multiple detection paths constitute a detection path set, wherein the path length of each detection path is less than or equal to the preset length threshold.

4. The method according to claim 3, characterized in that, The unselected initial road segment is an initial road segment whose length is greater than the preset length threshold; the selected current level sub-road segment is a current level sub-road segment whose length is less than or equal to the preset length threshold; and the unselected current level sub-road segment is a current level sub-road segment whose length is greater than the preset length threshold. For the initial road segment that has not been selected, the segmentation is performed at the nearest neighbor satellite vertex of the current level corresponding to the directly connected satellite vertex to obtain the current level sub-road segment. The current level sub-road segment is then selected according to the preset length threshold. The selected current level sub-road segment is added to the set of road segments to be spliced. The unselected current level sub-road segment is updated to the unselected initial road segment. For an initial road segment whose length is greater than the preset length threshold, the current-level nearest neighbor satellite vertex of the directly connected satellite vertex is determined in the initial road segment, and the initial road segment is divided at the current-level nearest neighbor satellite vertex to obtain the current-level sub-road segment; The current level sub-segments are filtered according to the preset length threshold. The current level sub-segments with a length less than or equal to the preset length threshold are added to the set of segments to be spliced. The current level sub-segments with a length greater than the preset length threshold that are not filtered are updated to the unfiltered initial segments.

5. The method according to claim 3, characterized in that, The process of splicing adjacent road segments in the set of road segments to be spliced ​​together yields multiple detection paths, including: The longest road segment is determined from the set of road segments to be spliced. Starting from the longest road segment, adjacent road segments are spliced ​​under the limitation of the preset length threshold to obtain multiple detection paths.

6. The method according to claim 1, characterized in that, The step of determining the report path set based on the detection path set includes: For each detection path in the detection path set, if the path endpoint of the detection path is not directly connected to a satellite vertex, determine the shortest path from the path endpoint to the nearest directly connected satellite vertex, and obtain the report path set based on the shortest path.

7. A low-orbit satellite network measurement device, characterized in that, The device includes: A circuit determination module is used to acquire a topology map of a low-Earth orbit satellite network and determine an Eulerian circuit based on the topology map, wherein the topology map includes multiple satellite vertices and edges between adjacent satellite vertices; The path planning module is used to determine a set of detection paths based on the Euler circuit and a set of reporting paths based on the set of detection paths. The network measurement module is used to collect network status information of each satellite vertex based on the detection path set, and to transmit the network status information of each satellite vertex to the ground station for network measurement based on the report path set.

8. A communication device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

Images