Satellite shortest route calculation method, system, device and electronic equipment

Abstract

The present invention provides a satellite shortest route calculation method, system, device and electronic device, wherein the method is applied to a high-orbit satellite cluster, and the method includes: determining multiple groups of low-orbit satellites that communicate with any high-orbit satellite, wherein each group of low-orbit satellites includes two low-orbit satellites; determining the spatial position of each low-orbit satellite in each group of low-orbit satellites; generating multiple relay communication paths between the high-orbit satellite and each group of low-orbit satellites, and determining the distances of the multiple relay communication paths; and selecting a determined number of communication paths from the relay communication paths as reference paths according to a set distance threshold. The embodiments of the present application greatly reduce the number of path calculations by narrowing the scope of route selection, improve the calculation efficiency of the shortest route, simplify the algorithm difficulty, and solve the problems of large amount of calculation and high algorithm complexity of the calculation algorithm existing in the related art.

Description

Technical Field

[0001] The present invention relates to the technical field of satellite communications, and in particular to a satellite shortest route calculation method, system, device and electronic equipment. Background Art

[0002] Satellite communications have the characteristics of large coverage, good reliability, and high transmission efficiency. They are widely used in many fields. At this stage, the dual-layer satellite communication system that combines low-orbit satellites (LEO) and high-orbit satellites (GEO) fully combines the advantages of LEO's low latency, high bandwidth, and low cost with the advantages of GEO's large coverage, and has become the current mainstream research direction.

[0003] The existing satellite communication routing calculation method needs to calculate the specific conditions of all routing paths first, and then select the routing path according to specific requirements, such as: selecting the shortest delay path, selecting the path with sufficient bandwidth, selecting the path with the least forwarding times, etc. No matter which existing routing calculation method is used, there are problems such as large amount of calculation and high algorithm complexity of routing calculation. Therefore, the existing shortest routing calculation algorithm for LEO and GEO dual-layer satellite systems has large amount of calculation and high algorithm complexity, which needs to be solved urgently. Summary of the invention

[0004] The present application provides a satellite shortest route calculation method, system, device and electronic device to at least solve the problems of large amount of calculation and high algorithm complexity in route calculation in related technologies.

[0005] According to one aspect of an embodiment of the present application, a method for calculating the shortest satellite route is provided, which is applied to a high-orbit satellite cluster, and includes: determining multiple groups of low-orbit satellites that communicate with any of the high-orbit satellites, wherein each group of low-orbit satellites includes two of the low-orbit satellites; determining the spatial position of each of the low-orbit satellites in each group of low-orbit satellites; generating multiple relay communication paths between the high-orbit satellite and each group of low-orbit satellites, and determining the distances of the multiple relay communication paths; and selecting a determined number of communication paths from the relay communication paths as reference paths according to a set distance threshold.

[0006] Optionally, before determining multiple groups of low-orbit satellites communicating with any of the high-orbit satellites, the method includes: receiving call instructions from multiple low-orbit satellites; and executing the above-mentioned satellite shortest route calculation method based on the call instructions.

[0007] According to another aspect of an embodiment of the present application, a method for calculating the shortest satellite route is also provided, which is applied to a low-orbit satellite cluster, and includes: receiving request information sent by multiple terminal objects; selecting a preset number of target low-orbit satellites according to the request information, wherein each of the terminal objects corresponds to at least one target low-orbit satellite; generating a routing path that passes through the target low-orbit satellite during communication between any two terminal objects; obtaining multiple reference paths sent by a high-orbit satellite cluster, wherein the reference path is obtained by selecting a certain number of communication paths from relay communication paths according to a set distance threshold by the high-orbit satellite cluster, and the relay communication path is a path between a high-orbit satellite and each group of low-orbit satellites, and each group of low-orbit satellites includes a low-orbit satellite that communicates with any of the high-orbit satellites, and each group of low-orbit satellites includes two of the low-orbit satellites; selecting multiple candidate communication paths including the routing path from the reference path; and comparing the candidate communication paths to determine the target communication path with the shortest distance.

[0008] Optionally, after determining the target communication path with the shortest distance, the method includes: sending the target communication path to multiple terminal objects.

[0009] Optionally, the satellite shortest route calculation method includes: sending a call instruction to the high-orbit satellite cluster, so that the high-orbit satellite cluster starts to execute the steps of the satellite shortest route calculation method applied to the high-orbit satellite cluster.

[0010] According to another aspect of an embodiment of the present application, a satellite shortest route calculation system is also provided, the system comprising a terminal object, a low-orbit satellite cluster and a high-orbit satellite cluster, wherein the low-orbit satellite cluster comprises a plurality of low-orbit satellites, and the high-orbit satellite cluster comprises a plurality of high-orbit satellites; the high-orbit satellite cluster is used to determine a plurality of groups of low-orbit satellites communicating with any of the high-orbit satellites, wherein each group of low-orbit satellites comprises two of the low-orbit satellites; determine the spatial position of each of the low-orbit satellites in each group of low-orbit satellites; generate a plurality of relay communication paths between the high-orbit satellite and each group of low-orbit satellites, and determine the distances of the plurality of relay communication paths; select a determined number of communication paths from the relay communication paths as reference paths according to a set distance threshold; and send the reference paths to the low-orbit satellite cluster;

