A method for high-throughput satellite beam-hopping scheduling

Abstract

The present invention discloses a method for high-throughput satellite beam-hopping scheduling, which relates to the technical field of low-orbit satellite communications. The method comprises counting the number of beams, the number of wave positions with terminals and a weight reference. When the weight reference comprises only the number of terminals, the beam corresponding to the wave position, the beam scanning period and the duration are determined only according to the number of terminals, and the beam can be quickly allocated. When the weight reference comprises the number of terminals and the terminal traffic, the beam corresponding to the wave position, the beam scanning period and the duration are determined according to the number of terminals and the terminal traffic. When there is traffic, the beam resource allocation accuracy is very high. During the beam scanning time, the base station uses the 5GNR system scheduling algorithm to schedule uplink and downlink data for each terminal. The method of the present invention can flexibly schedule beams to each wave position with a terminal, and can perfectly adapt to the sudden demands of the service, the delay requirements and the continuous online requirements of the terminal.

Description

Technical Field

[0001] The present invention relates to the field of low-orbit satellite communication technology, and in particular to a method for low-orbit high-throughput satellite beam hopping combined with 5G (5th Generation) NR (New Radio) wireless resource scheduling. Background Art

[0002] Low earth orbit (LEO) satellites are constantly moving relative to the ground, and the areas they cover, users (terminals) and services are also constantly changing. The use of fixed resource allocation methods cannot adapt to such movements and changes in low earth orbit satellite communication systems. Beam hopping technology, as a flexible resource allocation technology, is applied to LEO satellite scheduling algorithms. Compared with terrestrial wireless communication systems such as LTE (Long Term Evolution) and NR, the current satellite beam hopping technology has improved the efficiency of satellite resources in terms of bandwidth and power, but the beam hopping mode is fixed, such as scanning all beam positions at a certain period, and the fixed scheduling format (fixed modulation order, time-frequency domain resources) within the beam position scanning time, etc., which cannot perfectly adapt to the sudden demand of services, delay requirements and continuous online requirements of terminals. Summary of the invention

[0003] The present invention provides a method for high-throughput satellite beam-hopping scheduling, which can solve the above-mentioned problem.

[0004] In order to alleviate the above-mentioned problems, the technical solution adopted by the present invention is as follows:

[0005] The present invention provides a method for high-throughput satellite beam-hopping scheduling, which is a scanning scheduling scheme within a scanning cycle, comprising the following steps:

[0006] S1. Counting the number of beams, the number of wave positions with terminals, and a weight reference, where the weight reference includes only the number of terminals in each wave position, or includes the number of terminals in each wave position and the terminal traffic, where the terminal traffic may be the downlink traffic or the uplink traffic, or the sum of the uplink and downlink traffic;

[0007] S2. When the number of wave positions with terminals is not equal to 1, continue to execute step S3. When the number of wave positions with terminals is equal to 1, all beams continue to cover the wave positions with terminals, and then execute step S8.

[0008] S3. When the number of wave positions with terminals is not greater than the number of beams, and the weight reference amount only includes the number of terminals at each wave position, jump to step S4; when the number of wave positions with terminals is not greater than the number of beams, and the weight reference amount includes the number of terminals at each wave position and the terminal traffic volume, jump to step S5; when the number of wave positions with terminals is greater than the number of beams, and the weight reference amount only includes the number of terminals at each wave position, jump to step S6; when the number of wave positions with terminals is greater than the number of beams, and the weight reference amount includes the number of terminals at each wave position and the terminal traffic volume, jump to step S7;

[0009] S4, allocating beams to the wave positions with terminals according to the number of wave positions with terminals, each wave position with terminals is covered by at least one beam, and each beam scans the corresponding wave position according to a scanning cycle, that is, continuously scans within a scanning cycle, and then executing step S8;

[0010] S5, allocating beams to the beams with terminals according to the number of beams with terminals and the traffic of the terminals, each beam with terminals is covered by at least one beam, and each beam scans the corresponding beam according to a scanning cycle, that is, continuously scans within one scanning cycle, and then executing step S8;

