Large-scale observation station beam subset pre-allocation method based on three-dimensional hybrid mechanism

Abstract

The invention relates to the field of spaceflight measurement and control, and discloses a large observation station beam subset pre-allocation method based on a three-dimensional hybrid mechanism. Firstly, visible satellites are divided into a plurality of subsets, and priorities are allocated to the subsets according to service requirements; then, by formulating a redundancy-competition-hyper-multiplexing three-dimensional hybrid mechanism, measurement and control beam service capacity balance is realized; and finally, judging whether the sum of the pre-allocated beams is greater than the total beam, if so, carrying out conflict resolution, otherwise, carrying out beam allocation according to a calculation result. The method has the characteristics of high resource efficiency, dynamic adaptability and expansion balance, and is particularly suitable for dynamic allocation of beam resources in a large-scale constellation system.

Description

Technical Field

[0001] The present invention relates to the field of aerospace measurement and control technology, and is particularly suitable for dynamic allocation of beam resources in large-scale constellation systems to solve the problem of satellite service capacity balance. Background Art

[0002] With the deployment of large-scale constellations, satellites of various types are being deployed, including remote sensing, communications, and navigation. To provide tracking and control services for these large constellations, large-scale tracking and control stations based on digital multi-beams have emerged in recent years. The allocation of beam resources among various beam subsets has become a key issue in improving system service efficiency.

[0003] Traditional tracking and control stations primarily rely on single beams, and there's no method for allocating multiple beam subsets to address the rapidly increasing number of large-scale satellites. Even within existing resource allocation strategies, static allocations can't adapt to the dynamic growth of satellites, and there's no standardized mechanism for resolving resource conflicts, resulting in reduced beam utilization and insufficient assurance for critical missions. Summary of the Invention

[0004] In order to solve the problems in the background technology, a large-scale observation station beam subset pre-allocation method based on a three-dimensional hybrid mechanism is proposed. By formulating a three-dimensional hybrid mechanism based on redundancy, competition and super multiplexing, the measurement and control beam service capacity balance is achieved.

[0005] The technical solution adopted in the present invention is:

[0006] A method for pre-allocating large-scale station beam subsets based on a three-dimensional hybrid mechanism includes the following steps:

[0007] (1) Predict the number of satellites visible to the ground station within a set time period T according to satellite attributes, divide the visible satellites into multiple subsets, and assign priorities to each subset based on service requirements;

[0008] (2) According to the priority of each subset, the number of pre-allocated beams for each subset is calculated based on the three-dimensional hybrid mechanism;

[0009] (3) Determine whether the sum of the pre-allocated beams is greater than the total beam. If so, execute step (4). Otherwise, perform beam allocation according to the calculation result and then execute step (5).

[0010] (4) Perform conflict resolution and then return to step (2) for dynamic reallocation;

[0011] (5) When the number of satellites in orbit increases by the set ratio, return to step (1).

[0012] Furthermore, in step (1), the number of beam subsets N=3 is set according to the satellite attributes, and each subset is represented as {V k}、{Uk} and {W k},{V k} is a high priority subset, {U k} is a common-level subset, {W k} is a short-term burst level subset.

[0013] Furthermore, the three-dimensional hybrid mechanism in step (2) is a three-dimensional hybrid mechanism based on redundancy-contention-super multiplexing, and the number of pre-allocated beams for each subset is calculated as follows:

[0014] The first subset is of high priority and adopts a redundancy mechanism, namely a resource backup mechanism. The number of pre-allocated beams P1 is:

[0015]

[0016] The second subset is the common level, which adopts the contention mechanism. The number of pre-allocated beams P2 is:

[0017]

[0018] The third subset is short-term burst-level and adopts a hyper-multiplexing mechanism, that is, a resource release mechanism where resources are used and released immediately. The number of pre-allocated beams P3 is:

[0019]

[0020] Where γ1, γ2 and γ3 are beam service capability coefficients, α1 and α2 are redundancy coefficients, α1≥0, α2≥0, γ3>>1, Indicates rounding up.