[0011] The terminal object is used to send request information;

[0012] The low-orbit satellite cluster is used to receive the request information sent by multiple terminal objects; select a preset number of target low-orbit satellites from the low-orbit satellite cluster according to the request information, wherein each terminal object corresponds to at least one target low-orbit satellite; generate a routing path that passes through the target low-orbit satellite during the communication process between any two terminal objects; obtain multiple reference paths sent by the high-orbit satellite cluster, wherein the reference path is obtained by the high-orbit satellite cluster selecting a certain number of communication paths from the relay communication path according to a set distance threshold, and the relay communication path is a path between a high-orbit satellite and each group of low-orbit satellites, and each group of low-orbit satellites includes a low-orbit satellite that communicates with any of the high-orbit satellites, wherein each group of low-orbit satellites includes two of the low-orbit satellites; select multiple candidate communication paths including the routing path from the reference path; compare the candidate communication paths to determine the target communication path with the shortest distance.

[0013] According to another aspect of an embodiment of the present application, a satellite shortest route calculation device for a high-orbit satellite cluster is also provided, the device comprising: a first confirmation module, used to confirm multiple groups of low-orbit satellites that communicate with any of the high-orbit satellites, wherein each group of low-orbit satellites includes two of the low-orbit satellites; a first generation module, used to generate multiple relay communication paths between the high-orbit satellite and each group of low-orbit satellites; a first calculation module, used to calculate the distance of the relay communication path through the satellite spatial position; a first selection module, used to select a determined number of communication paths from the relay communication path as reference paths according to a set distance threshold; and a first sending module, used to send the reference path information to the low-orbit satellite cluster.

[0014] According to another aspect of an embodiment of the present application, a satellite shortest route calculation device for a low-orbit satellite cluster is also provided, the device comprising: a first receiving module, for receiving request information sent by multiple terminal objects; a second selection module, for selecting a preset number of target low-orbit satellites according to the request information, wherein each of the terminal objects corresponds to at least one target low-orbit satellite; a second generation module, for generating a routing path including any two terminal objects passing through the target low-orbit satellite during communication; a second receiving module, for receiving multiple reference paths sent by the high-orbit satellite cluster, wherein the reference path is obtained by selecting a certain number of communication paths from the relay communication path according to a set distance threshold by the high-orbit satellite cluster, the relay communication path is a path between the high-orbit satellite and each group of low-orbit satellites, each group of low-orbit satellites includes a low-orbit satellite that communicates with any of the high-orbit satellites, wherein each group of low-orbit satellites includes two low-orbit satellites; a third selection module, for selecting multiple candidate communication paths including the routing path from the reference path; a first determination module, for comparing the candidate communication paths, and determining the target communication path with the shortest distance.

[0015] According to another aspect of the embodiments of the present application, there is also provided an electronic device, including a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other via the communication bus; wherein the memory is used to store a computer program; and the processor is used to execute the method steps in any of the above embodiments by running the computer program stored in the memory.

[0016] According to another aspect of the embodiments of the present application, a computer-readable storage medium is provided, in which a computer program is stored, wherein the computer program is configured to execute the method steps in any of the above embodiments when executed.

[0017] In this embodiment, a high-orbit satellite cluster and a low-orbit satellite cluster are combined to reduce the scope of route selection. By using each terminal object to select a small number of low-orbit satellites as access satellites, a small number of high-orbit satellites are also selected as relay satellites between low-orbit satellites. The entire calculation process is divided into two stages. The first stage is to determine the relay communication path of two low-orbit satellites through high-orbit satellites and screen them according to the set distance threshold; the second stage is to consider the route between the terminal object and the low-orbit satellite, and then select the shortest path according to the distance threshold. Through the method provided in this embodiment, the amount of path calculation can be greatly reduced and the best route can be quickly obtained. The route calculated by this method is statistically calculated, and it is very likely to be the best route. Therefore, the performance of the algorithm is close to the optimal routing algorithm, and the computational complexity is greatly reduced. It is a more cost-effective shortest distance routing algorithm. It solves the problems of large computational complexity and high algorithm complexity in the related art. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and, together with the description, serve to explain the principles of the invention.

[0019] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0020] Figure 1 A flowchart of a satellite shortest route calculation method for a high-orbit satellite cluster according to an optional embodiment of the present application;

[0021] Figure 2 A schematic diagram of an optional high-orbit and low-orbit two-layer satellite relay communication embodiment according to an embodiment of the present application;

[0022] Figure 3 A flowchart of a satellite shortest route calculation method for a low-orbit satellite cluster according to an optional embodiment of the present application;