[0011] S6. Allocate beams to the wave positions with terminals according to the number of wave positions with terminals. There may be a situation where one beam scans multiple wave positions, and allocate the scanning time of the beam to each corresponding wave position according to the number of terminals at the wave position. The more terminals there are at the wave position, the longer the beam scanning time is. Then, execute step S8.

[0012] S7, allocating beams to the beams with terminals according to the number of beams with terminals, there is a situation where one beam scans multiple beams, and allocating the scanning time of the beam to each corresponding beam according to the number of terminals and the terminal traffic volume of the beams, the more terminals there are in the beams, the longer the beam scanning time is for them, and the greater the terminal traffic volume is, the longer the beam scanning time is for them, and then executing step S8;

[0013] S8. During the beam scanning time, the base station uses the 5GNR system scheduling algorithm to schedule uplink and downlink data for each terminal.

[0014] The technical effect of this technical solution is: it can flexibly schedule the satellite's space resources, allocate beams to each wave position with a terminal, and can perfectly adapt to the sudden needs of the business, latency requirements and the continuous online needs of the terminal; among them, when the weight reference only includes the number of terminals, the beam corresponding to the wave position, the beam scanning period and duration are determined only according to the number of terminals, and the calculation process is simple. When the weight reference includes the number of terminals and the terminal business volume, the beam corresponding to the wave position, the beam scanning period and duration are determined according to the number of terminals and the terminal business volume. When there is business volume, the beam resource allocation accuracy is very high.

[0015] In a preferred embodiment of the present invention, in step S4, the beam allocation method is specifically as follows: the first n-1 beam positions with terminals are evenly allocated beams, the nth beam with terminal is allocated beams, where m represents the number of beams and n represents the number of wave positions with terminals.

[0016] The technical effect of this technical solution is: allocating the beam scanning positions according to the number of users, avoiding blind beam scanning and wasting transmission power resources.

[0017] In a preferred embodiment of the present invention, in step S5, the beam allocation method specifically includes:

[0018] a. Calculate beam allocation weights:

[0019]

[0020]

[0021] or

[0022] Among them, B i represents the number of terminals at the ith wave position with a terminal, W i Ptotal represents the terminal traffic volume of the ith wave position with a terminal, i Assign weights to the beams, The sum of the number of terminals in the wave positions with terminals, Indicates the total terminal traffic of the wave positions with terminals,

[0023] when When calculating Ptotal, the terminal business volume value should be converted into a value proportional to the terminal value before calculating Ptotal. i ;

[0024] b. Allocate beams. The first n-1 beams with terminals are allocated. beams, the nth beam with terminal is allocated beams.

[0025] The technical effect of this technical solution is: compared with the weight allocation of beams based only on the number of users, the weight allocation based on the number of users and the traffic volume, or the number of users + the traffic volume can better reflect the authenticity of data transmission, avoid excessive scanning of the wave positions with a large number of users but a small traffic volume, and ensure that the wave positions with a small number of users but a large traffic volume can be fully scanned, thereby ensuring the effectiveness of beam scanning scheduling. Converting the terminal traffic volume value into a value of the same order of magnitude as the terminal value can avoid an imbalance in the proportion of the number of terminals or the terminal traffic volume in the final weight calculation.

[0026] In a preferred embodiment of the present invention, in steps S6 and S7, the beam allocation method includes: once a wave position with a terminal has been allocated a corresponding beam, no other beams will be allocated to the wave position; each beam is allocated to at least one wave position with a terminal.

[0027] The technical effect of this technical solution is that it can reduce the complexity of beam scanning.

[0028] In a preferred embodiment of the present invention, in step S6, the method for allocating the beam scanning time includes:

[0029] Calculate the beam scanning time allocation weight P t1 ,

[0030]

[0031] in, represents the sum of the number of terminals of all K wave positions scanned by the beam, B t Indicates the number of terminals corresponding to a certain wave position scanned by the beam;

[0032] Under the premise of ensuring that each wave position with a terminal is scanned for at least 1 ms, the scanning time of the beam for the first K-1 wave positions with terminals is The scanning time of the beam to the last wave position with a terminal is Where Tp is the scanning period.

