Method, device and storage medium for allocating beam resources between heterogeneous constellations

By constructing a wave bitmap model of overlapping regions between heterogeneous constellations and using an indefinite color graph model coloring scheme to simulate annealing, the interference problem in the allocation of beam spectrum resources between heterogeneous constellations is solved, and the subconstellations spectrum resources are realized. Maximize sharing and overall spectrum usage efficiency improvement.

CN118798602BActive Publication Date: 2024-11-29NAT RADIO MONITORING CENT
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202411284828.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-09-13
Publication Date
2024-11-29
Estimated Expiration
2044-09-13

AI Technical Summary

Technical Problem

Among heterogeneous constellations, especially in the overlapping coverage areas of the primary constellation and secondary constellation, it is difficult for the prior art to effectively allocate beam spectrum resources, resulting in unavoidable interference and affecting the maximum sharing of spectrum resources.

Method used

By constructing a wave bitmap model for overlapping regions between heterogeneous constellations, the optimization method of indefinite color graph model coloring scheme based on simulated annealing is calculated to calculate the maximum number of colors that can be used for coloring of graph models, and the coloring is adjusted through random perturbation and Metropolis criterion Solution, find the appropriate number of color colors and the best color scheme for the graph model.

Benefits of technology

On the premise of ensuring the needs of users of each wave position of the main constellation, maximize the spectrum resources that can be shared by the secondary constellation, improve the overall spectrum usage efficiency, and reduce interference between the primary and secondary constellations.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118798602B_ABST
    Figure CN118798602B_ABST
Patent Text Reader

Abstract

The present invention discloses a method, device and storage medium for beam resource allocation between heterogeneous constellations, the method comprising: a step of determining the maximum number of available coloring colors and initializing the K value, a step of generating an initial coloring scheme of a K color graph model and setting simulated annealing parameters, a step of iterating the coloring scheme of the K color graph model, a step of judging the number of inner loops, a step of judging the temperature, a step of updating parameters, a step of determining the best coloring scheme of the K color graph model and a step of determining the final coloring scheme of the graph model. The present invention aims at the problem of beam resource allocation between heterogeneous constellations under multiple constraints, by constructing a wave position graph model of overlapping service coverage areas between heterogeneous constellations, and adopting an indefinite color graph model coloring scheme optimization method based on simulated annealing to find a suitable graph model coloring color number and a corresponding optimal coloring scheme, and on the premise of ensuring the needs of users of each wave position of the main heterogeneous constellation, maximizes the spectrum resources that can be shared by the secondary heterogeneous constellation and improves the overall spectrum utilization efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of satellite communication technology, and in particular to a method, device and storage medium for allocating beam resources between heterogeneous constellations. Background Art

[0002] A heterogeneous constellation is a satellite network composed of multiple satellites with different orbits, different types or different functions. These satellites can achieve comprehensive monitoring and coverage of specific areas or targets by working together. With the growing demand for satellite communications in various fields, heterogeneous constellations are showing a blowout development trend. Since orbital resources are scarce resources, with the large-scale deployment of heterogeneous constellations, the problem of interference between constellations has become prominent. According to the relevant coordination provisions of the ITU Radio Regulations, the later deployed constellation needs to be negotiated with the previously deployed constellation before use, that is, there is a priority difference in actual use. The first deployed constellation can be regarded as the main constellation, and the later deployed constellation is the secondary constellation. The secondary constellation shall not interfere with the main constellation. When the coverage area of ​​the main constellation and the secondary constellation overlap, in order not to affect the normal business of the main constellation and enable the secondary constellation to share spectrum resources to the maximum extent, it has become an urgent problem to be solved between heterogeneous constellations.

[0003] like Figure 1 As shown, the primary and secondary heterogeneous constellation satellites are at different orbital altitudes, and there is an overlapping coverage area within their service range. The overlapping area contains several fixed wave positions, each wave position is covered by a fixed beam, and the secondary constellation satellite and the primary constellation satellite have the same wave position division in the overlapping area.

[0004] like Figure 2 As shown in the figure, the allocation of beam spectrum resources between the primary and secondary heterogeneous constellations is equivalent to the graph model coloring problem based on the double-layer wave position graph. For each heterogeneous constellation, the interference problem between the beams within the constellation can be avoided by coloring the graph model with four colors. However, when the primary and secondary heterogeneous constellation satellite wave position graph models are both colored with the same four colors, and the spectrum resource requirements of the primary and secondary heterogeneous constellations in each wave position in the overlapping area cannot be met simultaneously by frequency division, the interference between the primary and secondary heterogeneous constellations cannot be avoided. Therefore, it is necessary to study a new graph model coloring method to allocate beam spectrum resources between heterogeneous constellations, thereby reducing the interference between the primary and secondary heterogeneous constellations. Summary of the invention