[0023] Figure 4 An optional target communication path and distance calculation graph according to an embodiment of the present application;

[0024] Figure 5 An overall flow chart of an optional satellite shortest route calculation method according to an embodiment of the present application;

[0025] Figure 6 A structural block diagram of an optional high-orbit satellite cluster satellite shortest route calculation device according to an embodiment of the present application;

[0026] Figure 7 A structural block diagram of an optional low-orbit satellite cluster satellite shortest route calculation device according to an embodiment of the present application;

[0027] Figure 8 A structural block diagram of an optional electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0028] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0029] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0030] At present, the low-orbit satellite communication system uses a dozen to dozens of small satellites in low orbit, which rotate around the earth at several orbital planes with equal distance in longitude, as mobile communication relay stations, to form wireless cellular coverage on the ground, covering the entire surface of the earth, and can provide services such as telephone, fax, data, paging and radio positioning. In order to achieve global coverage, low-orbit satellites usually need to establish connections with MEO and GEO to form a multi-layer satellite communication network. For services with high real-time requirements, in order to reduce the delay of information transmission, the shortest propagation path priority routing algorithm can be used. At this stage, the dual-layer satellite communication system combining low-orbit satellites (LEO) and high-orbit satellites (GEO) fully combines the advantages of low latency, high bandwidth, low cost of LEO and the advantages of large coverage of GEO, and has become the current mainstream research direction. However, no matter which existing routing calculation method is used, there are problems such as large amount of calculation of routing calculation and high complexity of the algorithm. In order to solve the above problems, the embodiment of the present application provides a satellite shortest route calculation method. Figure 1The satellite shortest route calculation method shown is applied to a high-orbit satellite cluster, and the method process may include the following steps:

[0031] Step S101, determining a plurality of groups of low-orbit satellites that communicate with any high-orbit satellite, wherein each group of low-orbit satellites includes two low-orbit satellites.

[0032] Optionally, the embodiment of the present application first uses a high-orbit satellite (GEO) as a relay satellite to connect two low-orbit satellites (LEO) to form a relay communication path, such as Figure 2 As shown in the figure, there are 3 high-orbit satellites in the space high orbit, namely GEO1, GEO2 and GEO3; there are also 7 low-orbit satellites LEO1-LEO7; in addition, there are two terminal objects UE1 and UE2. UE1 wants to communicate with UE2, but their actual distance is relatively far, so far that there is no common low-orbit satellite that can be accessed for forwarding, so data communication needs to be carried out through high-orbit satellites as relay satellites. For example, LEO1 and LEO4 can use GEO1 as a relay satellite to connect, forming a relay communication path LEO1-GEO1-LEO4. At this time, LEO1 and LEO4 form a low-orbit satellite group. The same is true for other situations, which are not listed here one by one.

[0033] Optionally, before determining multiple groups of low-orbit satellites communicating with any high-orbit satellite, if multiple low-orbit satellite call instructions are received, the high-orbit satellite can execute all satellite shortest route calculation steps starting from step S101 after receiving the call instructions.

[0034] Step S102, determining the spatial position of each low-orbit satellite in each group of low-orbit satellites.

[0035] Optionally, the satellites all know their own spatial positions, and the spatial distance between the satellites can be calculated through their respective spatial positions.

[0036] Step S103, generating multiple relay communication paths between the high-orbit satellite and each group of low-orbit satellites, and calculating the distances of the multiple paths.

[0037] Alternatively, if Figure 2 As shown in the figure, the communication distance calculation of the relay communication path LEO1-GEO1-LEO4 is calculated by calculating the spatial positions of the satellites to obtain that the distance between LEO1 and GEO1 is 1400 kilometers, and the distance between LEO4 and GEO1 is 1550 kilometers. Therefore, the communication distance of the relay communication path LEO1-GEO1-LEO4 is 1400+1550=2950 kilometers. The communication distance calculation of other relay communication paths is similar, and they are not listed here one by one.

[0038] Step S104: selecting a determined number of communication paths from the relay communication paths as reference paths according to a set distance threshold.

[0039] The number of relay communication paths in a low-orbit satellite group is not fixed and may change due to the different spatial positions of two low-orbit satellites in the low-orbit satellite combination and the different times of sending communication requests. Therefore, some low-orbit satellite combinations will have multiple relay communication paths, while some combinations will have no relay communication paths.

[0040] Alternatively, if Figure 3 As shown in Table 1, different distance thresholds are set for different low-orbit satellite combinations, so that a certain number of communication paths are selected from all relay communication paths of different low-orbit satellite combinations, such as selecting the two with the shortest distances, and if there are less than two, all are selected. The communication distance between low-orbit satellites can be obtained through simple calculations, as shown in Table 1.

[0041] Table 1 Relay high-orbit satellite path selection and calculation table

[0042]

[0043]

[0044]