[0033] The technical effect of this technical solution is: scanning the wave position according to the number of users, compared with scanning the wave position by beam traversal, avoiding the waste of transmission power resources by blind beam scanning.

[0034] In a preferred embodiment of the present invention, in step S7, the method for allocating the beam scanning time includes:

[0035] Calculate the beam scanning time allocation weight P t2 ,

[0036] P t2 =P t1 *P t2 ,

[0037]

[0038] in, represents the sum of terminal traffic of all wave positions scanned by the beam, W t Indicates the terminal traffic volume of a certain wave position scanned by the beam;

[0039] Under the premise of ensuring that each wave position with a terminal is scanned for at least 1ms (the purpose of scanning for at least 1ms is to prevent the terminal from being disconnected due to long-term lack of downlink signal), the scanning time of the beam for the first K-1 wave positions with terminals is The scanning time of the beam to the last wave position with a terminal is

[0040] The technical effect of this technical solution is that compared with the weight allocation of beams based only on the number of users, the weight allocation based on the number of users and the traffic volume can better reflect the authenticity of data transmission, avoid excessive scanning of beams with a large number of users but small traffic volume, and ensure that beams with a small number of users but large traffic volume can be fully scanned, thus ensuring the effectiveness of beam scanning scheduling.

[0041] In a preferred embodiment of the present invention, in step S7, the method for allocating the beam scanning time includes:

[0042] Calculate the beam scanning time allocation weight P t2 ,

[0043]

[0044] Among them, B t represents the number of terminals at the tth wave position with a terminal, W t represents the terminal traffic of the tth wave position with a terminal, B t1 represents the number of terminals at the t1th wave position with a terminal, W t1 represents the terminal traffic volume of the t1th wave position with a terminal, It indicates the sum of the number of terminals and the terminal traffic calculated for all the wave positions with terminals that need to be scanned under a certain beam;

[0045] Under the premise of ensuring that each wave position with a terminal is scanned for at least 1 ms, the scanning time of the beam for the first K-1 wave positions with terminals is The scanning time of the beam to the last wave position with a terminal is

[0046] The technical effect of this technical solution is: the use of additive weights can avoid the problem that under multiplicative weights, when there is no service at any terminal in the wave position (the wave position weight is 0), the beam no longer scans the wave position.

[0047] In a preferred embodiment of the present invention, in step S8, the 5GNR system scheduling algorithm is the EPF algorithm, or the RR polling, or the Max S / I maximum signal to interference and noise ratio algorithm.

[0048] The technical effect of this technical solution is: during the beam scanning time, the 5GNR scheduling algorithm can be used to flexibly schedule multiple terminals in the beam position according to the terminal business volume, thereby improving scheduling efficiency and reducing beam scanning time.

[0049] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the embodiments of the present invention are specifically cited below and described in detail with reference to the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments are briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without creative work.

[0051] Figure 1 is a schematic diagram of a beam coverage area of ​​a single satellite in an embodiment;

[0052] Figure 2 is a flow chart of the method for high-throughput satellite beam-hopping scheduling described in Example 1;

[0053] Figure 3 It is a flow chart of the method for high-throughput satellite beam-hopping scheduling described in Examples 2 and 3. DETAILED DESCRIPTION

[0054] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Generally, the components of the embodiments of the present invention described and shown in the drawings here can be arranged and designed in various different configurations.

[0055] Therefore, the following detailed description of the embodiments of the present invention provided in the accompanying drawings is not intended to limit the scope of the invention claimed for protection, but merely represents selected embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0056] Satellites can generate multiple beams, and the coverage of a beam on the ground is called a beam position. A beam can only cover one beam position at a time, and each beam position is scanned and covered in turn by beam hopping. A single satellite can cover more than 200 beam positions. Figure 1The example shown is a single beam scanning 7 wave positions in turn. Assume that a single satellite has m beams with different frequencies and non-overlapping frequencies that can be used simultaneously, and the beam jumps between different wave positions. Once a wave position is selected and scanned by a designated beam, the beam must scan back to scan the wave position within a certain period to prevent the terminal from being disconnected due to long-term unscheduled operation. Assume that the period is Tp. The following embodiment is an example of beam scanning within a scanning period Tp. Generally, the number of wave positions n with a terminal is not equal to 1, so the following embodiment is for the case where the number of wave positions n with a terminal is not equal to 1.