[0005] The present invention aims to solve one of the technical problems in the related art to at least a certain extent. To this end, one object of the present invention is to provide a method, device and storage medium for allocating beam resources between heterogeneous constellations, which can reasonably and efficiently allocate beam spectrum resources between heterogeneous constellations, so that the secondary constellation can share spectrum resources to the maximum extent without interfering with the primary constellation.

[0006] The technical solution adopted by the present invention is:

[0007] In a first aspect, the present invention provides a method for allocating beam resources between heterogeneous constellations, the method comprising: S11: constructing a wave position diagram model of an overlapping area between heterogeneous constellations according to known parameters of the heterogeneous constellations, and calculating a maximum number of coloring colors that can be used for coloring the diagram model according to spectrum requirements of each wave position of the primary constellation and spectrum requirements of each wave position of the secondary constellation, set to K max , and set the initial value of the coloring color number K of the graph model to 4; S12: randomly generate a K-color graph model coloring scheme i according to the sub-constellation wave position graph model of the overlapping area K This scheme meets the requirements of different colors of adjacent wave positions within the sub-constellation, and calculates i through the evaluation function formula K The evaluation value f(i K ), set the optimal solution S K for i K , set the simulated annealing parameters: initial temperature T0, end temperature T end , the initial value of the number of inner loop terminations is n0, the current temperature T is set to T0, the current number of inner loop terminations n is 0, and the current number of inner loop terminations n is end is n0; S13: random perturbation generates a new K-color graph model coloring scheme j K , and calculate j through the evaluation function formula K The evaluation value f(j K ), compare f(i K ) and f(j K ) size, if f(j K ) is less than or equal to f(i K ), then the first iteration step is executed; otherwise, the second iteration step is executed, wherein the first iteration step is: K =j K Update this plan K , through f(i K )=f(j K ) Update the evaluation value f(i K ), through S K =j K Update the optimal solution S K , the second iteration step is: let , with probability Follow the Metropolis criteria to determine if you pass the i K =j K Update this plan K , and determine whether f(i K )=f(j K ) Update the evaluation value f(i K); S14: Update the current inner loop number n=n+1, and determine whether n is equal to n end If yes, then execute step S15, otherwise, execute step S13; S15: Determine whether the current temperature T is less than or equal to T end If yes, then execute step S17, otherwise, execute step S16 and jump to step S13; S16: Update parameters. The method of updating parameters is: cool down the current temperature T by T=ɑT, ɑ is the temperature decay rate, and Then, for the n end The method of rounding the value updates the current number of inner loop terminations n end , β is the increase rate of the number of inner loop terminations, and the current number of inner loops n is reset to 0; S17: compare f(S K ) and f(j K ), select the solution corresponding to the smaller evaluation value as the best solution C under the K color graph model coloring K , update K=K+1, and determine whether K is greater than K max If yes, then execute step S18, otherwise, execute step S12; S18: Compare the best solution C for coloring the graph model under each color number K (K=4,…,K max ), the solution corresponding to the minimum evaluation value is taken as the final solution for coloring the indefinite color graph model.

[0008] The known parameters of the heterogeneous constellation in step S11 include: the number of beams in the overlapping area between heterogeneous constellations, the total bandwidth of the constellation beams, the coloring scheme of the main heterogeneous constellation, the spectrum requirement of each beam of the main constellation, and the spectrum requirement of each beam of the secondary constellation.

[0009] The wave pattern model of the overlapping area between heterogeneous constellations in step S11 is a double-layer structure, including a primary constellation wave pattern model in the overlapping area and a secondary constellation wave pattern model in the overlapping area.

[0010] In step S11, the maximum number of colors that can be used for coloring the graph model is calculated as K according to the spectrum requirements of each wave position of the primary constellation and the spectrum requirements of each wave position of the secondary constellation. max Including: The maximum number of colors K that can be tried when coloring the graph model can be obtained by the following formula: max : ; This formula is for and The result of the division of is rounded down, where is the total bandwidth of the constellation beam, It is the maximum value of the spectrum requirements of each wavelength position of the primary constellation and the spectrum requirements of each wavelength position of the secondary constellation.

[0011] The evaluation function formula is as follows: ,in, is the penalty factor for the violation of the four-color principle by the internal wave position of the sub-constellation satellite, which is set to 10000; The number of times the four-color principle is violated in a coloring scheme of a constellation wave diagram model; is the penalty factor for the same-wavelength-position-and-color interference between constellations, which is set to 100; is the number of times the same color interference exists in the same wave position between constellations; is the penalty factor for the presence of same-color interference in adjacent wave positions between constellations, set to 1; is the number of times the same-color interference exists in adjacent wave positions between constellations; The penalty factor for the failure of the secondary constellation to provide service is set to 0.0001; It is the sum of spectrum requirements corresponding to each closed service wave position in the secondary constellation.

