Link planning method, device, equipment, storage medium and product

Abstract

The application belongs to the technical field of communication, and discloses a link planning method, device, equipment, storage medium and product. According to the communication information between each layer constellation and each gateway station, a link weight matrix is constructed, then a link matrix between each layer constellation and each gateway station is constructed, wherein each element in the link matrix is used for representing the link connection relationship between each layer constellation and each gateway station, the value of each element in the link matrix is solved based on the link weight matrix, and the optimal connection gateway station of each layer constellation is determined according to the value of each element in the link matrix. Based on the link weight matrix, the value of each element in the link matrix is solved, and each layer constellation is limited to establish a link with only one gateway station, the link connection relationship between each layer constellation and each gateway station can be obtained, so that the optimal connection gateway station for establishing the space-ground link with each layer constellation can be obtained, and the data of the whole multi-layer constellation system is backhauled through the optimal connection gateway station.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, in particular to a link planning method and device, equipment, storage medium and product. BACKGROUND

[0002] Compared with a single constellation system, the gateway station link planning strategy in a multi-constellation system is a more complex problem. The multi-constellation system refers to a system composed of multiple constellations. In the multi-constellation system, there are more satellites and the overlapping coverage phenomenon generally exists. A gateway station can be simultaneously in the coverage range of multiple satellites of multiple layers of constellations. The rule for the gateway station to build a link is more complex. In the multi-constellation system, the position relationship of satellites of different constellations is unstable. Generally, no inter-constellation link is established. Therefore, a suitable gateway station link needs to be designed to ensure that the data of each layer of constellation can be returned. SUMMARY

[0003] The main purpose of the present application is to provide a link planning method, device, equipment, storage medium and product, which aims to solve the technical problem of how to ensure that each layer of constellation has at least one satellite-ground link and ensure that the data of the entire multi-layer constellation system can be returned.

[0004] To achieve the above-mentioned purpose, the present application provides a link planning method, which comprises the following steps:

[0005] constructing a link weight matrix according to the communication information between each layer of constellation and each gateway station, wherein the multi-layer constellation system comprises at least two layers of constellations, and each layer of constellation comprises at least one satellite;

[0006] constructing a link matrix between each layer of constellation and each gateway station, wherein each element in the link matrix is used to represent the link connection relationship between each layer of constellation and each gateway station;

[0007] solving the value of each element in the link matrix based on the link weight matrix, and determining the optimal connection gateway station of each layer of constellation according to the value of each element in the link matrix.

[0008] Optionally, the solving of the value of each element in the link matrix based on the link weight matrix and the determination of the optimal connection gateway station of each layer of constellation according to the value of each element in the link matrix comprise:

[0009] constructing a link planning model based on the link weight matrix and the link matrix;

[0010] constructing a constraint condition of the link matrix according to the maximum number of links of each gateway station;

[0011] Solving the value of each element in the link matrix by using a convex optimization solving method based on the constraint condition, and determining the optimal connection gateway station of each layer constellation according to the value of each element in the link matrix.

[0012] Optionally, after the link weight matrix is used to solve the value of each element in the link matrix, and the optimal connection gateway station of each layer constellation is determined according to the value of each element in the link matrix, the method further comprises:

[0013] For any optimal connection gateway station, determining a target layer constellation corresponding to the optimal connection gateway station;

[0014] Determining a first link weight between all satellites in the target layer constellation and the optimal connection gateway station, and selecting a best access satellite of the optimal connection gateway station from all satellites in the target layer constellation according to the first link weight;

[0015] Determining a second link weight between each visible satellite in a visible satellite list corresponding to the optimal connection gateway station and the optimal connection gateway station, and selecting a target satellite from the visible satellite list according to the second link weight, wherein the number of the target satellite is the maximum number of links corresponding to the optimal connection gateway station minus 1;

[0016] Adding the target satellite to a to-be-accessed satellite list of the optimal connection gateway station;

[0017] Constructing an access satellite list of all optimal connection gateway stations according to the to-be-accessed satellite list and the best access satellite, and performing link planning on all optimal connection gateway stations according to the access satellite list.

[0018] Optionally, the constructing of the access satellite list of all optimal connection gateway stations according to the to-be-accessed satellite list and the best access satellite, and the performing of the link planning on all optimal connection gateway stations according to the access satellite list, comprises:

[0019] Determining a duplicate satellite in the to-be-accessed satellite list of all optimal connection gateway stations, and adding the duplicate satellite to a to-be-confirmed satellite list;

[0020] For any to-be-confirmed satellite in the to-be-confirmed satellite list, determining an actual connection gateway station of the to-be-confirmed satellite based on a third link weight between the to-be-confirmed satellite and a corresponding optimal connection gateway station;

[0021] Determining remaining connection gateway stations except the actual connection gateway station in all optimal connection gateway stations, and deleting the to-be-confirmed satellite from a visible satellite list and a to-be-accessed satellite list of the remaining connection gateway stations to obtain an updated visible satellite list and an updated to-be-accessed satellite list corresponding to all optimal connection gateway stations.

[0022] determining a list length corresponding to the updated satellite list to be accessed of each optimal connection gateway station, and returning the step of determining the second link weight between each visible satellite in the visible satellite list corresponding to the optimal connection gateway station and the optimal connection gateway station, and selecting a target satellite from the visible satellite list according to the second link weight, until there is no repeated satellite in the updated satellite list to be accessed of all optimal connection gateway stations, and the list length of the updated satellite list to be accessed of all optimal connection gateway stations is equal to the preset length, in the case that the list length is less than the preset length;

[0023] constructing an access satellite list of all optimal connection gateway stations according to the updated satellite list to be accessed and the best access satellite, and performing link planning on all optimal connection gateway stations according to the access satellite list.

[0024] Optionally, after the step of constructing an access satellite list of all optimal connection gateway stations according to the satellite list to be accessed and the best access satellite, and performing link planning on all optimal connection gateway stations according to the access satellite list, the method further comprises:

[0025] For any optimal connection gateway station, determining all initial links of the optimal connection gateway station according to the access satellite list, and determining the communication frequency band of each initial link;

[0026] If the communication frequency bands have frequency overlap, the initial links with frequency overlap are divided into a set of to-be-detected links;

[0027] calculating the interference value between any two to-be-detected links in the set of to-be-detected links, and determining a link pair that needs to perform interference avoidance according to the interference value;