[0057] Example 1

[0058] In this embodiment, the weight reference only includes the number of terminals at each wave position. Figure 1 and 2 , assuming m = 8, Tp = 40ms, the beam scanning time is shown in the following table:

[0059]

[0060] In the first 40ms period, only 3 wave positions are accessed by terminals, so the first two wave positions are covered by two beams each, and the third wave position is covered by 4 beams; n = 3, m = 8, the first n-1 wave positions are allocated beam, that is nth wave allocation beams, that is, 8-(3-1)*2=4.

[0061] In the second 40ms cycle, the number of wave bits n becomes 4, so the first n-1=3 wave bits are allocated beams, the last beam position is allocated 8-(n-1)*2=2, that is, each beam position is covered by 2 beams;

[0062] In the third 40ms cycle, the number of wave positions n = 12, which is greater than the number of beams m = 8, and there is only one terminal under each wave position, so the beams are allocated in sequence, and the scanning time of the wave position is allocated according to the proportion of the number of terminals under the beam position;

[0063] First, the wave positions range from 0 to 11. Among the 8 correspondingly allocated beams, beam #1 corresponds to wave positions #0 and #8, beam #2 corresponds to wave positions #1 and #9, beam #3 corresponds to wave positions #2 and #10, beam #4 corresponds to wave positions #3 and #11, beam #5 corresponds to wave position #4, beam #6 corresponds to wave position #5, beam #7 corresponds to wave position #6, and beam #8 corresponds to wave position #7;

[0064] The scanning time ratio of each beam at each wave position is calculated using the following formula:

[0065]

[0066] For example, beam #1 scans wave positions #0 and #8, K=2, the scanning time ratio at wave position #0 is P1=1 / 2=50%, and the scanning time ratio at wave position #8 is P2=50%, then the scanning time for each wave position is 40*50%=20ms.

[0067] In the fourth 40ms cycle, if some beam positions have no terminals and do not need to be scanned, the original beam will not scan these beam positions, and the scanning time will be allocated to the remaining beam positions belonging to the beam. If the number of terminals in some beam positions changes, the scanning time of the beam positions in the same beam will be allocated in proportion to the number of terminals.

[0068] For example, the number of terminals at wave position #0 changes from 1 to 4, and the number of terminals at wave position #8 remains unchanged, then the scanning weight P1 of wave position #0 is 4 / (4+1)=80%, and the scanning time is 40*80%=32ms.

[0069] When the number of terminals in beam position #10 changes from 1 to 0, the scanning time ratio becomes 0%, and beam #3 no longer scans this beam position;

[0070] Once the above beam allocation scheme determines that the beam scans a certain wave position, the beam scanning the wave position will no longer change.

[0071] Example 2

[0072] Please refer to Figure 1 and 2 , assuming m = 8, Tp = 40ms:

[0073] Different from Embodiment 1, in this embodiment, the weight reference includes the number of terminals and the terminal traffic volume of each beam position, and the beam scanning time is shown in the following table:

[0074]

[0075] The above-mentioned terminal traffic volume is the amount of service data to be scheduled for all terminals at this wave position (downlink or uplink or downlink + uplink). The comprehensive priority takes into account the weight of the number of terminals at the wave position and also the weight of the terminal traffic volume. The comprehensive priority sorting replaces the sorting based only on the number of terminals to allocate the scanning time of the beam at this wave position.

[0076] In the first 40ms period, only three wavelengths are accessed by one terminal each, and the traffic ratio is 2:2:1. The overall ratio is 4:4:2, and the first two wavelengths are covered by three beams each, and the third wavelength is covered by two beams.

[0077] The proportion of the number of terminals is calculated according to the following formula, and the proportion of the number of terminals in each wave position is 33%:

[0078]

[0079] The terminal business volume ratio is calculated according to the following formula:

[0080]

[0081] The terminal business volumes are 2, 2, and 1 respectively, so the terminal business volume ratios are 40%, 40%, and 10%.