[0012] Among them, the random perturbation in step S13 generates a new K color graph model coloring scheme j K Includes: Randomly change the scheme i K If the changed scheme still meets the requirement of different colors of adjacent wave positions in the K color graph model, then the new scheme j is completed. K Otherwise, keep the color of vertex A after changing, adjust the colors of other vertices until the K color graph model coloring adjacent wave position different color requirements are met, and then the new solution j is completed. K Generation of.

[0013] Among them, in step S13, the probability According to the Metropolis criteria, determine whether to include this plan in K Replace this solution K Includes: randomly generate a number in the interval [0,1), if the probability If it is greater than the random number, then scheme j is accepted. K , and update i K for j K 、f(i K ) is f(j K ), if not, then keep solution i K .

[0014] In a second aspect, the present invention provides a device for allocating beam resources between heterogeneous constellations, the device comprising: a module for determining the maximum number of available coloring colors and initializing a K value, for constructing a wave position diagram model of an overlapping area between heterogeneous constellations according to known parameters of the heterogeneous constellations, and calculating the maximum number of coloring colors that can be used for coloring the diagram model according to the spectrum requirements of each wave position of the primary constellation and the spectrum requirements of each wave position of the secondary constellation, set as K max, and set the initial value of the coloring color number K of the graph model to 4; K color graph model initial coloring scheme generation and simulated annealing parameter setting module, used to randomly generate a K color graph model coloring scheme i according to the sub-constellation wave position graph model of the overlapping area K This scheme meets the requirements of different colors of adjacent wave positions within the sub-constellation, and calculates i through the evaluation function formula K The evaluation value f(i K ), set the optimal solution S K for i K , set the simulated annealing parameters: initial temperature T0, end temperature T end , the initial value of the number of inner loop terminations is n0, the current temperature T is set to T0, the current number of inner loop terminations n is 0, and the current number of inner loop terminations n is end is n0; K-color graph model coloring scheme iteration module, used to randomly perturb and generate a new K-color graph model coloring scheme j K , and calculate j through the evaluation function formula K The evaluation value f(j K ), compare f(i K ) and f(j K ) size, if f(j K ) is less than or equal to f(i K ), then the first iteration step is executed; otherwise, the second iteration step is executed, wherein the first iteration step is: K =j K Update this plan K , through f(i K )=f(j K ) Update the evaluation value f(i K ), through S K =j K Update the optimal solution S K , the second iteration step is: let , with probability Follow the Metropolis criteria to determine if you pass the i K =j K Update this plan K , and determine whether f(i K )=f(j K ) Update the evaluation value f(i K ); Inner loop times judgment module, used to update the current inner loop times n=n+1, and judge whether n is equal to n end If yes, it jumps to the temperature judgment module, otherwise, it jumps to the K color graph model coloring scheme iteration module; the temperature judgment module is used to determine whether the current temperature T is less than or equal to T endIf yes, it will jump to the K-color graph model coloring optimal solution determination module. Otherwise, it will jump to the parameter update module and then jump to the K-color graph model coloring solution iteration module. The parameter update module is used to update the parameters. The method of updating the parameters is: cool down the current temperature T by T=ɑT, ɑ is the temperature decay rate, and Then, for the n end The method of rounding the value updates the current number of inner loop terminations n end , β is the increase rate of the number of inner loop terminations, and the current number of inner loops n is reset to 0; K color graph model coloring optimal solution determination module is used to compare f(S K ) and f(j K ), select the solution corresponding to the smaller evaluation value as the best solution C under the K color graph model coloring K , update K=K+1, and determine whether K is greater than K max If yes, then jump to the module for determining the final coloring scheme of the graph model. Otherwise, jump to the module for generating the initial coloring scheme of the K-color graph model and setting the simulated annealing parameters. The module for determining the final coloring scheme of the graph model is used to compare the best coloring scheme C of the graph model under different color numbers. K (K=4,…,K max ), the solution corresponding to the minimum evaluation value is taken as the final solution for coloring the indefinite color graph model.

[0015] In a third aspect, the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to enable a computer to execute the method as described above.

[0016] The beneficial effects of the present invention are:

[0017] The method for allocating beam resources between heterogeneous constellations proposed in the present invention constructs a wave graph model of overlapping areas between heterogeneous constellations, and adopts an indefinite color graph model coloring scheme optimization method based on simulated annealing to find a suitable graph model coloring number and a corresponding optimal coloring scheme. On the premise of ensuring the needs of users of each wave position of the main heterogeneous constellation, the spectrum resources that can be shared by the secondary heterogeneous constellation are maximized, thereby improving the overall spectrum utilization efficiency.

[0018] In this optimization method, the number of inner loop iterations increases exponentially as the outer loop temperature decreases. When the temperature is high, it is equivalent to the coarse search stage. Selecting a smaller number of searches can significantly reduce the calculation time and have a smaller impact on the results. When the temperature is low, it is equivalent to the fine search stage. Selecting a larger number of searches can increase the success rate of searching for the optimal solution.