[0028] constructing an undirected graph according to the link pair, and determining a maximum clique in the undirected graph;

[0029] performing frequency segmentation detection on all target links in the maximum clique, and determining a target frequency band corresponding to all target links of the optimal connection gateway station according to the detection result.

[0030] Optionally, the step of performing frequency segmentation detection on all target links in the maximum clique, and determining a target frequency band corresponding to all target links of the optimal connection gateway station according to the detection result, comprises:

[0031] calculating a first throughput drop rate before frequency segmentation and a second throughput drop rate after frequency segmentation of all target links in the maximum clique;

[0032] If the first throughput drop rate is greater than the second throughput drop rate, it is determined that the detection result is that frequency division is needed;

[0033] In the case that the detection result is that frequency division is needed, available frequency bands of all target links in the maximum group are determined.

[0034] The available frequency bands are evenly allocated to all target links to obtain target frequency bands corresponding to all target links of the optimal connection gateway station.

[0035] In addition, to achieve the above-mentioned purpose, the present application also provides a link planning device, which comprises:

[0036] A link weight matrix construction module is configured to construct a link weight matrix according to communication information between each layer constellation and each gateway station, wherein the multi-layer constellation system comprises at least two layer constellations, and each layer constellation comprises at least one satellite.

[0037] A link matrix construction module is configured to construct a link matrix between each layer constellation and each gateway station, wherein each element in the link matrix is used to represent a link connection relationship between each layer constellation and each gateway station.

[0038] A gateway station determination module is configured to solve values of each element in the link matrix based on the link weight matrix, and determine optimal connection gateway stations of each layer constellation according to the values of each element in the link matrix.

[0039] In addition, to achieve the above-mentioned purpose, the present application also proposes a link planning device, which comprises a memory, a processor and a computer program stored on the memory and executable on the processor, and the computer program is configured to implement the steps of the link planning method as described above.

[0040] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer readable storage medium, and the storage medium stores a computer program, and the computer program is executed by a processor to implement the steps of the link planning method as described above.

[0041] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which comprises a computer program, and the computer program is executed by a processor to implement the steps of the link planning method as described above.

[0042] The application constructs a link weight matrix according to communication information between each layer constellation and each gateway station, wherein the multi-layer constellation system includes at least two layer constellations, each layer constellation includes at least one satellite, and then a link matrix between each layer constellation and each gateway station is constructed, wherein each element in the link matrix is used to represent a link connection relationship between each layer constellation and each gateway station, and then the value of each element in the link matrix is solved based on the link weight matrix, and the optimal connection gateway station of each layer constellation is determined according to the value of each element in the link matrix. The value of each element in the link matrix is solved based on the link weight matrix, and each layer constellation is limited to establish a link with only one gateway station, so that the link connection relationship between each layer constellation and each gateway station can be obtained, and thus the optimal connection gateway station for establishing a space-ground link with each layer constellation can be obtained, and data of the entire multi-layer constellation system is backhauled through the optimal connection gateway station. BRIEF DESCRIPTION OF DRAWINGS

[0043] The accompanying drawings, which are incorporated herein and constitute part of the specification, illustrate embodiments consistent with the application and, together with the description, serve to explain the principles of the application.

[0044] In order to more clearly illustrate the technical solutions in the embodiments of the application or the prior art, the accompanying drawings needed to be used in the embodiments or prior art description will be briefly introduced. Obviously, for those skilled in the art, other drawings can also be obtained based on these drawings without creative labor.

[0045] Figure 1 The flowchart of the first embodiment of the link planning method of the application;

[0046] Figure 2 The flowchart of the second embodiment of the link planning method of the application;

[0047] Figure 3 The flowchart of the third embodiment of the link planning method of the application;

[0048] Figure 4 The schematic diagram of the undirected graph of an embodiment of the link planning method of the application;

[0049] Figure 5 The structural block diagram of the first embodiment of the link planning device of the application;

[0050] Figure 6 The structural diagram of the link planning equipment of the hardware running environment involved in the embodiment of the application.

[0051] The implementation, functional features and advantages of the application will be further described with reference to the embodiments and the accompanying drawings. DETAILED DESCRIPTION

[0052] It should be understood that the specific embodiments described herein are merely for the purpose of illustrating the technical solutions of the present application and are not intended to limit the present application.

[0053] In order to better understand the technical solutions of the present application, the following will be described in detail in combination with the accompanying drawings and specific embodiments.

[0054] The main solution of the embodiment of the present application is: constructing a link weight matrix according to the communication information between each layer constellation and each gateway station, wherein the multi-layer constellation system includes at least two layer constellations, and each layer constellation includes at least one satellite; constructing a link matrix between each layer constellation and each gateway station, wherein each element in the link matrix is used to represent the link connection relationship between each layer constellation and each gateway station; solving the value of each element in the link matrix based on the link weight matrix, and determining the optimal connection gateway station of each layer constellation according to the value of each element in the link matrix.

[0055] Compared with a single constellation system, the gateway station link planning strategy in a multi-constellation system is a more complex problem, and the multi-constellation system refers to a system composed of multiple constellation configurations. In the multi-constellation system, there are more satellites and the phenomenon of overlapping coverage is common. A gateway station can be simultaneously within the coverage range of multiple satellites of multiple layer constellations, and the rule of gateway station link establishment is more complex. In addition, the position relationship of satellites in different constellations in the multi-constellation system is unstable, and generally no inter-constellation link is established, so it is necessary to design a suitable gateway station link to ensure that the data of each layer constellation can be returned.

[0056] The present application constructs a link weight matrix according to the communication information between each layer constellation and each gateway station, wherein the multi-layer constellation system includes at least two layer constellations, and each layer constellation includes at least one satellite. Then, a link matrix between each layer constellation and each gateway station is constructed, wherein each element in the link matrix is used to represent the link connection relationship between each layer constellation and each gateway station. Then, the value of each element in the link matrix is solved based on the link weight matrix, and the optimal connection gateway station of each layer constellation is determined according to the value of each element in the link matrix. The present application solves the value of each element in the link matrix based on the link weight matrix, and limits each layer constellation to establish a link with only one gateway station. The link connection relationship between each layer constellation and each gateway station can be obtained, so that the optimal connection gateway station for establishing a satellite-ground link with each layer constellation can be obtained, and the data of the entire multi-layer constellation system can be returned through the optimal connection gateway station.