[0082] The comprehensive ratio is as follows:

[0083]

[0084] The comprehensive proportions of the three wave positions are

[0085] When i=1, Ptotal1=33%*40% / (33%*40%+33%*40%+33%*20%)=40%;

[0086] When i=2, Ptotal2=33%*40% / (33%*40%+33%*40%+33%*20%)=40%;

[0087] When i=3, Ptotal3=33%*20% / (33%*40%+33%*40%+33%*20%)=20%;

[0088] The first n-1=2 wave positions with terminals are evenly distributed beams, the third one has a terminal. beams.

[0089] In the second 40ms period, the number of wave bits becomes 4, and the number of beams is allocated according to the number of terminals and the proportion of traffic;

[0090] Similar calculations for the comprehensive ratios are Ptotal1 = 54.5%, Ptotal2 = 18.2%, Ptotal3 = 18.2%, Ptotal4 = 9.1%,

[0091] The first wave position is allocated Beams, second and third beam positions are allocated beams, and the fourth wave position is allocated 8-4-1=3 beams.

[0092] In the third 40ms cycle, if the number of wave positions is greater than the number of beams, the beams are allocated in sequence and the scanning time is proportional to the number of wave position terminals and the traffic volume under the beam.

[0093] Calculated as follows:

[0094]

[0095] P t2 =Pt1 *P t2 ,

[0096]

[0097] For example:

[0098] Beam #3 covers wave positions #2 and #10. Wave position #2 has one terminal, Pt1 = 50%, the terminal traffic is 2, PWt2 = 66.7%, wave position #10 has one terminal, Pt1 = 50%, the terminal traffic is 1, PWt2 = 33.3%. Then the comprehensive weight of wave position #2 Pt2 = 50% * 66.7% / (50% * 66.7% + 50% * 33.3%) = 67%, and the scanning period is The scanning period of wave position #10 is 40-26=13ms.

[0099] In the fourth 40ms cycle, if some beam positions have no terminals and do not need to be scanned, the original beam will not scan the beam position, and the scanning time will be allocated to the remaining beam positions belonging to the beam; if the number of terminals in some beam positions changes, the scanning time of the beam positions in the same beam will be allocated in proportion to the number of terminals and the traffic volume. For example: if there is no traffic volume in the terminal in beam position #10, beam #3 will no longer scan the beam position.

[0100] Example 3

[0101] Please refer to Figure 1 and 2 , assuming m = 8, Tp = 40ms:

[0102] Different from Example 2, in this embodiment, when calculating the total weight of the number of terminals and the terminal traffic, the terminal number weight + the terminal traffic weight is used as the priority, and the beam scanning time is shown in the following table:

[0103]

[0104] When the number of wave bits is not greater than the number of beams, the scanning beam weight is calculated according to the following formula.

[0105]

[0106] In the first 40ms period, only three wavelengths are accessed by one terminal each, and the traffic ratio is 2:2:1. The overall ratio is 3:3:2, and the first two wavelengths are covered by three beams each, and the third wavelength is covered by two beams.

[0107] Wavelength #0 has one terminal with a service volume of 2, accounting for (1+2) / (1+1+1+2+2+1)=37.5%, occupying beams;

[0108] In the second 40ms period, the number of wave bits becomes 4, and the number of beams is allocated according to the number of terminals and the proportion of traffic;

[0109] When the number of wave bits is greater than the number of beams, the beam scanning weight is calculated according to the following formula.

[0110]

[0111] In the third 40ms cycle, if the number of wave positions is greater than the number of beams, the beams are allocated in turn in sequence, and the scanning time of the wave positions is proportional to the weight of the sum of the number of wave position terminals and the traffic volume under the beam;

[0112] Wavelength #2 (one terminal, the terminal traffic volume is 1) and wavelength #10 (one terminal, the terminal traffic volume is 2) are scanned by beam #3. The scanning weight of wavelength #10 = (1+1) / (1+1+1+2) = 40%, so the scanning time of beam #3 at wavelength #10 is 40*40% = 16ms.