[0019] Since simulated annealing is a non-ergodic algorithm, it is impossible to traverse all candidate solutions. Therefore, after a series of perturbations, the final result may be perturbed from the optimal solution to a suboptimal solution. In order to avoid missing the optimal solution during the perturbation process, this algorithm adopts the method of updating and storing the optimal solution. When the fitness value of the new solution after each perturbation is better than the previous one, the solution is updated and saved as the optimal solution. When the final solution is output, the output solution at the end of the cycle is compared with the saved optimal solution, and the best of the two is output as the final output solution, which effectively improves the quality of the algorithm. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Figure 1 is a schematic diagram of overlapping coverage areas between heterogeneous constellations;

[0021] Figure 2 It is a model of beam spectrum resource allocation graph among heterogeneous constellations;

[0022] Figure 3 It is a flowchart of an embodiment of a method for allocating beam resources between heterogeneous constellations according to the present invention;

[0023] Figure 4 yes Figure 3 A simulation effect diagram of an application embodiment;

[0024] Figure 5 yes Figure 3 A simulation effect diagram of another application embodiment;

[0025] Figure 6 yes Figure 3 A simulation effect diagram of another application embodiment;

[0026] Figure 7 It is a structural schematic diagram of an embodiment of a device for allocating beam resources between heterogeneous constellations of the present invention. DETAILED DESCRIPTION

[0027] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application may be combined with each other.

[0028] See also Figure 3 , Figure 3 FIG. 1 is a flow chart of an embodiment of a method for allocating beam resources between heterogeneous constellations of the present invention. Figure 3 As shown, the method comprises the following steps:

[0029] S11: Construct a wave position diagram model of the overlapping area between heterogeneous constellations based on the known parameters of the heterogeneous constellations. According to the spectrum requirements of each wave position of the primary constellation and the spectrum requirements of each wave position of the secondary constellation, calculate the maximum number of colors that can be used to color the diagram model, set as K max , and set the initial value of the coloring color K of the graph model to 4;

[0030] S12: According to the sub-constellation wave position map model of the overlapping area, a K-color map model coloring scheme i is randomly generated K This scheme meets the requirements of different colors of adjacent wave positions within the sub-constellation, and calculates i through the evaluation function formula K The evaluation value f(i K ), set the optimal solution S K for i K , set the simulated annealing parameters: initial temperature T0, end temperature T end , the initial value of the number of inner loop terminations is n0, the current temperature T is set to T0, the current number of inner loop terminations n is 0, and the current number of inner loop terminations n is end is n0;

[0031] S13: Random perturbation generates new K-color graph model coloring scheme j K , and calculate j through the evaluation function formula K The evaluation value f(j K ), compare f(i K ) and f(j K ) size, if f(j K ) is less than or equal to f(i K ), then execute the first iteration step; otherwise, execute the second iteration step;

[0032] S14: Update the current inner loop times n=n+1, and determine whether n is equal to n end If yes, then execute step S15, otherwise, execute step S13;

[0033] S15: Determine whether the current temperature T is less than or equal to T end If yes, then execute step S17, otherwise, execute step S16 and then jump to step S13;

[0034] S16: Update parameters;

[0035] S17: Compare f(S K ) and f(j K ), select the solution corresponding to the smaller evaluation value as the best solution C under the K color graph model coloring K , update K=K+1, and determine whether K is greater than K max If yes, then execute step S18, otherwise, execute step S12;

[0036] S18: Compare the best solution C for coloring the model under different color numbers K (K=4,…,K max ), the solution corresponding to the minimum evaluation value is taken as the final solution for coloring the indefinite color graph model.

[0037] In step S11, the known parameters of the heterogeneous constellation include: the number of beams in the overlapping area between heterogeneous constellations, the total bandwidth of the constellation beams, the main heterogeneous constellation wave position coloring scheme, the spectrum demand of each wave position of the main constellation, and the spectrum demand of each wave position of the secondary constellation. The constructed wave position map model of the overlapping area between heterogeneous constellations has a double-layer structure, including the main constellation wave position map model in the overlapping area and the secondary constellation wave position map model in the overlapping area. Assuming that the total bandwidth of the constellation beam is 2GHz, when the four-color map model is colored, each color corresponds to 500MHz. Considering that the demand for each wave position of the main constellation and the demand for each wave position of the secondary constellation may be less than 500MHz, the maximum bandwidth of each beam division can be dynamically adjusted according to the actual situation. In this case, the maximum number of colors K that can be tried when coloring the graph model can be obtained by the following formula max , hereinafter referred to as formula (1):

[0038] ;

[0039] The above formula is for and The result of the division of is rounded down, where is the total bandwidth of the constellation beam, It is the maximum value of the spectrum requirements of each wavelength position of the primary constellation and the spectrum requirements of each wavelength position of the secondary constellation.