[0021] Furthermore, the specific process of conflict resolution in step (4) is as follows:

[0022] Reduce redundant beams in descending order of priority until the P is the total number of beams;

[0023] The first type of subset reduction reduces the redundancy coefficient until α1 = 0;

[0024] The second type of subset-level reduction reduces the redundancy coefficient until α2 = 0;

[0025] The third type of subset-level reduction increases the beam service capability coefficient γ3 to the maximum value.

[0026] Furthermore, after beam allocation in step (3), for the subset of the contention mechanism, the unserved satellites are marked as waiting for service queues. When the next round passes by, they are allocated according to the priority weight. The service priority weight expression is:

[0027] Service priority weight = satellite mission level × (1 + waiting rounds).

[0028] Compared with the background technology, the present invention has the following advantages:

[0029] (i) Resource efficiency: This invention improves the security of key services and reduces resource idleness through dual-beam redundancy for high-priority services and accumulation of competitive priorities for low-priority services;

[0030] (ii) Dynamic adaptability: The present invention adapts to fluctuations in the number of simultaneously visible satellites in a short period of time by optimizing beam service capabilities and redundancy factors;

[0031] (iii) Extended Balance: The present invention adapts to the growth of satellite numbers and changes in visibility over a long period of time by periodically adjusting the allocation. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 It is the overall flow chart of the present invention.

[0033] Figure 2 Detailed flow chart of the present invention. DETAILED DESCRIPTION

[0034] The present invention will be further described below in conjunction with specific implementation steps:

[0035] (1) Orbital prediction analysis: predict the number of satellites visible to the ground station within a set time period T according to satellite attributes, divide the visible satellites into multiple subsets, and assign priorities to each subset based on service requirements;

[0036] According to the satellite attributes, the number of beam subsets N=3 is set, and each subset is represented as {V k}、{U k} and {W k},{V k} is a high priority subset, {U k} is a common-level subset, {W k} is a short-term burst level subset.

[0037] (2) According to the priority of each subset, the number of pre-allocated beams for each subset is calculated based on the three-dimensional hybrid mechanism;

[0038] The three-dimensional hybrid mechanism is based on redundancy, contention, and super-multiplexing. The number of pre-allocated beams for each subset is calculated as follows:

[0039] The first subset is of high priority and adopts a redundancy mechanism, namely a resource backup mechanism. The number of pre-allocated beams P1 is:

[0040]

[0041] Where, the beam service capability coefficient γ1 = 0.5, and the redundancy coefficient α1 ≥ 0;

[0042] The second subset is the common level, which adopts the contention mechanism. The number of pre-allocated beams P2 is:

[0043]

[0044] Where, the beam service capability coefficient γ2 = 1, and the redundancy coefficient α2 ≥ 0;

[0045] The third subset is short-term burst-level and adopts a hyper-multiplexing mechanism, i.e., a resource release-on-use mechanism. The number of pre-allocated beams P3 is:

[0046]

[0047] Where, the beam service capability coefficient γ3>>1.

[0048] (3) Determine whether the sum of the pre-assigned beams is greater than the total beam, i.e. P is the total number of beams. If yes, execute step (4). Otherwise, perform beam allocation according to the calculation result and then execute step (5).

[0049] After beam allocation, for the subset of the contention mechanism, the unserved satellites are marked as waiting for service queues. When they pass through in the next round, they are allocated according to the priority weight. The service priority weight expression is:

[0050] Service priority weight = satellite mission level × (1 + waiting rounds).

[0051] Competition mechanism triggering scenario:

[0052]

[0053] (4) Perform conflict resolution and then return to step (2) for dynamic reallocation;

[0054] The specific process of conflict resolution is as follows:

[0055] Reduce redundant beams in descending order of priority until the

[0056] The first type of subset reduction reduces the redundancy coefficient until α1 = 0;

[0057] The second type of subset-level reduction reduces the redundancy coefficient until α2=0.

[0058] The third type of subset-level reduction increases the beam service capability coefficient γ3 to the maximum value.

[0059] Example:

[0060] Parameter settings:

[0061] ●Total number of beams P = 100, time period T = 24 hours;

[0062] ● Preset arithmetic value of the number of visible satellites in each subset: max{V}=32, min{U}=22,

[0063] avg{W}=48;

[0064] ●Capacity coefficient: γ1=0.5, γ1=1, γ1=6;

[0065] ●Redundancy coefficient: α1=6, α2=2.

[0066] Pre-allocated calculations:

[0067] ●

[0068] ●

[0069] ●

[0070] ●Total: P=70+26+8=104>100 (triggering periodic adjustment).

[0071] Periodic adjustments:

[0072] ●The first type of subset reduces redundancy: α1=6→2,

[0073] ●The second type of subset reduces redundancy: α2=4→2,

[0074] ● Improvement of capacity coefficient: γ3=6→8,

[0075] ●Final distribution: P=66+24+6=96<100.

[0076] (5) When the number of satellites in orbit increases by the set ratio, return to step (1).

[0077] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not limiting. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention can be modified or replaced by equivalents without departing from the purpose and scope of the technical solutions, which should all be included in the scope of the claims of the present invention.

Claims

1. A method for pre-allocating large-scale station beam subsets based on a three-dimensional hybrid mechanism, characterized in that: The following steps are involved: (1) Predict the number of satellites visible to the ground station within a set time period T according to satellite attributes, divide the visible satellites into multiple subsets, and assign priorities to each subset based on service requirements; (2) According to the priority of each subset, the number of pre-allocated beams for each subset is calculated based on the three-dimensional hybrid mechanism; (3) Determine whether the sum of the pre-allocated beams is greater than the total beam. If so, execute step (4). Otherwise, perform beam allocation according to the calculation result and then execute step (5). (4) Perform conflict resolution and then return to step (2) for dynamic reallocation; (5) When the number of satellites in orbit increases by the set ratio, return to step (1).

2. A method for pre-allocating large-scale station beam subsets based on a three-dimensional hybrid mechanism according to claim 1, characterized in that: In step (1), the number of beam subsets N=3 is set according to the satellite attributes, and each subset is represented as {V k }、{U k } and {W k }, {V k } is a high priority subset, {U k } is a common-level subset, {W k } is a short-term burst level subset.

3. The method for pre-allocating large-scale station beam subsets based on a three-dimensional hybrid mechanism according to claim 2, characterized in that: The three-dimensional hybrid mechanism in step (2) is a three-dimensional hybrid mechanism based on redundancy, contention, and super-multiplexing. The number of pre-allocated beams for each subset is calculated as follows: The first subset is of high priority and adopts a redundancy mechanism, namely a resource backup mechanism. The number of pre-allocated beams P1 is: P1=[max{V k } / γ1]+α1; The second subset is the common level, which adopts the contention mechanism. The number of pre-allocated beams P2 is: P2=[min{U k } / γ2]+α2; The third subset is short-term burst-level and adopts a hyper-multiplexing mechanism, that is, a resource release mechanism where resources are used and released immediately. The number of pre-allocated beams P3 is: Where γ1, γ2 and γ3 are beam service capability coefficients, α1 and α2 are redundancy coefficients, α1≥0, α2≥0, γ3>>1, Indicates rounding up.

4. The method for pre-allocating large-scale station beam subsets based on a three-dimensional hybrid mechanism according to claim 3, characterized in that: The specific process of conflict resolution in step (4) is as follows: Reduce redundant beams in descending order of priority until the P is the total number of beams; The first type of subset reduction reduces the redundancy coefficient until α1 = 0; The second type of subset-level reduction reduces the redundancy coefficient until α2 = 0; The third type of subset-level reduction increases the beam service capability coefficient γ3 to the maximum value.

5. The method for pre-allocating large-scale station beam subsets based on a three-dimensional hybrid mechanism according to claim 3, characterized in that: After beam allocation in step (3), for the subset of the contention mechanism, the unserved satellites are marked as waiting for service queues. When the next round passes by, they are allocated according to the priority weight. The service priority weight expression is: Service priority weight = satellite mission level × (1 + waiting rounds).

Images