[0057] It should be noted that the execution subject of the present application can be a device capable of obtaining gateway station information, satellite information, information between gateway stations and satellites, etc., such as a computer, other satellite communication devices.

[0058] Based on this, the embodiment of the present application provides a link planning method, which is described with reference toFigure 1 , Figure 1 The flowchart of the first embodiment of the link planning method of the present application is shown in FIG. 1.

[0059] In this embodiment, the link planning method comprises the following steps:

[0060] Step S10: constructing a link weight matrix according to the communication information between each layer constellation and each gateway station, wherein the multi-layer constellation system comprises at least two layer constellations, and each layer constellation comprises at least one satellite.

[0061] It should be understood that the multi-layer constellation system comprises at least two layer constellations, and each layer constellation comprises at least one satellite. For each layer constellation and each gateway station in the multi-layer constellation system, the communication information between each layer constellation and each gateway station can be obtained, which can include the shortest path, the longest visible duration, and the maximum received signal quality between each layer constellation and each gateway station.

[0062] It can be understood that the link weight matrix can be constructed according to the communication information between each layer constellation and each gateway station, assuming that the number of gateway stations in the multi-layer constellation system is X, i=0,...,X-1, and the number of constellation layers is Y, j=0,...,Y-1. The link weight matrix can be represented as:

[0063]

[0064] In the formula, W represents the link weight matrix, W ij represents the link weight between the i-th gateway station and the j-th layer constellation. In a feasible embodiment, taking the maximum received signal quality as an example, the i-th gateway station receives the maximum signal quality from the satellite in the j-th layer constellation, the stronger the signal quality, the larger the link weight, so the link weight can be set based on the maximum received signal quality.

[0065] Step S20: constructing a link matrix between each layer constellation and each gateway station, wherein each element in the link matrix is used to represent the link connection relationship between each layer constellation and each gateway station.

[0066] It can be understood that the link weight between each layer constellation and each gateway station can be constructed, which can be represented as:

[0067]

[0068] In the formula, E represents the link matrix, E ij represents the link connection relationship between the i-th gateway station and the j-th layer constellation, and the value of E ij is 0 or 1. When E ij =0, it means that there is no link between the i-th gateway station and the j-th layer constellation, otherwise, it means that a link is established between the i-th gateway station and the j-th layer constellation.

[0069] Step S30: solving the values of each element in the link matrix based on the link weight matrix, and determining the optimal connection gateway station of each layer constellation according to the values of each element in the link matrix.

[0070] It should be understood that the link weight matrix is a known constant, and the values of each element in the link matrix are unknown variables. The embodiment can solve the values of each element in the link matrix based on the link weight matrix, and determine the optimal connection gateway station of each layer constellation according to the values of each element in the link matrix.

[0071] Further, in order to accurately solve the values of each element in the link matrix, in the embodiment, the step S30 comprises: constructing a link planning model based on the link weight matrix and the link matrix; constructing a constraint condition of the link matrix according to the maximum number of links of each gateway station; solving the values of each element in the link matrix based on the constraint condition by using a convex optimization solving method, and determining the optimal connection gateway station of each layer constellation according to the values of each element in the link matrix.

[0072] It can be understood that a link planning model can be constructed based on the link weight matrix and the link matrix, which can be a link planning function, denoted as:

[0073]

[0074] It should be understood that, due to the limited number of links that each gateway station can build, and based on fairness and the actual needs of data transmission, if there is no inter-constellation link between constellations, the gateway station needs to establish at least one feeder link with each layer constellation for command / data transmission. The embodiment can construct a constraint condition of the link matrix according to the maximum number of links of each gateway station, which can include: 1. , that is, for any gateway station i, the sum of the number of links between each layer constellation is less than or equal to the maximum number of links of the i-th gateway station; 2. , that is, for any layer constellation j, only one gateway station is established; 3. , that is, the value of E ij is 0 or 1.

[0075] In a specific implementation, the above link planning model is a typical linear programming problem, which can be solved by using a convex optimization solving method to obtain E ij , and specifically taking E ij as a variable to obtain all values of E , and the maximum value of these values corresponds to E ijAs a solution result, the values of each element in the link matrix are obtained, and the optimal connection gateway station of each layer constellation is determined according to the values of each element in the link matrix. Since the constraint condition includes that only one gateway station is established for any layer constellation, the optimal connection gateway station corresponding to each layer constellation exists.

[0076] In this embodiment, the link weight matrix is constructed according to the communication information between each layer constellation and each gateway station. The multi-layer constellation system includes at least two layer constellations, and each layer constellation includes at least one satellite. Then, the link matrix between each layer constellation and each gateway station is constructed, wherein each element in the link matrix is used to represent the link connection relationship between each layer constellation and each gateway station. Then, the values of each element in the link matrix are solved based on the link weight matrix, and the optimal connection gateway station of each layer constellation is determined according to the values of each element in the link matrix. In this application, the values of each element in the link matrix are solved based on the link weight matrix, and the link connection relationship between each layer constellation and each gateway station is obtained by limiting each layer constellation to establish a link with only one gateway station. Thus, the optimal connection gateway station for establishing a space-ground link with each layer constellation can be obtained, and the data of the entire multi-layer constellation system is backhauled through the optimal connection gateway station.

[0077] Reference Figure 2 , Figure 2 The flowchart of the second embodiment of the link planning method of the application is shown in FIG. 2.

[0078] Based on the first embodiment, in this embodiment, after the step S30, the method further includes:

[0079] Step S40: For any optimal connection gateway station, determining the target layer constellation corresponding to the optimal connection gateway station.

[0080] It can be understood that for any optimal connection gateway station determined in the first embodiment, the target layer constellation corresponding to the optimal connection gateway station can be determined, i.e., which layer constellation establishes a link with the optimal connection gateway station.

[0081] Step S50: determining the first link weight between all satellites in the target layer constellation and the optimal connection gateway station, and selecting the best access satellite of the optimal connection gateway station from all satellites in the target layer constellation according to the first link weight.

[0082] It should be understood that the target layer constellation can include at least one satellite, and the first link weight between all satellites in the target layer constellation and the optimal connection gateway station can be determined. The first link weight can also be determined based on the communication information between the optimal connection gateway station and each satellite in the target layer constellation. Then, the satellite corresponding to the maximum value of all first link weights is selected as the best access satellite of the optimal connection gateway station.