[0040] In the above steps, the formula of the evaluation function is: ,in, is the penalty factor for the violation of the four-color principle by the internal wave position of the sub-constellation satellite, which is set to 10000; The number of times the four-color principle is violated in a coloring scheme of a constellation wave diagram model; is the penalty factor for the same-wavelength-position-and-color interference between constellations, which is set to 100; is the number of times the same color interference exists in the same wave position between constellations; is the penalty factor for the presence of same-color interference in adjacent wave positions between constellations, set to 1; is the number of times the same-color interference exists in adjacent wave positions between constellations; The penalty factor for the failure of the secondary constellation to provide service is set to 0.0001; It is the sum of spectrum requirements corresponding to each closed service wave position in the secondary constellation.

[0041] In step S13, random perturbation generates a new K-color graph model coloring scheme j K Including: randomly changing the scheme i K If the changed scheme still meets the requirement of different colors of adjacent wave positions in the K color graph model, then the new scheme j is completed. KOtherwise, keep vertex A as the changed color, adjust the colors of other vertices until the K color graph model coloring adjacent wave position different color requirements are met, and the new solution j is completed. K Generation of.

[0042] In step S13, the first iteration step is: K =j K Update this plan K , through f(i K )=f(j K ) Update the evaluation value f(i K ), through S K =j K Update the optimal solution S K , the second iteration step is: let , with probability Follow the Metropolis criteria to determine if you pass the i K =j K Update this plan K , and determine whether f(i K )=f(j K ) Update the evaluation value f(i K ).

[0043] In step S13, the probability According to the Metropolis criteria, determine whether to include this plan in K Replace this solution K Includes: randomly generate a number in the interval [0,1), if the probability If it is greater than the random number, then scheme j is accepted. K , and update i K for j K 、f(i K ) is f(j K ), if not, then keep solution i K .

[0044] In step S16, the method for updating the parameters is: cooling the current temperature T by T=ɑT, where ɑ is the temperature decay rate, and Then, for the n end The method of rounding the value updates the current number of inner loop terminations n end , β is the increasing rate of the inner loop termination times, and the current inner loop times n is reset to 0.

[0045] In this embodiment, the maximum number of colors K that can be used for coloring the graph model is calculated based on the maximum value of the requirements of each wavelength of the primary constellation and the requirements of each wavelength of the secondary constellation. max , and then try to use K colors (K=4,…,Kmax ) to color the sub-constellation wave graph model and obtain the optimal coloring solution C K , at this time, the frequency band width allocated to each color of K color is Compare the evaluation values ​​of the optimal coloring schemes under different color numbers, and find the scheme with the smallest evaluation value as the final result. The final scheme is The indefinite color graph model coloring is better than the four-color graph model coloring alone, providing the possibility of finding solutions that meet the expected frequency requirements of more constellations.

[0046] The following examples illustrate the simulation effect of the present invention:

[0047] The known parameters of the heterogeneous constellation and the initialization parameters of the present invention are shown in Table 1, and simulations are performed for different maximum numbers of colors that can be used for coloring the graph model.

[0048]

[0049] Table 1

[0050] Scenario 1: The maximum number of colors that can be tried is 5

[0051]

[0052] Table 2

[0053] According to the simulation parameters in Table 2 and calculated according to formula (1), the maximum number of colors that can be tried for coloring is 5. When the number of colors is 5, the frequency band width corresponding to each color is 400 MHz.

[0054] Through simulation, for scenario 1, the results are as follows Figure 4 , the number of coloring colors used in the best coloring scheme of the secondary constellation model is 5, and the best scheme is [5 2 1 1 4 5 2 5 2 3 1 4 3 5 2 3 4 1 4], and the corresponding best evaluation value is 2.065. In order to avoid interference with the primary constellation, the secondary constellation cannot meet the spectrum requirements at wave positions 6 and 19. Excluding these wave positions that cannot provide services, the total spectrum that the secondary constellation can provide services is 4500MHz.

[0055] Scenario 2: The maximum number of colors that can be tried is 6

[0056]

[0057] Table 3

[0058] According to the simulation parameters in Table 3 and calculated according to formula (1), the maximum number of colors that can be tried for coloring is 6. When the number of colors is 6, the frequency band width corresponding to each color is 333.33 MHz.

[0059] Through simulation, for scenario 2, the results are as follows Figure 5 , the best solution for coloring the secondary constellation model uses 6 coloring colors, and the best solution is [4 1 6 1 5 2 4 4 3 6 5 3 6 1 4 6 4 5 2], and the corresponding best evaluation value is 2.04. In order to avoid interference with the primary constellation, the secondary constellation cannot meet the spectrum requirements at wave positions 5 and 11. Excluding these wave positions that cannot provide services, the total spectrum that the secondary constellation can provide services is 3933MHz.

[0060] Scenario 3: The maximum number of colors that can be tried is 7

[0061]

[0062] Table 4

[0063] According to the simulation parameters in Table 4 and calculated according to formula (1), the maximum number of colors that can be tried for coloring is 7. When the number of colors is 7, the frequency band width corresponding to each color is 285.71 MHz.