[0045] There are three relay communication paths between the low-orbit satellite combination LEO3 and LEO4, namely LEO3-GEO1-LEO4, LEO3-GEO2-LEO4 and LEO3-GEO3-LEO4. The communication distances of the three relay communication paths are 2800 km, 1785 km and 3300 km respectively through simple calculation. The two relay communication paths LEO3-GEO1-LEO4 and LEO3-GEO2-LEO4 with the shortest distance are selected by presetting the communication distance threshold as the two reference paths of the low-orbit satellite combination LEO3 and LEO4. The relay communication paths and communication distances of other low-orbit satellite combinations are shown in Table 1 and will not be repeated here.

[0046] In an embodiment of the present application, a plurality of groups of low-orbit satellites communicating with any high-orbit satellite are determined, wherein each group of low-orbit satellites includes two low-orbit satellites; the spatial position of each low-orbit satellite in each group of low-orbit satellites is determined; a plurality of relay communication paths between the high-orbit satellite and each group of low-orbit satellites are generated, and the distances of the plurality of paths are calculated; and a certain number of communication paths are selected from the relay communication paths as reference paths according to a set distance threshold, thereby reducing the path selection of satellite communications for the LEO and GEO double-layer communication networks, thereby reducing the amount of computation and ensuring the efficiency of route generation, achieving a balance between performance and computational complexity, and being well adapted to the fast and changing communication environment of low-orbit satellites.

[0047] According to another aspect of the embodiment of the present application, a satellite shortest route calculation method applied to a low-orbit satellite cluster is also provided. Figure 3 As shown, the process of the method may include the following steps:

[0048] Step S201: receiving request information sent by multiple terminal objects.

[0049] Optionally, after receiving the terminal object, it is possible to determine which low-orbit satellites near the terminal object can serve as access satellites to form a complete communication path, such as Figure 2 As shown, near the terminal object UE1, there are LEO1, LEO2 and LEO3 that can serve as access satellites.

[0050] Step S202: selecting a preset number of target low-orbit satellites from the low-orbit satellite cluster according to the request information, wherein each terminal object corresponds to at least one target low-orbit satellite.

[0051] Optionally, in order to reduce the number of communication paths and the amount of computation required for calculating the shortest satellite route, when selecting the target low-orbit satellite, a preset distance threshold can be used to exclude low-orbit satellites that are farther away from the terminal object than the preset threshold distance, thereby reducing the number of low-orbit satellites and further reducing the amount of computation required for the communication path. Figure 2 As shown, there are LEO1, LEO2 and LEO3 near the terminal object UE1 that can serve as access satellites, but LEO3 is 810 kilometers away from UE1 and has the highest communication delay among the three low-orbit satellites. In order to pursue low communication delay, LEO3 can be excluded as an access satellite.

[0052] Step S203: Generate a routing path that passes through the target low-orbit satellite during the communication process between any two terminal objects.

[0053] Alternatively, if Figure 4 As shown, terminal object UE1 selects LEO1 or LEO2, and terminal object UE2 selects LEO5 or LEO6 as access satellites. Figure 4 The distribution and communication relationship of LEO and GEO can derive 6 communication routing paths including terminal objects UE1 and UE2. For example, the information sent by the terminal object UE1 passes through LEO1, GEO1, and LEO5 in sequence and is then transmitted to the terminal object UE2. LEO1-GEO1-LEO5 is one of the communication routing paths; the information sent by the terminal object UE2 passes through LEO6, GEO2, and LEO1 in sequence and is then transmitted to the terminal object UE1. LEO6-GEO2-LEO1 is another communication routing path. Other situations are similar and will not be repeated here.

[0054] Step S204, obtaining multiple reference paths sent by the high-orbit satellite cluster, wherein the reference path is obtained by the high-orbit satellite cluster selecting a certain number of communication paths from the relay communication path according to a set distance threshold, and the relay communication path is a path between the high-orbit satellite and each group of low-orbit satellites, and each group of low-orbit satellites includes a low-orbit satellite that communicates with any high-orbit satellite, wherein each group of low-orbit satellites includes two low-orbit satellites.

[0055] Optionally, the relay communication paths LEO3-GEO1-LEO4 and LEO3-GEO2-LEO4 mentioned above are two reference paths of the low-orbit satellite combination LEO3 and LEO4. Other reference paths are shown in Table 1 and will not be repeated here.

[0056] Step S205, selecting a plurality of candidate communication paths including the routing path in step S203 from the reference paths;

[0057] Step S206, comparing the candidate communication paths to determine the target communication path with the shortest distance.

[0058] Alternatively, if Figure 4 As shown in the figure, when UE1 and UE2 each select two LEOs, combined with the reference path provided by the high-orbit satellite, there are 6 possible paths between UE1 and UE2. These 6 possible paths are UE1-LEO1-GEO1-LEO5-UE2, UE1-LEO1-GEO2-LEO5-UE2, UE1-LEO1-GEO2-LEO6-UE2, UE1-LEO2-GEO1-LEO5-UE2, UE1-LEO2-GEO2-LEO5-UE2, and UE1-LEO2-GEO2-LEO6-UE2, which are the candidate communication paths mentioned, as shown in Table 2.