[0083] Step S60: determining second link weights between each visible satellite in the visible satellite list corresponding to the optimal connection gateway station and the optimal connection gateway station, and selecting target satellites from the visible satellite list according to the second link weights, the number of the target satellites being the maximum number of links corresponding to the optimal connection gateway station minus 1.

[0084] It can be understood that the visible satellite list can include all satellites within the visible range of the optimal connection gateway station, and the second link weights between each visible satellite in the visible satellite list and the optimal connection gateway station are determined, and the target satellites are selected from the visible satellite list according to the second link weights. Specifically, the satellites corresponding to the larger values in all the second link weights can be selected as the target satellites, and the number of the target satellites is the maximum number of links corresponding to the optimal connection gateway station minus 1, the maximum number of links being the number of links that the optimal connection gateway station can establish with the satellites at most.

[0085] Step S70: adding the target satellites to the satellite list to be accessed of the optimal connection gateway station.

[0086] It should be understood that the satellite list to be accessed can include the satellites that the optimal connection gateway station wants to access according to the link weights, and the target satellites with the number of the maximum number of links of the optimal connection gateway station can be added to the satellite list to be accessed, and the number of satellites in the satellite list to be accessed is the maximum number of links of the optimal connection gateway station minus 1.

[0087] Step S80: constructing the satellite list to be accessed of all the optimal connection gateway stations according to the satellite list to be accessed and the optimal access satellite, and performing link planning on all the optimal connection gateway stations according to the satellite list to be accessed.

[0088] It can be understood that the satellite list to be accessed of the optimal connection gateway station can include the satellite list to be accessed of the optimal connection gateway station and the optimal access satellite, each optimal connection gateway station corresponding to a satellite list to be accessed, and each optimal connection gateway station can establish a link with each satellite in the corresponding satellite list to be accessed.

[0089] Further, in order to make each satellite establish a link with only one optimal connection gateway station, in the embodiment, the step S80 comprises: determining the repeated satellites in the to-be-accessed satellite list of all the optimal connection gateway stations, and adding the repeated satellites to the to-be-confirmed satellite list; for any to-be-confirmed satellite in the to-be-confirmed satellite list, determining the actual connection gateway station of the to-be-confirmed satellite based on the third link weight between the to-be-confirmed satellite and the corresponding optimal connection gateway station; determining the remaining connection gateway stations of all the optimal connection gateway stations except the actual connection gateway station, and deleting the to-be-confirmed satellite from the visible satellite list and the to-be-accessed satellite list of the remaining connection gateway stations to obtain the updated visible satellite list and the updated to-be-accessed satellite list corresponding to all the optimal connection gateway stations; determining the list length corresponding to the updated to-be-accessed satellite list of each optimal connection gateway station, in the case that the list length is less than a preset length, returning to the step of determining the second link weight between each visible satellite in the visible satellite list of the optimal connection gateway station and the optimal connection gateway station, and selecting the target satellite from the visible satellite list according to the second link weight, until there is no repeated satellite in the updated to-be-accessed satellite list of all the optimal connection gateway stations, and the list length of the updated to-be-accessed satellite list of all the optimal connection gateway stations is equal to the preset length; constructing the access satellite list of all the optimal connection gateway stations according to the updated to-be-accessed satellite list and the best access satellite, and performing link planning on all the optimal connection gateway stations according to the access satellite list.

[0090] It should be understood that after obtaining the to-be-accessed satellite list of all the optimal connection gateway stations, there can be repeated satellites, and the repeated satellites in the to-be-accessed satellite list of all the optimal connection gateway stations can be determined and added to the to-be-confirmed satellite list. For any to-be-confirmed satellite in the to-be-confirmed satellite list, the to-be-confirmed satellite corresponding to all the optimal connection gateway stations can be determined, and the third link weight between the to-be-confirmed satellite and each optimal connection gateway station can be determined, and the optimal connection gateway station corresponding to the maximum value of the third link weight is taken as the actual connection gateway station.

[0091] It can be understood that after obtaining the actual connection gateway station corresponding to each to-be-confirmed satellite, the remaining connection gateway stations except the actual connection gateway station can be determined, and the to-be-confirmed satellite is deleted from the visible satellite list and the to-be-accessed satellite list of the remaining connection gateway stations, i.e., the to-be-confirmed satellite is deleted from the visible satellite list and the to-be-accessed satellite list of the other optimal connection gateway stations except the actual connection gateway station, to obtain the updated visible satellite list and the updated to-be-accessed satellite list corresponding to all the optimal connection gateway stations.

[0092] In a specific implementation, a list length corresponding to the updated satellite list to be accessed of each optimal connection gateway station can be determined. If the list length is less than a preset length, it indicates that the optimal connection gateway station can still connect to other satellites. The preset length can be the maximum number of links corresponding to the optimal connection gateway station minus 1. At this time, the second link weight between each visible satellite in the visible satellite list corresponding to the optimal connection gateway station and the optimal connection gateway station can be returned, and the target satellite can be selected from the visible satellite list according to the second link weight. The updated satellite list to be accessed of all optimal connection gateway stations is obtained through the above steps. If there is no duplicate satellite in the updated satellite list to be accessed, and the list length of the updated satellite list to be accessed of all optimal connection gateway stations is equal to the preset length. Then, the access satellite list of all optimal connection gateway stations is constructed according to the updated satellite list to be accessed and the best access satellite, and the access satellite list can include the updated satellite list to be accessed and the best access satellite. Link planning is performed on all optimal connection gateway stations according to the access satellite list.

[0093] For any optimal connection gateway station, the target layer constellation corresponding to the optimal connection gateway station is determined, and then the first link weight between all satellites in the target layer constellation and the optimal connection gateway station is determined. The best access satellite of the optimal connection gateway station is selected from all satellites in the target layer constellation according to the first link weight. Then, the second link weight between each visible satellite in the visible satellite list corresponding to the optimal connection gateway station and the optimal connection gateway station is determined, and the target satellite is selected from the visible satellite list according to the second link weight. The number of target satellites is the maximum number of links corresponding to the optimal connection gateway station. Then, the target satellites are added to the satellite list to be accessed of the optimal connection gateway station. The access satellite list of all optimal connection gateway stations is constructed according to the satellite list to be accessed and the best access satellite, and link planning is performed on all optimal connection gateway stations according to the access satellite list. In this embodiment, the satellite list to be accessed of each optimal connection gateway station can be accurately obtained, and the access satellite corresponding to each optimal connection gateway station can be obtained through link planning on all optimal connection gateway stations according to the access satellite list.