[0064] Through simulation, for scenario three, the results are as follows Figure 6 , the number of coloring colors used in the best solution for coloring the secondary constellation model is 7, and the best solution is [4 7 2 5 6 5 1 4 1 2 3 5 2 7 5 6 6 3 4], and the corresponding best evaluation value is 0. This solution will not cause interference to the primary constellation in the same frequency band and adjacent frequency band. The expected spectrum requirements of each frequency band of the secondary constellation can be met, and the total spectrum that the secondary constellation can provide services is 4160MHz.

[0065] Through the above simulation, we can draw the following conclusions:

[0066] For the optimization problem of beam resource allocation scheme based on graph model coloring, the more colors that can be used for coloring, the more likely it is to avoid the occurrence of neighborhood same-color interference, and even a scheme that completely avoids neighborhood same-color interference can be found.

[0067] When coloring the M color graph, if there is an integer N that satisfies At this time, N color diagram is used for coloring. Even if the primary and secondary constellations use the same beam coloring scheme in the overlapping coverage area, they can achieve sharing due to frequency division multiplexing.

[0068] The more coloring colors there are, the less time this optimization method takes. The more coloring colors there are, the greater the probability of randomly achieving different colors in the neighborhood when perturbing to generate new solutions, saving time for adjustments due to different colors in the neighborhood. Example

[0069] See also Figure 7 , Figure 7 FIG. 1 is a schematic diagram of a structure of an embodiment of a device for allocating beam resources between heterogeneous constellations according to the present invention. Figure 7 As shown, the device includes a module 11 for determining the maximum number of available coloring colors and initializing the K value, a module 12 for generating an initial coloring scheme for a K-color graph model and setting simulated annealing parameters, a module 13 for iterating a coloring scheme for a K-color graph model, a module 14 for judging the number of inner loops, a module 15 for judging the temperature, a module 16 for updating parameters, a module 17 for determining the best coloring scheme for a K-color graph model, and a module 18 for determining the final coloring scheme for a graph model.

[0070] The maximum available coloring color number determination and initialization K value module 11 is used to construct a wave position diagram model of the overlapping area between heterogeneous constellations according to the known parameters of the heterogeneous constellations, and calculate the maximum number of coloring colors that can be used for coloring the diagram model according to the spectrum requirements of each wave position of the primary constellation and the spectrum requirements of each wave position of the secondary constellation, which is set as K max , and set the initial value of the number of coloring colors K of the graph model to 4.

[0071] The K-color graph model initial coloring scheme generation and simulated annealing parameter setting module 12 is used to randomly generate a K-color graph model coloring scheme i according to the sub-constellation wave bit graph model of the overlapping area. K This scheme meets the requirements of different colors of adjacent wave positions within the sub-constellation, and calculates i through the evaluation function formula K The evaluation value f(i K ), set the optimal solution S K for i K , set the simulated annealing parameters: initial temperature T0, end temperature T end , the initial value of the number of inner loop terminations is n0, the current temperature T is set to T0, the current number of inner loop terminations n is 0, and the current number of inner loop terminations n is end is n0.

[0072] K color graph model coloring scheme iteration module 13, used for randomly perturbing and generating a new K color graph model coloring scheme j K , and calculate j through the evaluation function formula K The evaluation value f(j K ), compare f(i K ) and f(j K ) size, if f(j K ) is less than or equal to f(i K ), then the first iteration step is executed; otherwise, the second iteration step is executed, wherein the first iteration step is: K =j K Update this plan K , through f(i K )=f(j K ) Update the evaluation value f(iK ), through S K =j K Update the optimal solution S K , the second iteration step is: let , with probability Follow the Metropolis criteria to determine if you pass the i K =j K Update this plan K , and determine whether f(i K )=f(j K ) Update the evaluation value f(i K ).

[0073] The inner loop times determination module 14 is used to update the current inner loop times n=n+1 and determine whether n is equal to n end If yes, then jump to the temperature judgment module 15, otherwise, jump to the K color graph model coloring scheme iteration module 13.

[0074] The temperature determination module 15 is used to determine whether the current temperature T is less than or equal to T end If yes, then jump to the K-color graph model coloring optimal solution determination module 17; otherwise, jump to the parameter updating module 16 and then jump to the K-color graph model coloring solution iteration module 13.

[0075] The parameter updating module 16 is used to update the parameters. The method of updating the parameters is: cooling the current temperature T by T=ɑT, where ɑ is the temperature decay rate, and Then, for the n end The method of rounding the value updates the current number of inner loop terminations n end , β is the increasing rate of the inner loop termination times, and the current inner loop times n is reset to 0.

[0076] K color graph model coloring optimal solution determination module 17, used to compare f(S K ) and f(j K ), select the solution corresponding to the smaller evaluation value as the best solution C under the K color graph model coloring K , update K=K+1, and determine whether K is greater than K max If yes, then jump to the module 18 for determining the final coloring scheme of the graph model; otherwise, jump to the module 12 for generating the initial coloring scheme of the K-color graph model and setting the simulated annealing parameters.