[0059] Table 2 Final path selection and calculation table

[0060]

[0061] By simple data calculation and comparing the calculated results, it can be concluded that the shortest communication path between the terminal objects UE1 and UE2 is UE1-LEO2-GEO2-LEO5-UE2, and the path distance is 600+1620+1355+580=4155.

[0062] Optionally, after determining the target communication path with the shortest distance, the method includes: sending the target communication path to multiple terminal objects, and the terminal objects can communicate using the selected shortest communication routing path.

[0063] Optionally, after determining the target communication path with the shortest distance, it includes: sending a call instruction to the high-orbit satellite cluster to complete the calculation and connection of the shortest routing path.

[0064] In an embodiment of the present application, request information sent by multiple terminal objects is received; a preset number of target low-orbit satellites are selected from the low-orbit satellite cluster according to the request information, wherein each terminal object corresponds to at least one target low-orbit satellite; a routing path passing through the target low-orbit satellite during the communication process between any two terminal objects is generated; multiple reference paths sent by the high-orbit satellite cluster are obtained; multiple candidate communication paths including the routing paths are selected from the reference paths; the candidate communication paths are compared to determine the target communication path with the shortest distance, thereby reducing the path selection of satellite communications for the LEO and GEO double-layer communication networks, thereby reducing the amount of computation and ensuring the efficiency of route generation, achieving a balance between performance and computational complexity, and being well adapted to the fast and changing communication environment of low-orbit satellites.

[0065] According to another aspect of an embodiment of the present application, a satellite shortest route calculation system is also provided, which includes a terminal object, a low-orbit satellite cluster and a high-orbit satellite cluster, wherein the high-orbit satellite cluster is used to determine multiple groups of low-orbit satellites that communicate with any high-orbit satellite, wherein each group of low-orbit satellites includes two low-orbit satellites; determine the spatial position of each low-orbit satellite in each group of low-orbit satellites; generate multiple relay communication paths between the high-orbit satellite and each group of low-orbit satellites; select multiple reference paths of distances in the multiple relay communication paths, and send the multiple reference paths to the low-orbit satellite cluster.

[0066] The terminal object is used to send request information.

[0067] The low-orbit satellite cluster is used to receive request information sent by multiple terminal objects; select a preset number of target low-orbit satellites from the low-orbit satellite cluster according to the request information, wherein each terminal object corresponds to at least one target low-orbit satellite; generate a routing path that passes through the target low-orbit satellite during the communication process between any two terminal objects; obtain multiple reference paths sent by the high-orbit satellite cluster, wherein the reference path is obtained by the high-orbit satellite cluster selecting a certain number of communication paths from the relay communication path according to a set distance threshold, and the relay communication path is a path between the high-orbit satellite and each group of low-orbit satellites, and each group of low-orbit satellites includes a low-orbit satellite that communicates with any high-orbit satellite, wherein each group of low-orbit satellites includes two low-orbit satellites; select multiple candidate communication paths including routing paths from the reference path; compare the candidate communication paths to determine the target communication path with the shortest distance.

[0068] As an optional embodiment, if the high-orbit satellite uses the preset threshold method to select 2 of all relay communication paths of each group of low-orbit satellites as reference paths; when selecting low-orbit satellites as access satellites, 2 low-orbit satellites closest to the terminal object are also selected. At this time, through permutations and combinations, at most 8 paths need to be compared, and the corresponding calculation amount has an upper limit. This method can improve the efficiency of satellite shortest route calculation, and the routing path obtained by the test has a probability of more than 95% being the shortest distance path. The 95% data is obtained through simulation analysis, and the simulation process is not described in this manual.

[0069] An optional satellite shortest route calculation method flow chart of an embodiment of the present application is as follows: Figure 5 As shown, this embodiment discloses a satellite shortest route calculation method, which is a set of algorithms for selecting the shortest satellite relay communication path selection between two user terminals. The method is divided into two parts. The first step is the relay high-orbit satellite selection, and the second step is the low-orbit access satellite selection. This method divides the path selection into two parts: relay high-orbit satellite selection and low-orbit access satellite selection. Each part is calculated separately, and the speed of data interaction and routing calculation is faster. The detailed step flow of this method has been shown in the satellite shortest route calculation method applied to the high-orbit satellite cluster and the satellite shortest route calculation method applied to the low-orbit satellite cluster, and will not be repeated here.

[0070] According to another aspect of an embodiment of the present application, a device for implementing the above-mentioned satellite shortest route calculation method in a high-orbit satellite cluster is also provided. Figure 6 is a structural block diagram of an optional high-orbit satellite cluster satellite shortest route calculation device according to an embodiment of the present application, such as Figure 6 As shown, the device may include:

[0071] The first confirmation module 601 is used to confirm multiple groups of low-orbit satellites that communicate with any high-orbit satellite; wherein each group of low-orbit satellites includes two low-orbit satellites.

[0072] A first generating module 602 is used to generate multiple relay communication paths between the high-orbit satellite and each group of low-orbit satellites;

[0073] A first calculation module 603, used to calculate the distance of the relay path through the satellite spatial position;

[0074] A second determination module 604 is used to select a determined number of communication paths from the relay communication paths as reference paths according to a set distance threshold;

[0075] The first sending module 605 is used to send reference path information to the low-orbit satellite cluster.

[0076] In an embodiment of the present application, a plurality of groups of low-orbit satellites communicating with any high-orbit satellite are determined, wherein each group of low-orbit satellites includes two low-orbit satellites; the spatial position of each low-orbit satellite in each group of low-orbit satellites is determined; a plurality of relay communication paths between the high-orbit satellite and each group of low-orbit satellites are generated, and the distances of the plurality of paths are calculated; and a determined number of communication paths are selected from the relay communication paths as reference paths according to a set distance threshold. Since the embodiment of the present application generates a plurality of relay communication paths between the high-orbit satellite and each group of low-orbit satellites through the high-orbit satellite, a specific number of communication paths are selected from all relay communication paths in each group by setting a communication distance threshold, thereby narrowing the range of routing path selection, reducing the amount of calculation, and improving the efficiency of satellite shortest route calculation. In addition, the satellite shortest route calculation is divided into two parts: relay routing path selection and low-orbit access satellite selection, and the two parts are calculated separately, further improving the speed of data interaction and routing calculation.

[0077] According to another aspect of an embodiment of the present application, a device for implementing the above-mentioned satellite shortest route calculation method in a low-orbit satellite cluster is also provided. Figure 7 is a structural block diagram of an optional low-orbit satellite cluster satellite shortest route calculation device according to an embodiment of the present application, such as Figure 7 As shown, the device may include:

[0078] The first receiving module 701 is used to receive request information sent by multiple terminal objects;

[0079] A second selection module 702 is used to select a preset number of target low-orbit satellites according to the request information, wherein each terminal object corresponds to at least one target low-orbit satellite;

[0080] The second generating module 703 is used to generate a routing path passing through a target low-orbit satellite during the communication process between any two terminal objects;

[0081] The second receiving module 704 is used to receive multiple reference paths sent by the high-orbit satellite cluster, wherein the reference path is obtained by the high-orbit satellite cluster selecting a certain number of communication paths from the relay communication path according to a set distance threshold, and the relay communication path is a path between the high-orbit satellite and each group of low-orbit satellites, each group of low-orbit satellites includes a low-orbit satellite that communicates with any high-orbit satellite, and each group of low-orbit satellites includes two of the low-orbit satellites;

[0082] A third selection module 705 is used to select a plurality of candidate communication paths including routing paths from the reference paths;

[0083] The first determination module 706 is used to compare candidate communication paths and determine a target communication path with the shortest distance.

[0084] In the embodiment of the present application, a method is adopted to receive request information sent by multiple terminal objects; select a preset number of target low-orbit satellites from the low-orbit satellite cluster according to the request information, wherein each terminal object corresponds to at least one target low-orbit satellite; generate a routing path passing through the target low-orbit satellite during the communication process between any two terminal objects; obtain multiple reference paths sent by the high-orbit satellite cluster; select multiple candidate communication paths including the routing path from the reference path; compare the candidate communication paths and determine the target communication path with the shortest distance. Because this scheme narrows the selection range of low-orbit satellites, reduces the total number of communication paths, reduces the amount of calculation, and improves the efficiency of satellite shortest route calculation.

[0085] Figure 8 is a structural block diagram of an optional electronic device according to an embodiment of the present application, such as Figure 8 As shown, it includes a processor 801, a communication interface 802, a memory 803 and a communication bus 804, wherein the processor 801, the communication interface 802 and the memory 803 communicate with each other through the communication bus 804, wherein,

[0086] Memory 803, used for storing computer programs;

[0087] The processor 801 is used to implement the method steps applied to the high-orbit satellite cluster and the method steps applied to the low-orbit satellite cluster when executing the computer program stored in the memory 803.

[0088] Optionally, in this embodiment, the communication bus may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 8 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0089] The communication interface is used for communication between the above electronic device and other devices.

[0090] The memory may include RAM, or may include non-volatile memory, such as at least one disk memory. Optionally, the memory may also be at least one storage device located away from the aforementioned processor.

[0091] As an example, Figure 8As shown, the memory 803 may include, but is not limited to, the first confirmation module 601, the first generation module 602, the first calculation module 603, the first selection module 604, the first sending module 605, the first receiving module 701, the second selection module 702, the second generation module 703, the second receiving module 704, the third selection module 705, and the first determination module 706 in the satellite shortest route calculation device. In addition, other module units in the satellite shortest route calculation device may also be included but are not limited to, which will not be repeated in this example.