[0094] Reference Figure 3 , Figure 3 The flowchart of the third embodiment of the link planning method of the present application is shown in FIG. 8.

[0095] Based on the above embodiments, after step S80, the method further includes:

[0096] Step S90: For any optimal connection gateway station, all initial links of the optimal connection gateway station are determined according to the access satellite list, and the communication frequency band of each initial link is determined.

[0097] It can be understood that for any optimal connection gateway station, all initial links of the optimal connection gateway station can be determined according to the access satellite list, the initial links of the same gateway station are close in space, and the communication frequency bands of the initial links can be determined.

[0098] Step S100: If the communication frequency bands exist frequency overlap, the initial links with the frequency overlap are divided into a to-be-detected link set.

[0099] It should be understood that if the communication frequency bands of an initial link and other links of the optimal connection gateway station exist frequency overlap, the initial link with the frequency overlap is divided into a link set. If the number of elements in the same link set is greater than 1, it indicates that the optimal connection gateway station simultaneously accesses multiple same-frequency links, and further judgment needs to be made through interference calculation, and the link set becomes a to-be-detected link set. If the communication frequency bands of an initial link and other links of the optimal connection gateway station do not exist frequency overlap, the initial link can exclusively use the corresponding frequency band.

[0100] Step S110: Calculate the interference value between any two to-be-detected links in the to-be-detected link set, and determine the link pair that needs to perform interference avoidance according to the interference value.

[0101] It can be understood that the interference value between any two to-be-detected links in the to-be-detected link set can be calculated, and if the interference value exceeds a threshold value, interference avoidance needs to be performed, and the link pair that needs to perform interference avoidance is determined.

[0102] Step S120: Construct an undirected graph according to the link pair, and determine a maximum clique in the undirected graph.

[0103] It should be understood that the undirected graph G=(V, E) can be constructed based on the link pair, and an edge E is added between two satellite nodes based on the interference detection result. Referring to Figure 4 , Figure 4 FIG. 1 is a schematic diagram of an undirected graph of an embodiment of the link planning method of the present application, assuming that there are four satellites, Figure 4 The edges between the nodes in FIG. 1 indicate that there is interference between the two links, that is, the link between the gateway station and satellite 1 and the link between the gateway station and satellite 2 exist interference, the link between the gateway station and satellite 2 and the link between the gateway station and satellite 3 exist interference, the link between the gateway station and satellite 2 and the link between the gateway station and satellite 4 exist interference, the link between the gateway station and satellite 3 and the link between the gateway station and satellite 4 exist interference, and the edges between the nodes can be used as the link pair. Figure 4 (1, 2) and (2, 3, 4) in FIG. 1 are two maximum cliques, and the links in the maximum cliques exist interference between each other.

[0104] Step S130: performing frequency segmentation detection on all target links in the maximal group, and determining target frequency bands corresponding to all target links of the optimal connection gateway station according to the detection result.

[0105] In a specific implementation, the embodiment can perform interference avoidance in a frequency segmentation manner, so as to ensure that there is no frequency band overlap after frequency segmentation of the links with interference. First, frequency segmentation detection can be performed on all target links in the maximal group, to determine whether frequency segmentation is needed for the target links. If frequency segmentation is needed, target frequency bands corresponding to all target links are determined.

[0106] Further, in order to accurately perform frequency segmentation detection on all target links, in the embodiment, the step S130 includes: calculating a first throughput reduction rate of all target links in the maximal group before frequency segmentation and a second throughput reduction rate of all target links after frequency segmentation; if the first throughput reduction rate is greater than the second throughput reduction rate, it is determined that the detection result is that frequency segmentation is needed; in the case that the detection result is that frequency segmentation is needed, available frequency bands of all target links in the maximal group are determined; and the available frequency bands are evenly allocated to all target links to obtain target frequency bands corresponding to all target links of the optimal connection gateway station.

[0107] It can be understood that the first throughput reduction rate of all target links in the maximal group before frequency segmentation and the second throughput reduction rate of all target links after frequency segmentation can be calculated, and the formula for calculating the throughput reduction rate is as follows:

[0108]

[0109] In the formula, B is the actual bandwidth of the link, is the actual bandwidth of the link, is the total available bandwidth, is the reference maximum spectral efficiency, which depends on the communication system, is the actual spectral efficiency of the link.

[0110] It should be understood that the first throughput reduction rate of all target links before frequency segmentation and the second throughput reduction rate of all target links after frequency segmentation can be calculated by the above formula. After frequency segmentation, the actual bandwidth and the actual spectral efficiency can change. If the first throughput reduction rate is greater than the second throughput reduction rate, it is determined that the detection result is that frequency segmentation is needed, and any two links do not use overlapping frequency bands, otherwise, frequency segmentation is not needed. Thus, unnecessary interference avoidance operations are effectively avoided.

[0111] In a specific implementation, in a case where the detection result is that frequency division is needed, the maximal groups that need to perform interference avoidance are first sorted in descending order of the number of nodes in the groups, the maximal group at the top of the sorted list is defined as a maximum group, frequency allocation is first performed for the links in the maximum group, the available frequency bands of all target links in the maximal group are determined, assuming that the available frequency bands are [Freq1, Freq2] and the bandwidth is BW, the available frequency bands are evenly allocated to all target links, and the frequency band occupied by each target link is BW / N, the frequency band of the first target link is [Freq1, Freq1+BW / N], the frequency band of the second target link is [Freq1+BW / N, Freq1+2BW / N], and so on. After obtaining the frequency bands of all links in the first maximum group, the maximum group is deleted, the next maximum group is obtained, and frequency division is performed. If the group contains an allocated link, the actual frequency band of the link is not changed, the remaining available bandwidth is evenly divided among the other unallocated links in the group, and the process is repeated until all links are allocated bandwidth, and the target frequency bands corresponding to all target links of the optimal connection gateway station are obtained.