[0113] In the fourth 40ms cycle, some beam positions have no services but there are still online terminals (such as beam position #10). Then the beam position scanning time in the same beam is allocated in proportion to the weight of the number of terminals + the amount of services.

[0114] At this time, the terminal at wave position #10 has no traffic, and the scanning weight is 1 / (1+1+1)=33.3%. The scanning weight of wave position #2 is 66.7%. The time for beam #3 to scan wave position #10 is

[0115] The comprehensive priority of Example 2 is actually the relationship between the terminal number weight and the traffic volume weight. However, since the base station cannot grasp the uplink traffic volume in time, when there is no downlink service and the terminal has not sent an SR or BSR, even if there are a large number of terminals in a certain wave position, the beam may not scan the wave position according to the priority of the terminal number and traffic volume, resulting in increased service delay or even terminal disconnection; for example, in Example 2, when the terminal traffic volume of wave position #10 is 0, the beam will no longer continue to scan the wave position. Example 3 solves this problem. Even if the terminal traffic volume is 0, the beam will still scan the wave position if there are terminals.

[0116] In addition to the above embodiments, the uplink and downlink data scheduling for each terminal within the beam scanning time is described below.

[0117] During the scanning time, the scheduling in the beam scanning cycle is the same as the NR scheduling algorithm. The EPF algorithm is used first, which can also be simplified to RR polling or Max S / I maximum signal to interference and noise ratio algorithm. The downlink scheduling priority of each terminal in each slot is as follows:

[0118]

[0119] eff: indicates the channel quality of the current terminal;

[0120] r: the historical transmission rate of the terminal;

[0121] γ(QCI): terminal QCI level;

[0122] f(D): the waiting time of the downlink data of the terminal in the buffer;

[0123] The priority calculation can be simplified to RR polling, and the queue scheduling is based only on the waiting time of each terminal data in the cache, as follows:

[0124] priority=f(D)

[0125] Or Max S / I maximum signal to interference and noise ratio:

[0126] priority=eff

[0127] The uplink scheduling priorities are as follows:

[0128]

[0129] The difference from the downlink is the length of time that the base station has no terminal uplink data in the cache. Similarly, it can also be converted into the RR or MaxS / I algorithm.

[0130] Combined with the NR scheduling algorithm, it ensures that even if the wave position is only scanned for 1ms, multiple terminals can be dynamically scheduled to meet the sudden demand of the service, latency requirements and the continuous online requirements of the terminals.

[0131] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for high-throughput satellite beam-hopping scheduling, characterized in that: The following steps are involved: S1. Count the number of beams, the number of wave positions with terminals, and a weight reference, where the weight reference only includes the number of terminals in each wave position, or includes the number of terminals in each wave position and the terminal traffic; S2. When the number of wave positions with terminals is not equal to 1, continue to execute step S3. When the number of wave positions with terminals is equal to 1, all beams continue to cover the wave positions with terminals, and then execute step S8. S3. When the number of wave positions with terminals is not greater than the number of beams, and the weight reference amount only includes the number of terminals at each wave position, jump to step S4; when the number of wave positions with terminals is not greater than the number of beams, and the weight reference amount includes the number of terminals at each wave position and the terminal traffic volume, jump to step S5; when the number of wave positions with terminals is greater than the number of beams, and the weight reference amount only includes the number of terminals at each wave position, jump to step S6; when the number of wave positions with terminals is greater than the number of beams, and the weight reference amount includes the number of terminals at each wave position and the terminal traffic volume, jump to step S7; S4, allocating beams to the wave positions with terminals according to the number of wave positions with terminals, each wave position with terminals is covered by at least one beam, and each beam scans the corresponding wave position according to the scanning period, and then executing step S8; S5. Allocate beams to the beams with terminals according to the number of beams with terminals and the traffic volume of the terminals. Each beam with a terminal is covered by at least one beam, and each beam scans the corresponding beam according to a scanning period. Then, execute step S8. S6. Allocate beams to the wave positions with terminals according to the number of wave positions with terminals. There may be a situation where one beam scans multiple wave positions, and allocate the scanning time of the beam to each corresponding wave position according to the number of terminals at the wave position. The more terminals there are at the wave position, the longer the beam scanning time is. Then, execute step S8. S7, allocating beams to the beams with terminals according to the number of beams with terminals, there is a situation where one beam scans multiple beams, and allocating the scanning time of the beam to each corresponding beam according to the number of terminals and the terminal traffic volume of the beams, the more terminals there are in the beams, the longer the beam scanning time is for them, and the greater the terminal traffic volume is, the longer the beam scanning time is for them, and then executing step S8; S8. During the beam scanning time, the base station uses the 5GNR system scheduling algorithm to schedule uplink and downlink data for each terminal.

2. The method for high-throughput satellite beam-hopping scheduling according to claim 1, characterized in that: In step S4, the beam allocation method is specifically as follows: the first n-1 beam positions with terminals are evenly allocated beams, the nth beam with terminal is allocated beams, where m represents the number of beams and n represents the number of wave positions with terminals.

3. The method for high-throughput satellite beam-hopping scheduling according to claim 2, characterized in that: In step S5, the beam allocation method specifically includes: a. Calculate beam allocation weights: or Among them, B i represents the number of terminals at the ith wave position with a terminal, W i Ptotal represents the terminal traffic volume of the ith wave position with a terminal, i Assign weights to the beams, The sum of the number of terminals in the wave positions with terminals, Indicates the total terminal traffic of the wave positions with terminals, when When calculating Ptotal, the terminal business volume value should be converted into a value proportional to the terminal value before calculating Ptotal. i ; b. Allocate beams. The first n-1 beams with terminals are allocated. beams, the nth beam with terminal is allocated beams.

4. The method for high-throughput satellite beam-hopping scheduling according to claim 3, characterized in that: In steps S6 and S7, the beam allocation method includes: once a beam position with a terminal has been allocated a corresponding beam, no other beams will be allocated to the beam position; each beam is allocated to at least one beam position with a terminal.

5. The method for high-throughput satellite beam-hopping scheduling according to claim 4, characterized in that: In step S6, the method for allocating the beam scanning time includes: Calculate the beam scanning time allocation weight P t1 , in, represents the sum of the number of terminals of all the positions scanned by the beam, B t Indicates the number of terminals corresponding to a certain wave position scanned by the beam; Under the premise of ensuring that each wave position with a terminal is scanned for at least 1 ms, the scanning time of the beam for the first K-1 wave positions with terminals is The scanning time of the beam to the last wave position with a terminal is Where Tp is the scanning period.

6. The method for high-throughput satellite beam-hopping scheduling according to claim 5, characterized in that: In step S7, the method for allocating the beam scanning time includes: Calculate the beam scanning time allocation weight P t2 , P t2 =P t1 *Pw t2 , in, represents the sum of terminal traffic of all wave positions scanned by the beam, W t Indicates the terminal traffic volume of a certain wave position scanned by the beam; Under the premise of ensuring that each wave position with a terminal is scanned for at least 1 ms, the scanning time of the beam for the first K-1 wave positions with terminals is The scanning time of the beam to the last wave position with a terminal is 7. The method for high-throughput satellite beam-hopping scheduling according to claim 5, characterized in that: In step S7, the method for allocating the beam scanning time includes: Calculate the beam scanning time allocation weight P t2 , Among them, B t represents the number of terminals at the tth wave position with a terminal, W t represents the terminal traffic of the tth wave position with a terminal, B t1 represents the number of terminals at the t1th wave position with a terminal, W t1 represents the terminal traffic volume of the t1th wave position with a terminal, It indicates the sum of the number of terminals and the terminal traffic calculated for all the wave positions with terminals that need to be scanned under a certain beam; Under the premise of ensuring that each wave position with a terminal is scanned for at least 1 ms, the scanning time of the beam for the first K-1 wave positions with terminals is The scanning time of the beam to the last wave position with a terminal is 8. The method for high-throughput satellite beam-hopping scheduling according to claim 6 or 7, characterized in that: In step S8, the 5GNR system scheduling algorithm is the EPF algorithm, or the RR polling, or the Max S / I maximum signal to interference and noise ratio algorithm.

Images