[0077] The final scheme determination module 18 for graph model coloring is used to compare the best scheme C for graph model coloring under various color numbers. K (K=4,…,K max ), the solution corresponding to the minimum evaluation value is taken as the final solution for coloring the indefinite color graph model.

[0078] Specifically, the working methods of the above modules have been described in detail in the first embodiment and will not be repeated here. Example

[0079] The present invention further provides a computer-readable storage medium, which stores computer-executable instructions, and the computer-executable instructions are used to enable a computer to execute the method described in the first embodiment.

[0080] The above is a specific description of the preferred implementation of the present invention, but the invention is not limited to the embodiments. Those skilled in the art can make various equivalent modifications or substitutions without violating the spirit of the present invention. These equivalent modifications or substitutions are all included in the scope defined by the claims of this application.

Claims

1. A method for allocating beam resources between heterogeneous constellations, characterized in that: include: S11: construct a wave position diagram model of the overlapping area between heterogeneous constellations according to the known parameters of the heterogeneous constellations, and calculate the maximum number of coloring colors that can be used for coloring the diagram model according to the spectrum requirements of each wave position of the primary constellation and the spectrum requirements of each wave position of the secondary constellation, which is set as K max , and set the initial value of the coloring color number K of the graph model to 4; S12: According to the sub-constellation wave position map model of the overlapping area, a K-color map model coloring scheme i is randomly generated K The scheme meets the requirement of different colors of adjacent wave positions within the secondary constellation, and calculates i through the evaluation function formula K The evaluation value f(i K ), set the optimal solution S K for i K , set the simulated annealing parameters: initial temperature T0, end temperature T end , the initial value of the number of inner loop terminations is n0, the current temperature T is set to T0, the current number of inner loop terminations n is 0, and the current number of inner loop terminations n is end is n0; S13: Random perturbation generates new K-color graph model coloring scheme j K , and calculate j by the evaluation function formula K The evaluation value f(j K ), compare f(i K ) and f(j K ) size, if f(j K ) is less than or equal to f(i K ), then the first iteration step is executed; otherwise, the second iteration step is executed, wherein the first iteration step is: K =j K Update the solution K , through f(i K )=f(j K ) Update the evaluation value f(i K ), through S K =j K Update the optimal solution S K , the second iteration step is: let , with probability Follow the Metropolis criteria to determine if you pass the i K =j K Update the solution K , and determine whether f(i K )=f(j K ) Update the evaluation value f(i K ); S14: Update the current inner loop times n=n+1, and determine whether n is equal to n end If yes, then execute step S15, otherwise, execute step S13; S15: Determine whether the current temperature T is less than or equal to T end If yes, then execute step S17, otherwise, execute step S16 and then jump to step S13; S16: Update parameters. The method of updating parameters is: cool down the current temperature T by T=ɑT, where ɑ is the temperature decay rate. Then, for the n end The method of rounding the value updates the current number of inner loop terminations n end , β is the increase rate of the inner loop termination times, and the current inner loop times n is reset to 0; S17: Compare f(S K ) and f(j K ), select the solution corresponding to the smaller evaluation value as the best solution C under the K color graph model coloring K , update K=K+1, and determine whether K is greater than K max If yes, then execute step S18, otherwise, execute step S12; S18: Compare the best solution C for coloring the model under different color numbers K (K=4,…,K max ), the solution corresponding to the minimum evaluation value is taken as the final solution for coloring the indefinite color graph model.

2. The method according to claim 1, characterized in that The known parameters of the heterogeneous constellations in step S11 include: the number of beams in the overlapping area between heterogeneous constellations, the total bandwidth of the constellation beams, the coloring scheme of the main heterogeneous constellation, the spectrum requirement of each beam of the main constellation, and the spectrum requirement of each beam of the secondary constellation.

3. The method according to claim 1, characterized in that The wave pattern model of the overlapping area between heterogeneous constellations in step S11 is a double-layer structure, including a primary constellation wave pattern model in the overlapping area and a secondary constellation wave pattern model in the overlapping area.

4. The method according to claim 1, characterized in that: In step S11, the maximum number of colors that can be used for coloring the graph model is calculated as K according to the spectrum requirements of each wave position of the primary constellation and the spectrum requirements of each wave position of the secondary constellation. max include: The maximum number of colors K that can be tried when coloring the graph model can be obtained by the following formula max : ; The above formula is for and The result of the division of is rounded down, where is the total bandwidth of the constellation beam, is the maximum value of the spectrum requirements of each wavelength position of the primary constellation and the spectrum requirements of each wavelength position of the secondary constellation.