[0112] For any optimal connection gateway station, the embodiment determines all initial links of the optimal connection gateway station according to the access satellite list, determines the communication frequency bands of the initial links, divides the initial links with frequency overlap into a set of to-be-detected links if the communication frequency bands have frequency overlap, calculates the interference value between any two to-be-detected links in the set of to-be-detected links, determines the link pairs that need to perform interference avoidance according to the interference value, constructs an undirected graph according to the link pairs, determines the maximal groups in the undirected graph, performs frequency division detection on all target links in the maximal groups, and determines the target frequency bands corresponding to all target links of the optimal connection gateway station according to the detection result. In a multi-layer constellation system, the isolation angles between multiple links of the same gateway station can be very small, and even can be collinear. Therefore, the embodiment first determines the link pairs that need to perform interference avoidance, and then performs frequency division on all target links, thereby effectively reducing the interference between the links of the same optimal connection gateway station.

[0113] Reference Figure 5 , Figure 5 The structure block diagram of the first embodiment of the link planning device is shown in FIG. 1.

[0114] As shown in FIG. 2, the link planning device provided by the embodiment includes: Figure 5

[0115] The link weight matrix construction module 10 is configured to construct a link weight matrix according to the communication information between each layer constellation and each gateway station, wherein the multi-layer constellation system includes at least two layer constellations, and each layer constellation includes at least one satellite.

[0116] ​The link matrix construction module 20 is configured to construct a link matrix between the multi-layer constellation and the gateway stations, wherein each element in the link matrix is used to represent a link connection relationship between the multi-layer constellation and the gateway stations.

[0117] The gateway station determination module 30 is configured to solve the value of each element in the link matrix based on the link weight matrix, and determine the optimal connection gateway station of the multi-layer constellation according to the value of each element in the link matrix.

[0118] In the embodiment, the link weight matrix is constructed based on the communication information between the multi-layer constellation and the gateway stations, wherein the multi-layer constellation system includes at least two layers of constellations, and each layer of constellations includes at least one satellite. Then, the link matrix between the multi-layer constellation and the gateway stations is constructed, wherein each element in the link matrix is used to represent a link connection relationship between the multi-layer constellation and the gateway stations. Then, the value of each element in the link matrix is solved based on the link weight matrix, and the optimal connection gateway station of the multi-layer constellation is determined according to the value of each element in the link matrix. In the application, the value of each element in the link matrix is solved based on the link weight matrix, and each layer of constellations is limited to establish a link with only one gateway station, so that the link connection relationship between the multi-layer constellation and the gateway stations can be obtained, and the optimal connection gateway station of the multi-layer constellation can be obtained, thereby ensuring that the data of the entire multi-layer constellation system is transmitted back through the optimal connection gateway station.

[0119] It should be noted that the above-described workflow is only illustrative and does not limit the scope of protection of the application. In actual application, a person skilled in the art can select part or all of them to achieve the purpose of the embodiment scheme according to actual needs, which is not limited here.

[0120] In addition, technical details not described in detail in the embodiment can be referred to the link planning method provided by any embodiment of the application, which will not be described here.

[0121] Based on the first embodiment of the link planning device described above, the second embodiment of the link planning device of the application is proposed.

[0122] In the embodiment, the gateway station determination module 30 is further configured to construct a link planning model based on the link weight matrix and the link matrix, construct a constraint condition of the link matrix according to the maximum number of links of each gateway station, solve the value of each element in the link matrix based on the constraint condition by using a convex optimization solving method, and determine the optimal connection gateway station of the multi-layer constellation according to the value of each element in the link matrix.

[0123] The link planning device further comprises a link planning module configured to determine, for any optimal connection gateway station, a target layer constellation corresponding to the optimal connection gateway station; determine first link weights between all satellites in the target layer constellation and the optimal connection gateway station, and select, from the target layer constellation, a best access satellite for the optimal connection gateway station according to the first link weights; determine second link weights between each visible satellite in a visible satellite list corresponding to the optimal connection gateway station and the optimal connection gateway station, and select, from the visible satellite list, a target satellite according to the second link weights, the number of the target satellite being the maximum number of links corresponding to the optimal connection gateway station minus 1; add the target satellite to a to-be-accessed satellite list of the optimal connection gateway station; construct an access satellite list of all optimal connection gateway stations according to the to-be-accessed satellite list and the best access satellite, and perform link planning on all optimal connection gateway stations according to the access satellite list.

[0124] Further, the link planning module is further configured to determine repeated satellites in the to-be-accessed satellite list of all optimal connection gateway stations, and add the repeated satellites to a to-be-confirmed satellite list; for any to-be-confirmed satellite in the to-be-confirmed satellite list, determine an actual connection gateway station of the to-be-confirmed satellite based on a third link weight between the to-be-confirmed satellite and the corresponding optimal connection gateway station; determine remaining connection gateway stations in all optimal connection gateway stations except the actual connection gateway station, and delete the to-be-confirmed satellite from the visible satellite list and the to-be-accessed satellite list of the remaining connection gateway stations to obtain updated visible satellite lists and updated to-be-accessed satellite lists corresponding to all optimal connection gateway stations; determine a list length corresponding to the updated to-be-accessed satellite list of each optimal connection gateway station, and in a case where the list length is less than a preset length, return to the step of determining the second link weights between each visible satellite in the visible satellite list and the optimal connection gateway station, and selecting the target satellite from the visible satellite list according to the second link weights, until there is no repeated satellite in the updated to-be-accessed satellite list of all optimal connection gateway stations, and the list length of the updated to-be-accessed satellite list of all optimal connection gateway stations is equal to the preset length; construct an access satellite list of all optimal connection gateway stations according to the updated to-be-accessed satellite list and the best access satellite, and perform link planning on all optimal connection gateway stations according to the access satellite list.

[0125] Further, the link planning apparatus further comprises an interference avoidance module, configured to: for any optimal connection gateway station, determine all initial links of the optimal connection gateway station according to the access satellite list, and determine a communication frequency band of each initial link; if the communication frequency bands have frequency overlap, divide the initial links having frequency overlap into a to-be-detected link set; calculate an interference value between any two to-be-detected links in the to-be-detected link set, and determine a link pair requiring interference avoidance according to the interference value; construct an undirected graph according to the link pair, and determine a maximum clique in the undirected graph; perform frequency segmentation detection on all target links in the maximum clique, and determine a target frequency band corresponding to all target links of the optimal connection gateway station according to a detection result.