[0092] The above-mentioned processor can be a general-purpose processor, which can include but not be limited to: CPU (Central Processing Unit), NP (Network Processor), etc.; it can also be DSP (Digital Signal Processing), ASIC (Application Specific Integrated Circuit), FPGA (Field-Programmable Gate Array) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

[0093] Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment will not be described in detail here.

[0094] It can be understood by those skilled in the art that Figure 8 The structure shown is for illustration only. The device for implementing the above-mentioned satellite shortest route calculation method may be a terminal device, which may be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a PDA, a mobile Internet device (Mobile Internet Devices, MID), a PAD, and other terminal devices. Figure 8 It does not limit the structure of the above electronic device. For example, the terminal device may also include Figure 8 More or fewer components (such as network interfaces, display devices, etc.) shown in, or having Figure 8 Different configurations shown.

[0095] A person of ordinary skill in the art can understand that all or part of the steps in the various methods of the above embodiments can be completed by instructing the hardware related to the terminal device through a program, and the program can be stored in a computer-readable storage medium, which can include: a flash drive, ROM, RAM, a magnetic disk or an optical disk, etc.

[0096] According to another aspect of the embodiment of the present application, a storage medium is also provided. Optionally, in this embodiment, the storage medium can be used to store a program for satellite shortest route calculation and generated data.

[0097] Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, which will not be described in detail in this embodiment.

[0098] Optionally, in this embodiment, the storage medium may include, but is not limited to, various media that can store program codes, such as a USB flash drive, a ROM, a RAM, a mobile hard disk, a magnetic disk, or an optical disk.

[0099] In the description of this specification, the description with reference to the terms "this embodiment", "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present disclosure. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in a suitable manner in any one or more embodiments or examples. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, unless there is any contradiction. In the description of the present disclosure, the meaning of "multiple" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0100] Obviously, the above embodiments are merely examples for the purpose of clear explanation, and are not intended to limit the implementation methods. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the implementation methods here. The obvious changes or modifications derived therefrom are still within the scope of protection of the invention.

Claims

1. A satellite shortest route calculation method, characterized in that: The method is applied to a high-orbit satellite cluster, wherein the high-orbit satellite cluster includes a plurality of high-orbit satellites, and the method comprises: Determine a plurality of groups of low-orbit satellites that communicate with any of the high-orbit satellites, wherein each group of low-orbit satellites includes two of the low-orbit satellites; Determine the spatial position of each low-orbit satellite in each group of low-orbit satellites; Generating a plurality of relay communication paths between the high-orbit satellite and each group of low-orbit satellites, and determining distances of the plurality of relay communication paths; According to the set distance threshold, a determined number of communication paths are selected from the relay communication path as reference paths, and the reference paths are sent to a low-orbit satellite cluster, wherein the low-orbit satellite cluster is used to generate a routing path that passes through a target low-orbit satellite during communication between any two terminal objects; multiple candidate communication paths including routing paths are selected from the reference paths; and the candidate communication paths are compared to determine a target communication path with the shortest distance.

2. The satellite shortest route calculation method according to claim 1, characterized in that: Before determining a plurality of groups of low-orbit satellites communicating with any of the high-orbit satellites, the method further includes: Receive call instructions from multiple low-orbit satellites; The steps of the satellite shortest route calculation method according to claim 1 are executed based on the call instruction.

3. A satellite shortest route calculation method, characterized in that: The method is applied to a low-orbit satellite cluster, wherein the low-orbit satellite cluster includes a plurality of low-orbit satellites, and the method comprises: Receive request information sent by multiple terminal objects; Selecting a preset number of target low-orbit satellites according to the request information, wherein each of the terminal objects corresponds to at least one of the target low-orbit satellites; Generate a routing path that passes through the target low-orbit satellite during the communication process between any two terminal objects; Acquire multiple reference paths sent by the high-orbit satellite cluster, wherein the reference paths are obtained by the high-orbit satellite cluster selecting a certain number of communication paths from relay communication paths according to a set distance threshold, and the relay communication paths are paths existing between the high-orbit satellite and each group of low-orbit satellites, and each group of low-orbit satellites includes a low-orbit satellite that communicates with any of the high-orbit satellites, and each group of low-orbit satellites includes two of the low-orbit satellites; Selecting a plurality of candidate communication paths including the routing path from the reference paths; The candidate communication paths are compared to determine a target communication path with the shortest distance.

4. The satellite shortest route calculation method according to claim 3, characterized in that: After determining the target communication path with the shortest distance, the method further includes: A target communication path is sent to a plurality of the terminal objects.