5. The method according to claim 1, characterized in that The evaluation function formula is as follows: ,in, is the penalty factor for the violation of the four-color principle by the internal wave position of the sub-constellation satellite, which is set to 10000; The number of times the four-color principle is violated in a coloring scheme of a constellation wave diagram model; is the penalty factor for the same-wavelength-position-and-color interference between constellations, which is set to 100; is the number of times the same color interference exists in the same wave position between constellations; is the penalty factor for the presence of same-color interference in adjacent wave positions between constellations, set to 1; is the number of times the same-color interference exists in adjacent wave positions between constellations; The penalty factor for the failure of the secondary constellation to provide service is set to 0.0001; It is the sum of spectrum requirements corresponding to each closed service wave position in the secondary constellation.

6. The method according to claim 1, characterized in that In step S13, the random perturbation generates a new K color graph model coloring scheme j K include: Randomly change the scheme i K If the changed scheme still meets the requirement of different colors of adjacent wave positions in the K color graph model, then the new scheme j is completed. K Otherwise, keep the color of vertex A after changing, adjust the colors of other vertices until the K color graph model coloring adjacent wave position different color requirements are met, and then the new solution j is completed. K Generation of.

7. The method according to claim 1, characterized in that In step S13, the probability According to the Metropolis criterion, whether to apply the scheme K Replace the solution i K include: Randomly generate a number in the interval [0,1) if the probability If it is greater than the random number, then scheme j is accepted. K , and update i K for j K 、f(i K ) is f(j K ), if not, then keep solution i K .

8. A device for allocating beam resources between heterogeneous constellations, characterized in that: include: The module for determining the maximum number of available coloring colors and initializing the K value is used to construct a wave pattern model of the overlapping area between heterogeneous constellations according to the known parameters of the heterogeneous constellations, and calculate the maximum number of coloring colors that can be used for coloring the graph model according to the spectrum requirements of each wave pattern of the primary constellation and the spectrum requirements of each wave pattern of the secondary constellation, which is set as K. max , and set the initial value of the coloring color number K of the graph model to 4; The K-color graph model initial coloring scheme generation and simulated annealing parameter setting module is used to randomly generate a K-color graph model coloring scheme i according to the sub-constellation wave bitmap model of the overlapping area. K The scheme meets the requirement of different colors of adjacent wave positions within the secondary constellation, and calculates i through the evaluation function formula K The evaluation value f(i K ), set the optimal solution S K for i K , set the simulated annealing parameters: initial temperature T0, end temperature T end , the initial value of the number of inner loop terminations is n0, the current temperature T is set to T0, the current number of inner loop terminations n is 0, and the current number of inner loop terminations n is end is n0; K-color graph model coloring scheme iteration module, used to randomly perturb and generate new K-color graph model coloring scheme j K , and calculate j by the evaluation function formula K The evaluation value f(j K ), compare f(i K ) and f(j K ) size, if f(j K ) is less than or equal to f(i K ), then the first iteration step is executed; otherwise, the second iteration step is executed, wherein the first iteration step is: K =j K Update the solution K , through f(i K )=f(j K ) Update the evaluation value f(i K ), through S K =j K Update the optimal solution S K , the second iteration step is: let , with probability Follow the Metropolis criteria to determine if you pass the i K =j K Update the solution K , and determine whether f(i K )=f(j K ) Update the evaluation value f(i K ); The inner loop count judgment module is used to update the current inner loop count n=n+1 and judge whether n is equal to n end , if yes, then jump to the temperature judgment module, otherwise, jump to the K color graph model coloring scheme iteration module; The temperature judgment module is used to judge whether the current temperature T is less than or equal to T end If yes, it will jump to the K-color graph model coloring optimal solution determination module. Otherwise, it will jump to the parameter update module and then jump to the K-color graph model coloring solution iteration module. The parameter updating module is used to update the parameters. The method of updating the parameters is: cooling the current temperature T by T=ɑT, where ɑ is the temperature attenuation rate, and Then, for the n end The method of rounding the value updates the current number of inner loop terminations n end , β is the increase rate of the inner loop termination times, and the current inner loop times n is reset to 0; K color graph model coloring optimal solution determination module, used to compare f(S K ) and f(j K ), select the solution corresponding to the smaller evaluation value as the best solution C under the K color graph model coloring K , update K=K+1, and determine whether K is greater than K max If yes, then jump to the module for determining the final coloring scheme of the graph model; otherwise, jump to the module for generating the initial coloring scheme of the K-color graph model and setting the simulated annealing parameters; The module for determining the final solution of graph model coloring is used to compare the best solution C for graph model coloring under different color numbers. K (K=4,…,K max ), the solution corresponding to the minimum evaluation value is taken as the final solution for coloring the indefinite color graph model.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to enable a computer to execute the method according to any one of claims 1 to 7.

Citation Information

Patent Citations

  • Wireless resource scheduling method and architecture system based on low-orbit constellation satellite communication

    CN112532298A

  • Communication method for low earth orbit satellite

    CN114244419A

  • Minimizing Fronthaul Data Load and Beam Management realization in Cellular Non terrestrial Networks Using Satellite Networks

    US20230188204A1