[0126] Further, the interference avoidance module is further configured to: calculate a first throughput drop rate of all target links in the maximum clique before frequency segmentation and a second throughput drop rate of all target links in the maximum clique after frequency segmentation; if the first throughput drop rate is greater than the second throughput drop rate, determine that the detection result is that frequency segmentation is required; in a case where the detection result is that frequency segmentation is required, determine available frequency bands of all target links in the maximum clique; and perform average allocation of frequency bands for all target links according to the available frequency bands, to obtain the target frequency band corresponding to all target links of the optimal connection gateway station.

[0127] Other embodiments or specific implementations of the link planning apparatus can refer to the above-mentioned method embodiments, and will not be described here.

[0128] The present application provides a link planning device, which comprises: at least one processor; and a memory connected with the at least one processor in communication; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the link planning method in Embodiment I.

[0129] Reference will be made to the following description Figure 6 , which shows a structural schematic diagram of a link planning device suitable for implementing embodiments of the present application. The link planning device in the embodiments of the present application can include, but is not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (Personal Digital Assistant), PADs (Portable Application Description), PMPs (Portable Media Player), vehicle-mounted terminals (for example, vehicle-mounted navigation terminals), and the like, and fixed terminals such as digital TVs, desktop computers, and the like. Figure 6The illustrated link planning device is merely one example and should not be taken as limiting the scope of functionality or use of embodiments of the application.

[0130] As shown in Figure 6 The link planning device can include a processing device 1001 (e.g., a central processing unit, a graphics processing unit, etc.) that can perform various appropriate actions and processes according to a program stored in a read only memory (ROM) 1002 or a program loaded from a storage device 1003 into a random access memory (RAM) 1004. Various programs and data required for operation of the link planning device are also stored in the RAM 1004. The processing device 1001, the ROM 1002, and the RAM 1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; the storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the link planning device to communicate wirelessly or by wire with other devices to exchange data. While the link planning device is shown with various systems, it should be understood that not all of the illustrated systems are required to be implemented or present. More or fewer systems can alternatively be implemented or present.

[0131] In particular, the processes described above with reference to the flowcharts can be implemented as a computer software program according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a computer readable medium, the computer program containing program code for performing the methods illustrated by the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network by the communication device, or installed from the storage device 1003, or installed from the ROM 1002. When the computer program is executed by the processing device 1001, the above-described functions defined in the methods of embodiments of the present disclosure are performed.

[0132] The link planning device provided by the application adopts the link planning method in the above embodiment, and can solve the technical problem of how to ensure that each layer of the constellation has at least one star-ground link and ensure that data in the entire multi-layer constellation system can be returned. Compared with the prior art, the beneficial effects of the link planning device provided by the application are the same as those of the link planning method provided by the above embodiment, and other technical features in the link planning device are the same as those disclosed in the previous embodiment method, which will not be repeated here.

[0133] It should be understood that various parts of the present application can be realized by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0134] The above is merely specific implementation of the present application, but the protection scope of the present application is not limited thereto, and any person skilled in the art can easily think of changes or replacements within the technical scope disclosed by the present application, which should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

[0135] The present application provides a computer readable storage medium having computer readable program instructions (i.e. computer programs) stored thereon, the computer readable program instructions being used to execute the link planning method in the above embodiment.

[0136] The computer readable storage medium provided by the present application may, for example, be a U disk, but is not limited to an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, system or device, or any combination of the above. More specific examples of computer readable storage media can include, but are not limited to, an electrical connection having one or more conductive wires, a portable computer diskette, a hard disk, a random access memory (RAM: Random Access Memory), a read only memory (ROM: Read Only Memory), an erasable programmable read only memory (EPROM: Erasable Programmable Read Only Memory or flash memory), an optical fiber, a portable compact disk read only memory (CD-ROM: CD-Read Only Memory), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present embodiment, the computer readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, system or device. The program code contained on the computer readable storage medium can be transmitted by any suitable medium, including but not limited to: electrical wires, optical cables, RF (Radio Frequency: Radio Frequency), etc., or any suitable combination of the above.

[0137] The computer readable storage medium can be included in the link planning device, or can exist separately and not be assembled into the link planning device.

[0138] The computer readable storage medium carries one or more programs, and when the one or more programs are executed by the link planning device, the link planning device is caused to: construct a link weight matrix according to communication information between each layer constellation and each gateway station, wherein the multi-layer constellation system includes at least two layer constellations, and each layer constellation includes at least one satellite; construct a link matrix between each layer constellation and each gateway station, wherein each element in the link matrix is used to represent a link connection relationship between each layer constellation and each gateway station; solve values of each element in the link matrix based on the link weight matrix, and determine optimal connection gateway stations of each layer constellation according to the values of each element in the link matrix.

[0139] Computer program code for carrying out operations of the present application can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0140] The flow and block diagrams in the drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flow and block diagrams can represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical functions. It should also be noted that in some alternative implementations, the functions noted in the blocks can occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently or the blocks can sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and / or flowchart illustrations, and combinations thereof, can be implemented by a dedicated hardware-based system that performs the specified functions or operations, or combinations of hardware and software.

[0141] The modules involved in the embodiments of the present application can be implemented in software or in hardware. In some cases, the names of the modules do not limit the modules themselves.

[0142] The readable storage medium provided by the present application is a computer readable storage medium, which stores computer readable program instructions (i.e., a computer program) for executing the link planning method described above, and can solve the technical problem of how to ensure that each layer of the constellation has at least one satellite-ground link and ensure that the data of the entire multi-layer constellation system can be returned. Compared with the prior art, the computer readable storage medium provided by the present application has the same beneficial effects as the link planning method provided by the above-mentioned embodiments, and will not be described here.

[0143] The present application also provides a computer program product comprising a computer program, which, when executed by a processor, implements the steps of the link planning method as described above.

[0144] The computer program product provided by the present application can solve the technical problem of how to ensure that each layer of the constellation has at least one satellite-ground link and ensure that the data of the entire multi-layer constellation system can be returned. Compared with the prior art, the computer program product provided by the present application has the same beneficial effects as the link planning method provided by the above-mentioned embodiments, and will not be described here.

[0145] The above only describes some embodiments of the present application, and does not limit the protection scope of the present application, and any equivalent structural transformation made by using the content of the present application specification and drawings, or direct / indirect application in other related technical fields is included in the protection scope of the present application.

Claims