5. The satellite shortest route calculation method according to claim 3, characterized in that: include: Send a call instruction to the high-orbit satellite cluster, so that the high-orbit satellite cluster starts to determine multiple groups of low-orbit satellites that communicate with any of the high-orbit satellites, wherein each group of low-orbit satellites includes two of the low-orbit satellites; determine the spatial position of each of the low-orbit satellites in each group of low-orbit satellites; generate multiple relay communication paths between the high-orbit satellite and each group of low-orbit satellites, and determine the distances of the multiple relay communication paths; according to a set distance threshold, select a determined number of communication paths from the relay communication paths as reference paths, and send the reference paths to the low-orbit satellite cluster, wherein the low-orbit satellite cluster is used to generate a routing path that passes through a target low-orbit satellite during communication between any two terminal objects; select multiple candidate communication paths that include routing paths from the reference paths; compare the candidate communication paths, and determine the target communication path with the shortest distance.

6. A satellite shortest route calculation system, characterized in that: The system includes a terminal object, a low-orbit satellite cluster and a high-orbit satellite cluster, wherein the low-orbit satellite cluster includes a plurality of low-orbit satellites, and the high-orbit satellite cluster includes a plurality of high-orbit satellites; The high-orbit satellite cluster is used to determine multiple groups of low-orbit satellites that communicate with any of the high-orbit satellites, wherein each group of low-orbit satellites includes two of the low-orbit satellites; determine the spatial position of each of the low-orbit satellites in each group of low-orbit satellites; generate multiple relay communication paths between the high-orbit satellite and each group of low-orbit satellites, and determine the distances of the multiple relay communication paths; select a determined number of communication paths from the relay communication paths as reference paths according to a set distance threshold; and send the reference paths to the low-orbit satellite cluster; The terminal object is used to send request information; The low-orbit satellite cluster is used to receive the request information sent by multiple terminal objects; select a preset number of target low-orbit satellites from the low-orbit satellite cluster according to the request information, wherein each terminal object corresponds to at least one target low-orbit satellite; generate a routing path that passes through the target low-orbit satellite during the communication process between any two terminal objects; obtain multiple reference paths sent by the high-orbit satellite cluster, wherein the reference path is obtained by the high-orbit satellite cluster selecting a certain number of communication paths from the relay communication path according to a set distance threshold, and the relay communication path is a path between a high-orbit satellite and each group of low-orbit satellites, and each group of low-orbit satellites includes a low-orbit satellite that communicates with any of the high-orbit satellites, wherein each group of low-orbit satellites includes two of the low-orbit satellites; select multiple candidate communication paths including the routing path from the reference path; compare the candidate communication paths to determine the target communication path with the shortest distance.

7. A satellite shortest route calculation device, characterized in that: The device is applied to a high-orbit satellite cluster, and includes: A first confirmation module is used to confirm multiple groups of low-orbit satellites that communicate with any of the high-orbit satellites, wherein each group of low-orbit satellites includes two of the low-orbit satellites; A first generating module, configured to generate a plurality of relay communication paths between the high-orbit satellite and each group of low-orbit satellites; A first calculation module, used for calculating the distance of the relay communication path according to the satellite spatial position; A first selection module, configured to select a certain number of communication paths from the relay communication paths as reference paths according to a set distance threshold; The first sending module is used to send the reference path information to a low-orbit satellite cluster, wherein the low-orbit satellite cluster is used to generate a routing path that passes through a target low-orbit satellite during communication between any two terminal objects; select multiple candidate communication paths including routing paths from the reference path; compare the candidate communication paths, and determine a target communication path with the shortest distance.

8. A satellite shortest route calculation device, characterized in that: The device is applied to a low-orbit satellite cluster, and comprises: A first receiving module, used for receiving request information sent by multiple terminal objects; A second selection module is used to select a preset number of target low-orbit satellites according to the request information, wherein each of the terminal objects corresponds to at least one of the target low-orbit satellites; A second generating module is used to generate a routing path passing through the target low-orbit satellite during the communication process between any two terminal objects; A second receiving module is used to receive multiple reference paths sent by the high-orbit satellite cluster, wherein the reference path is obtained by the high-orbit satellite cluster selecting a certain number of communication paths from the relay communication path according to a set distance threshold, and the relay communication path is a path between the high-orbit satellite and each group of low-orbit satellites, and each group of low-orbit satellites includes a low-orbit satellite that communicates with any of the high-orbit satellites, and each group of low-orbit satellites includes two of the low-orbit satellites; A third selection module, configured to select a plurality of candidate communication paths including the routing path from the reference paths; The first determination module is used to compare the candidate communication paths and determine the target communication path with the shortest distance.

9. An electronic device comprising a processor, a communication interface, a memory and a communication bus, wherein: The processor, the communication interface and the memory communicate with each other via the communication bus, wherein: The memory is used to store computer programs; The processor is configured to execute the method steps of any one of claims 1 to 6 by running the computer program stored in the memory.

10. A computer-readable storage medium, characterized in that: The storage medium stores a computer program, wherein the computer program is configured to execute the method steps of any one of claims 1 to 6 when executed.

Images