1. A link planning method, characterized in that, The link planning method includes the following steps: A link weight matrix is ​​constructed based on the communication information between each constellation layer and each gateway station. The multi-layer constellation system includes at least two constellations, and each constellation layer includes at least one satellite. Construct a link matrix between each constellation layer and each gateway station, wherein each element in the link matrix is ​​used to represent the link connectivity relationship between each constellation layer and each gateway station; The value of each element in the link matrix is ​​calculated based on the link weight matrix, and the optimal connection gateway station for each constellation layer is determined based on the value of each element in the link matrix. The process of solving for the value of each element in the link matrix based on the link weight matrix, and determining the optimal connection gateway station for each constellation layer based on the value of each element in the link matrix, includes: A link planning model is constructed based on the link weight matrix and the link matrix; The constraints for constructing the link matrix are based on the maximum number of links at each gateway station; Based on the constraints, the values ​​of each element in the link matrix are solved using convex optimization, and the optimal connection gateway stations for each constellation layer are determined according to the values ​​of each element in the link matrix.

2. The link planning method as described in claim 1, characterized in that, After solving for the value of each element in the link matrix based on the link weight matrix, and determining the optimal connection gateway station for each constellation layer based on the value of each element in the link matrix, the method further includes: For any optimal connection gateway, determine the target layer constellation corresponding to that optimal connection gateway; Determine the first link weight between all satellites in the target layer constellation and the optimal connection gateway station, and select the best access satellite for the optimal connection gateway station from all satellites in the target layer constellation based on the first link weight; Determine the second link weight between each visible satellite in the visible satellite list corresponding to the optimal connection gateway station and the optimal connection gateway station, and select target satellites from the visible satellite list according to the second link weights. The number of target satellites is the maximum number of links corresponding to the optimal connection gateway station minus 1. Add the target satellite to the list of satellites to be accessed by the optimal connection gateway station; Based on the list of satellites to be accessed and the list of best access satellites, construct a list of access satellites for all optimally connected gateway stations, and perform link planning for all optimally connected gateway stations based on the list of access satellites.

3. The link planning method as described in claim 2, characterized in that, The step of constructing an access satellite list for all optimally connected gateway stations based on the list of satellites to be accessed and the list of optimally accessed satellites, and performing link planning for all optimally connected gateway stations based on the access satellite list, includes: Identify duplicate satellites in the list of satellites to be accessed for all optimal connection gateways, and add the duplicate satellites to the list of satellites to be confirmed; For any unconfirmed satellite in the list of unconfirmed satellites, the actual connected gateway station of the unconfirmed satellite is determined based on the third link weight between the unconfirmed satellite and the corresponding optimal connected gateway station. Identify the remaining connecting gateway stations among all optimal connecting gateway stations, excluding the actual connecting gateway station, and delete the unconfirmed satellite from the visible satellite list and the satellite to be accessed list of the remaining connecting gateway stations to obtain the updated visible satellite list and the updated satellite to be accessed list corresponding to all optimal connecting gateway stations. The process involves determining the list length corresponding to the updated list of satellites to be accessed for each optimal connection gateway station. If the list length is less than a preset length, the process returns to the step of determining the second link weight between each visible satellite in the visible satellite list corresponding to the optimal connection gateway station and the optimal connection gateway station, and selecting a target satellite from the visible satellite list according to the second link weight, until there are no duplicate satellites in the updated list of satellites to be accessed for all optimal connection gateway stations, and the list length of the updated list of satellites to be accessed for all optimal connection gateway stations is equal to the preset length. Based on the updated list of satellites to be accessed and the list of best access satellites, an access satellite list for all optimally connected gateway stations is constructed, and link planning is performed for all optimally connected gateway stations based on the access satellite list.

4. The link planning method as described in claim 2, characterized in that, After the steps of constructing an access satellite list of all optimally connected gateway stations based on the list of satellites to be accessed and the list of optimally accessed satellites, and performing link planning for all optimally connected gateway stations based on the access satellite list, the method further includes: For any optimal connection gateway station, all initial links of the optimal connection gateway station are determined according to the access satellite list, and the communication frequency band of each initial link is determined; If the communication frequency bands overlap, the initial links with overlapping frequencies will be included in the set of links to be detected. Calculate the interference value between any two links in the set of links to be detected, and determine the link pairs that need to be interfered with based on the interference value; Construct an undirected graph based on the link pairs, and determine the maximal cliques in the undirected graph; Frequency segmentation detection is performed on all target links in the maximum clique, and the target frequency bands corresponding to all target links of the optimal connection gateway station are determined based on the detection results.

5. The link planning method as described in claim 4, characterized in that, The step of performing frequency segmentation detection on all target links in the maximum clique and determining the target frequency bands corresponding to all target links of the optimal connection gateway station based on the detection results includes: Calculate the first throughput reduction rate and the second throughput reduction rate before frequency partitioning for all target links in the maximal clique; If the first throughput decrease rate is greater than the second throughput decrease rate, then the detection result is determined to be that frequency segmentation is required; If the detection result indicates that frequency segmentation is required, determine the available frequency bands of all target links in the maximal clique; Based on the available frequency bands, the frequency bands are evenly allocated to all target links to obtain the target frequency bands corresponding to all target links of the optimal connection gateway station.

6. A link planning device, characterized in that, The link planning device includes: The link weight matrix construction module is used to construct a link weight matrix based on the communication information between each constellation layer and each gateway station. The multi-layer constellation system includes at least two constellations, and each constellation layer includes at least one satellite. The link matrix construction module is used to construct the link matrix between each constellation layer and each gateway station, wherein each element in the link matrix is ​​used to represent the link connectivity relationship between each constellation layer and each gateway station; The gateway station determination module is used to solve for the value of each element in the link matrix based on the link weight matrix, and determine the optimal connection gateway station for each constellation layer according to the value of each element in the link matrix; The gateway station determination module is further configured to construct a link planning model based on the link weight matrix and the link matrix; construct constraints on the link matrix based on the maximum number of links for each gateway station; solve for the value of each element in the link matrix using convex optimization based on the constraints; and determine the optimal connection gateway station for each constellation layer based on the value of each element in the link matrix.

7. A link planning device, characterized in that, The device includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the link planning method as described in any one of claims 1 to 5.

8. A storage medium, characterized in that, The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, it implements the steps of the link planning method as described in any one of claims 1 to 5.

9. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the steps of the link planning method as described in any one of claims 1 to 5.

Images