Low-orbit satellite beam scheduling and resource allocation method, device, equipment and storage medium

Abstract

The present application discloses a low-orbit satellite beam scheduling and resource allocation method, device, equipment and storage medium, which relates to the field of communication technology. The method includes: determining the time slot priority of the user to be scheduled; dividing the users to be scheduled into different user groups and determining the wave position interference matrix between the user groups; allocating time slots based on the time slot priority of the user to be scheduled and the wave position interference matrix between the user groups, and generating a beam hopping spectrum; within the update period of the beam hopping spectrum, determining the target user to be scheduled corresponding to the available beam in each time slot; allocating resources to each time slot based on the service priority of the target user to be scheduled for the available beam in each time slot. Through the above method, interference isolation and time slot allocation calculation are completed based on user priority and user grouping, multi-user resource allocation scheduling is performed in a single time slot, air interface resource information is fully utilized, and spectrum utilization and system throughput are maximized.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to low-orbit satellite beam scheduling and resource allocation methods, devices, equipment and storage media. Background Art

[0002] Currently, beam-hopping scheduling for low-orbit satellites typically involves initializing the system based on the number of satellite beams and the number of slots in the service area. Users' service needs are collected through the beams, and beam lighting patterns and time slots are designed based on user priority and the principle of interference isolation by beam distance or angle. Finally, power allocation and beam-hopping scheduling are completed. This approach primarily schedules beams based on user priority, then allocates time slots and power. It doesn't further consider the scheduling of multiple users on a single beam. This means it doesn't consider the overall coordination of beam scheduling and wireless resource scheduling in low-orbit communication scenarios, making it difficult to improve throughput and spectrum efficiency while balancing user latency and scheduling fairness.

[0003] The above content is only used to assist in understanding the technical solution of the present invention and does not constitute an admission that the above content is prior art. Summary of the Invention

[0004] The main purpose of this application is to provide a low-orbit satellite beam scheduling and resource allocation method, device, equipment and storage medium, aiming to solve the technical problem in the existing technology that it is difficult to improve throughput and spectrum efficiency while taking into account user delay and scheduling fairness.

[0005] To achieve the above objectives, the present application provides a low-orbit satellite beam scheduling and resource allocation method, the method comprising:

[0006] Determine the time slot priority of the user to be scheduled;

[0007] Dividing the users to be scheduled into different user groups and determining a wave position interference matrix between the user groups;

[0008] Performing time slot allocation based on the time slot priorities of the users to be scheduled and the beam position interference matrix between the user groups, and generating a beam hopping pattern;

[0009] Determining, within an update period of the beam hopping pattern, a target user to be scheduled corresponding to an available beam in each time slot;

[0010] Resources are allocated to each time slot based on the service priority of the target user to be scheduled in the available beams in each time slot.

[0011] In one embodiment, the step of dividing the users to be scheduled into different user groups includes:

[0012] Based on the time slot priorities of the users to be scheduled, the users to be scheduled are sorted in descending order to obtain a user sequence;

[0013] The user to be scheduled with the highest time slot priority in the user sequence is taken as the central user, and based on the position of the central user and the satellite beam radius, the coverable users are determined in the user sequence;

[0014] Based on the central user and the coverable users, forming corresponding user groups;

[0015] Deleting the central user and the coverable user from the user sequence;

[0016] When there are ungrouped users to be scheduled in the user sequence, executing the step of selecting the user to be scheduled with the highest time slot priority in the user sequence as the central user;

[0017] When there are no ungrouped users to be scheduled in the user sequence, the steps of allocating time slots based on the priorities of the users to be scheduled and the beam position interference matrix between the user groups and generating a beam hopping pattern are performed.

[0018] In one embodiment, the step of determining the time slot priority of the user to be scheduled includes:

[0019] Obtaining a time slot priority evaluation index, wherein the time slot priority evaluation index includes at least a quality of service priority, a buffered data packet queue size, a channel condition, a user throughput rate, and a waiting time;

[0020] The time slot priority of the user to be scheduled is calculated based on the time slot priority evaluation index and the weight corresponding to the time slot priority evaluation index.

[0021] In one embodiment, the step of performing time slot allocation based on the time slot priority of the user to be scheduled and the beam position interference matrix between the user groups and generating a beam hopping pattern includes:

[0022] Determine the priority of the waveband corresponding to the user to be scheduled based on the time slot priority of the user to be scheduled, and use the waveband with the highest priority as the starting waveband;

[0023] Determining the number of time slots allocated to the starting beam position based on beam bandwidth, spectrum efficiency, and user demand information of the starting beam position;

[0024] Allocate consecutive time slots to the starting wave position based on the number of time slots allocated to the starting wave position;

[0025] Determining an interference avoidance wave position corresponding to the starting wave position based on the wave position interference matrix;

[0026] Determining the number of time slots allocated to the interference avoidance beam position based on the beam bandwidth, the spectrum efficiency, and user demand information of the interference avoidance beam position;

[0027] Allocating continuous time slots to the interference avoidance beam position based on the number of time slots allocated to the interference avoidance beam position;

[0028] When the time slot allocation is completed, generating the beam hopping pattern;

[0029] When the time slot allocation is not completed, the interference avoidance beam position is used as a new starting beam position, and a step of determining an interference avoidance beam position corresponding to the starting beam position based on the beam position interference matrix is ​​performed.

[0030] In one embodiment, the step of determining the wave position interference matrix between the user groups includes:

[0031] Determining the wavelength of the user group based on the wavelength corresponding to the users to be scheduled in the user group;

[0032] determining, based on a center distance between the beam positions of the user groups, an interference state between the beam positions of the user groups, the interference state being either the presence of co-channel interference or the absence of co-channel interference;

[0033] Based on the interference state between the beam positions of the user groups, a beam position interference matrix between the user groups is generated.

[0034] In one embodiment, the step of allocating resources to each time slot based on the service priority of the target user to be scheduled in the available beam in each time slot includes:

[0035] Based on the service priorities of the target users to be scheduled in the available beams in each time slot, determining the highest priority users in the available beams in each time slot;

[0036] Allocate the corresponding number of resource blocks and resource block positions to the highest priority user in the available beam in each time slot;

[0037] When there are remaining resources, determine whether there are other users in the available beams in each time slot;

[0038] When other users exist, corresponding numbers of resource blocks and resource block positions are sequentially allocated to other users of available beams in each time slot based on their service priorities.

[0039] In one embodiment, before the step of allocating resources to each time slot based on the service priority of the target user to be scheduled in the available beam in each time slot, the step further includes:

[0040] Obtaining a service priority evaluation indicator, wherein the service priority evaluation indicator includes at least service quality priority, retransmission request information, channel state information, buffered data to be sent, and average throughput;

[0041] The service priority of the target user to be scheduled is calculated based on the service priority evaluation index and the weight corresponding to the service priority evaluation index.

[0042] In addition, to achieve the above-mentioned purpose, the present application also proposes a low-orbit satellite beam scheduling and resource allocation device, which includes:

[0043] Priority calculation module, used to determine the time slot priority of the user to be scheduled;

[0044] A user grouping module is used to divide the users to be scheduled into different user groups and determine the wave position interference matrix between the user groups;

[0045] A time slot allocation module, configured to allocate time slots based on the time slot priorities of the users to be scheduled and the beam position interference matrix between the user groups, and generate a beam hopping pattern;

[0046] A resource allocation module, configured to determine, within an update period of the beam hopping pattern, a target user to be scheduled corresponding to an available beam in each time slot;

[0047] The resource allocation module is further configured to allocate resources to each time slot based on the service priority of the target user to be scheduled in the available beam in each time slot.

[0048] In addition, to achieve the above-mentioned purpose, the present application also proposes a low-orbit satellite beam scheduling and resource allocation device, which includes: a memory, a processor, and a computer program stored in the memory and runnable on the processor. The computer program is configured to implement the steps of the low-orbit satellite beam scheduling and resource allocation method as described above.

[0049] In addition, to achieve the above-mentioned purpose, the present invention also proposes a storage medium, which is a computer-readable storage medium. A computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the low-orbit satellite beam scheduling and resource allocation method as described above are implemented.

[0050] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which includes a computer program. When the computer program is executed by a processor, it implements the steps of the low-orbit satellite beam scheduling and resource allocation method as described above.

[0051] The present application provides a low-orbit satellite beam scheduling and resource allocation method, which determines the time slot priority of users to be scheduled; divides users to be scheduled into different user groups and determines the wave position interference matrix between user groups; allocates time slots based on the time slot priority of users to be scheduled and the wave position interference matrix between user groups, and generates a beam hopping spectrum; determines the target users to be scheduled corresponding to the available beams in each time slot within the update period of the beam hopping spectrum; and allocates resources to each time slot based on the service priority of the target users to be scheduled in the available beams in each time slot. Based on user priority and user grouping, interference isolation and time slot allocation calculations are completed, and beam hopping pattern design is completed. During each beam hopping pattern update period, the user list and priority ranking are updated in real time for each time slot, and multi-user resource allocation scheduling is performed in a single time slot, thereby maximizing spectrum efficiency and system throughput while taking into account user delay and scheduling fairness, solving the technical problem of difficulty in improving throughput and spectrum efficiency while taking into account user delay and scheduling fairness. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0053] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0054] Figure 1 This is a flowchart of Embodiment 1 of the low-orbit satellite beam scheduling and resource allocation method of the present application;

[0055] Figure 2 A schematic diagram of the timing of low-orbit satellite beam hopping scheduling of the low-orbit satellite beam scheduling and resource allocation method provided in Example 1 of the present application;

[0056] Figure 3 This is a flowchart of Embodiment 2 of the low-orbit satellite beam scheduling and resource allocation method of the present application;

[0057] Figure 4 A schematic diagram of a wireless resource grid for the low-orbit satellite beam scheduling and resource allocation method provided in Example 2 of the present application;

[0058] Figure 5 A schematic diagram of the overall architecture of the low-orbit satellite beam scheduling and resource allocation method provided in Example 2 of the present application;

[0059] Figure 6A schematic diagram of a simplified flow chart of the low-orbit satellite beam scheduling and resource allocation method provided in Example 2 of the present application;

[0060] Figure 7 This is a schematic diagram of the module structure of the low-orbit satellite beam scheduling and resource allocation device according to an embodiment of the present application;

[0061] Figure 8 This is a schematic diagram of the device structure of the hardware operating environment involved in the low-orbit satellite beam scheduling and resource allocation method in the embodiment of the present application.

[0062] The realization of the objectives, functional features and advantages of this application will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0063] It should be understood that the specific embodiments described herein are merely used to explain the technical solutions of the present application and are not intended to limit the present application.

[0064] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0065] The main solutions of the embodiments of the present application are: determining the time slot priority of the users to be scheduled; dividing the users to be scheduled into different user groups, and determining the wave position interference matrix between the user groups; allocating time slots based on the time slot priority of the users to be scheduled and the wave position interference matrix between the user groups, and generating a beam hopping spectrum; determining the target users to be scheduled corresponding to the available beams in each time slot within the update period of the beam hopping spectrum; and allocating resources to each time slot based on the service priority of the target users to be scheduled for the available beams in each time slot.

[0066] Low-orbit satellite communications generally involve satellites operating at altitudes between 300 and 1,500 km, with single-beam coverage of approximately 100 to 1,000 km. These systems utilize multi-beam phased array antennas to achieve wide-area coverage and high throughput. Low-orbit satellite networks serve a large area, and the distribution of users and traffic demand is often spatially uneven. Beam hopping technology utilizes all available satellite resources to provide service to specific locations or users. By adjusting the beam's illumination duration and period, varying capacity values ​​are provided to balance the requirements of different beam coverage areas. Furthermore, beam hopping can isolate unlit beam locations between co-frequency beams to reduce co-channel interference.

[0067] Traditional satellite communication beam-hopping technology calculates user capacity requirements based on beam positions and allocates beam directions and coverage time slots to beam positions within the coverage area within a unit cycle, thereby completing beam-hopping scheduling and allocation. In traditional terrestrial 5G base stations, wireless resource scheduling manages and allocates air interface wireless resources, providing downlink and uplink data transmission services to terminals. Based on various information, the base station's scheduling management dynamically selects which terminals can be scheduled (able to send and receive data over the air interface) and how much wireless air interface resources to allocate to these terminals. The scheduling management module uses different scheduling algorithms to maximize system throughput, optimize user experience, or strike a balance between the two.

[0068] However, low-orbit satellites move rapidly, and network topology changes dynamically, requiring real-time resource scheduling. Compared to high-orbit satellites, their beam coverage is relatively small, placing higher latency requirements on mobile users (such as aircraft and ships). Therefore, resource allocation must balance service latency performance while improving throughput and spectrum efficiency.

[0069] The present application provides a solution that completes interference isolation and time slot allocation calculations based on user priority and user grouping, completes beam hopping pattern design, updates the user list and priority ranking for each time slot in real time during each beam hopping pattern update cycle, and performs multi-user resource allocation scheduling in a single time slot, thereby maximizing spectrum efficiency and system throughput while taking into account user latency and scheduling fairness, solving the technical problem of difficulty in improving throughput and spectrum efficiency while taking into account user latency and scheduling fairness.

[0070] It should be noted that the execution subject of this embodiment may be a computing service device with data processing, network communication, and program execution capabilities, such as a tablet computer, personal computer, or mobile phone, or an electronic device capable of performing the aforementioned functions, such as a low-orbit satellite beam scheduling and resource allocation device, and this embodiment does not specifically limit this. This embodiment and the following embodiments will be described using a low-orbit satellite beam scheduling and resource allocation device as an example.

[0071] The present invention provides a method for beam scheduling and resource allocation of low-orbit satellites. Figure 1 , Figure 1 This is a flowchart of the first embodiment of the low-orbit satellite beam scheduling and resource allocation method of the present application.

[0072] In this embodiment, the low-orbit satellite beam scheduling and resource allocation method includes steps S10 to S50:

[0073] Step S10, determining the time slot priority of the user to be scheduled;

[0074] It should be noted that the user to be scheduled is the user equipment (UE) that requires beam scheduling and resource allocation. The beam periodically scans all visible positions under the satellite to obtain the user to be scheduled, and also obtains the location information and user demand information of each user to be scheduled. The time slot priority refers to the priority of the user to be scheduled when allocating time slots. The user group is the set of users obtained after the user to be scheduled is grouped. The specific number is determined based on actual conditions and is not specifically limited. The user to be scheduled is divided into different user groups according to the time slot priority of the user to be scheduled, so as to facilitate subsequent time slot allocation.

[0075] In a feasible implementation, step S10 includes: obtaining a time slot priority evaluation index, wherein the time slot priority evaluation index includes at least service quality priority, buffer data packet queue size, channel conditions, user throughput and waiting time; based on the time slot priority evaluation index and the weight corresponding to the time slot priority evaluation index, calculating the time slot priority of the user to be scheduled.

[0076] It should be noted that the time slot priority evaluation index refers to the relevant index used to calculate the time slot priority, which at least includes the quality of service (QoS) priority, the buffer packet queue size, the channel condition, the user throughput rate and the waiting time. Other indicators can also be set according to actual needs, and there is no specific limitation on this. Each time slot priority evaluation index has a corresponding weight. According to the weight of the time slot priority evaluation index, a weighted calculation is performed to obtain the time slot priority of each user to be scheduled. For example, assuming that the time slot priority evaluation index uses the quality of service priority a, the buffer packet queue size b, the channel condition c, the user throughput rate d and the waiting time e, and the corresponding weights are w1, w2, w3, w4, and w5 respectively, then the time slot priority is a*w1+b*w2+c*w3+d*w4+e*w5.

[0077] It can be understood that, for data flows with good channel conditions and sufficient data packets in the buffer, the data flows that can utilize time slot resources can obtain higher priority, and the average throughput can be used to balance user fairness.

[0078] Step S20: dividing the users to be scheduled into different user groups and determining a wave position interference matrix between the user groups;

[0079] In a feasible implementation, step S20 may include steps S201 to S204:

[0080] Step S201, sorting the users to be scheduled in descending order based on their time slot priorities to obtain a user sequence;

[0081] It should be noted that the user sequence is a sequence formed by sorting the users to be scheduled. In this embodiment, the users to be scheduled are sorted from high to low according to their time slot priorities to generate the user sequence.

[0082] Step S202: The user to be scheduled with the highest time slot priority in the user sequence is taken as the central user, and based on the position of the central user and the satellite beam radius, the coverable users in the user sequence are determined;

[0083] It should be noted that the central user refers to the user to be scheduled as the center of the user group. The user to be scheduled with the highest time slot priority in the user sequence is selected as the central user. Based on the position of the central user, the user to be scheduled that can be covered by the satellite beam radius is found.

[0084] It can be understood that, in this embodiment, the beam can cover as many users as possible (best effort) while including the central user.

[0085] Step S203: forming corresponding user groups based on the central user and the coverable users, and deleting the central user and the coverable users from the user sequence;

[0086] It is understandable that the central user and the corresponding covered users can be grouped as one user. At this point, the central user and the corresponding covered users have been grouped and are deleted from the user sequence in order to continue dividing the next user group.

[0087] Step S204: When there are ungrouped users to be scheduled in the user sequence, the step of using the user to be scheduled with the highest time slot priority in the user sequence as the central user is executed; when there are no ungrouped users to be scheduled in the user sequence, the step of allocating time slots based on the priority of the users to be scheduled and the wave position interference matrix between the user groups is executed to generate a beam hopping pattern.

[0088] It should be noted that if there are no ungrouped users to be scheduled in the user sequence, it means that the division of all users to be scheduled has been completed and the next step S30 can be continued; if there are ungrouped users to be scheduled in the user sequence, it means that the division of all users to be scheduled has not been completed and it is necessary to return to step S202 to determine a new central user, determine the corresponding coverable users according to the new central user, and form a new user group until all users to be scheduled are divided.

[0089] Furthermore, the step of determining the wave position interference matrix between user groups includes: determining the wave position of the user group based on the wave position corresponding to the user to be scheduled in the user group; determining the interference state between the wave positions of the user group based on the center distance between the wave positions of the user group, the interference state being either the presence or absence of co-channel interference; and generating the wave position interference matrix between the user groups based on the interference state between the wave positions of the user group.

[0090] It should be noted that each user to be scheduled has a corresponding wavelength, and each wavelength can correspond to multiple users to be scheduled. The wavelength of each user group can be determined according to the wavelength of the users to be scheduled.

[0091] In addition, it should be noted that the center distance between the wave positions refers to the distance between the center points of the wave positions. The interference state refers to the interference situation between two wave positions, including two states: the presence of co-channel interference and the absence of co-channel interference. If the interference state is the presence of co-channel interference, it means that there is co-channel interference (co-channel interference) between the two wave positions. If the interference state is the absence of co-channel interference, it means that there is no co-channel interference between the two wave positions. The interference state between the wave positions of the user group can be represented by 0 and 1, that is, 0 is used to indicate the absence of co-channel interference and 1 is used to indicate the presence of co-channel interference, so that a matrix of interference states can be generated, that is, the wave position interference matrix.

[0092] It can be understood that according to the radiation pattern of the phased array antenna, when the distance between two lit wave positions is large enough, the co-channel interference between the wave positions can be ignored. Assume that the minimum spatial co-channel interference avoidance distance between the wave positions is R d , the center point position vectors of the two wave positions are The center distance between wave position i and wave position j is less than R d When there is co-frequency interference between the two wave positions, the interference state is co-frequency interference, and the center distance between wave position i and wave position j is greater than or equal to R d When , there is no co-channel interference between the two beams. In this case, the interference state is no co-channel interference. This allows us to determine the interference state between the beams of the user group and generate a beam interference matrix.

[0093] Step S30, allocating time slots based on the time slot priorities of the users to be scheduled and the beam position interference matrix between the user groups, and generating a beam hopping pattern;

[0094] It should be noted that the reference Figure 2 , T in the figure b Indicates the smallest time scale (time slot) in the system, b During this period, a maximum of K beams are scheduled. In addition, this embodiment introduces a beam hopping pattern update period T s, that is, per T S Calculate the next T s Periodic beam-hopping slot occupancy.

[0095] In a feasible implementation, step S30 may include steps S301 to S307:

[0096] Step S301, determining the priorities of the corresponding wavelengths of the users to be scheduled based on the time slot priorities of the users to be scheduled, and taking the wavelength with the highest priority as the starting wavelength;

[0097] It should be noted that the priority of the corresponding wave position of the user to be scheduled is determined according to the time slot priority of the user to be scheduled, so that the wave position with the highest priority can be found as the starting wave position, which is the wave position where time slots are first allocated.

[0098] Step S302: determining the number of time slots allocated to the starting beam position based on the beam width, spectrum efficiency, and user demand information of the starting beam position;

[0099] It should be noted that the number of allocated time slots is the number of time slots allocated to each waveband. The user demand of the starting waveband includes the demand information of all users to be scheduled corresponding to the starting waveband.

[0100] Step S303: Allocate consecutive time slots to the starting wave position based on the number of time slots allocated to the starting wave position;

[0101] It can be understood that the highest priority wave position is first selected as the starting wave position, and the number of time slots allocated to the starting wave position is calculated according to the beam bandwidth, spectrum efficiency, and user demand information, and is allocated continuously, which can maximize the guarantee that the beam irradiates the wave position without jumping back and forth.

[0102] Step S304: determining an interference avoidance wavelet corresponding to the starting wavelet based on the wavelet interference matrix;

[0103] It should be noted that the interference avoidance principle is used to select the wave positions that are lit at the same time as the starting wave position in other wave positions, and the wave positions with higher priorities are selected first, that is, the wave positions with a distance greater than the same-frequency interference avoidance distance R are selected. d The highest priority wave position is selected to determine the interference avoidance wave position.

[0104] Step S305: determining the number of time slots allocated to the interference avoidance beam position based on the beam width, the spectrum efficiency, and user demand information of the interference avoidance beam position;

[0105] It should be noted that the user demand of the interference avoidance waveband includes demand information of all to-be-scheduled users corresponding to the interference avoidance waveband.

[0106] Step S306: allocating continuous time slots to the interference avoidance beam position based on the number of time slots allocated to the interference avoidance beam position;

[0107] It can be understood that the number of time slots allocated to the interference avoidance wave position is calculated according to the beam bandwidth, spectrum efficiency, and user demand information, and is allocated continuously, which can maximize the guarantee that the beam illumination of the wave position does not jump back and forth.

[0108] Step S307: When the time slot allocation is completed, the beam hopping pattern is generated. When the time slot allocation is not completed, the interference avoidance beam position is used as a new starting beam position, and the step of determining the interference avoidance beam position corresponding to the starting beam position based on the beam position interference matrix is ​​performed.

[0109] It should be noted that the completion of time slot allocation indicates that all current time slots have been allocated, and the beam hopping pattern can be generated, and the next step S40 is continued; the incomplete time slot allocation indicates that some time slots have not been allocated. At this time, the interference avoidance wave position is used as the new starting wave position, and the next interference avoidance wave position is determined for time slot allocation until all time slots are allocated.

[0110] It can be understood that the entire beam hopping pattern update period T s The beams of all time slots in the hop are allocated in sequence until all time slots are allocated, generating a beam hopping pattern.

[0111] It should be understood that after the user completes the grouping, s The time slot allocation of each wave position within the time period is continuous, which can maximize the guarantee that the beam irradiates the wave position without jumping back and forth, while taking into account T s Irradiation of all wave positions within a certain time period.

[0112] Step S40: determining the target user to be scheduled corresponding to the available beam in each time slot within the update period of the beam hopping pattern;

[0113] It should be noted that the update period of the beam hopping pattern is the beam hopping pattern update period Ts. Available beams refer to the K beams that can be scheduled within a time slot. The users of each available beam within a time slot may change. The target users to be scheduled are the real-time scheduled users for each available beam within the time slot.

[0114] It can be understood that, according to the change of users, the target users to be scheduled corresponding to the available beams in each time slot are updated within the update period of the beam hopping map.

[0115] Step S50 , allocating resources to each time slot based on the service priority of the target user to be scheduled in the available beam in each time slot.

[0116] It should be noted that when allocating resources, users in the beam are prioritized twice, and the priority used at this time is the service priority.

[0117] In a feasible implementation, the step of determining the service priority includes: obtaining a service priority evaluation index, wherein the service priority evaluation index includes at least service quality priority, retransmission request information, channel status information, buffered data to be sent, and average throughput; based on the service priority evaluation index and the weight corresponding to the service priority evaluation index, calculating the service priority of the target user to be scheduled.

[0118] It should be noted that the service priority evaluation index refers to the relevant index used to calculate the service priority, including at least the service quality priority, retransmission request (HARQ) information, channel status (CSI) information, buffered data to be sent and average throughput. Other indicators can also be set according to actual needs, and there is no specific limitation on this. Each service priority evaluation index has a corresponding weight. According to the weight of the service priority evaluation index, a weighted calculation is performed to obtain the service priority of each target user to be scheduled. For example, assuming that the service priority evaluation index uses the service quality priority x, retransmission request information y, channel status information z, buffered data to be sent k and average throughput p, and the corresponding weights are m1, m2, m3, m4 and m5 respectively, the calculated service priority is x*m1+y*m2+z*m3+k*m4+p*m5.

[0119] It can be understood that resources are allocated to each time slot according to the service priority of the target user to be scheduled in the available beam in each time slot, and the corresponding number of resource blocks (RBs) and resource block positions are allocated.

[0120] It should be understood that the changes in users within the beam are updated in each time slot, thereby ensuring that high-priority users that are newly added and switched in each time slot can respond in a timely manner.

[0121] This embodiment provides a low-orbit satellite beam scheduling and resource allocation method, which determines the time slot priority of users to be scheduled; divides users to be scheduled into different user groups and determines the wave position interference matrix between user groups; allocates time slots based on the time slot priority of users to be scheduled and the wave position interference matrix between user groups, and generates a beam hopping pattern; determines the target users to be scheduled corresponding to the available beams in each time slot within the update cycle of the beam hopping pattern; and allocates resources to each time slot based on the service priority of the target users to be scheduled for the available beams in each time slot. Based on user priority and user grouping, interference isolation and time slot allocation calculations are performed to complete the beam hopping pattern design. During each beam hopping pattern update cycle, the user list and priority ranking are updated in real time for each time slot, and multi-user resource allocation scheduling is performed in a single time slot, thereby maximizing spectrum efficiency and system throughput while taking into account user latency and scheduling fairness.

[0122] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the above embodiment 1 can be referred to the above introduction and will not be described in detail later. Figure 3 , step S50 may include steps S501 to S504:

[0123] Step S501, based on the service priorities of the target users to be scheduled in the available beams in each time slot, determining the highest priority user in the available beams in each time slot;

[0124] It should be noted that the reference Figure 4 The grid in the figure is the 5G OFDM (Orthogonal Frequency Division Multiplexing) wireless time-frequency resource grid. A time slot in the time domain contains N OFDM symbols, and the frequency domain contains N according to the size of the bandwidth BW RE RE (Resource Element), 6 REs constitute a minimum frequency domain allocation granularity, that is, N RB =N RE / 6, then the total available wireless time-frequency resources in one time slot are:

[0125] F=N OFDM *N RB

[0126] Number the wireless resources of a time slot, where Indicates that the i-th RB (Resource Block) of the j-th OFDM symbol has been occupied, f i,j=0 indicates that the i-th RB of the j-th OFDM symbol is not occupied. During resource scheduling in a time slot, the unoccupied RB resources can still be allocated to the next user.

[0127] It can be understood that the highest priority user refers to the user with the highest service priority, and the highest priority user of the available beam in each time slot is the target user to be scheduled with the highest service priority of the available beam in each time slot.

[0128] Step S502, allocating the corresponding number of resource blocks and resource block positions to the highest priority user of the available beam in each time slot;

[0129] It should be noted that the highest priority user is first allocated resources, and the corresponding resource block quantity and resource block position are allocated. In this embodiment, the resource block quantity and resource block position refer to the RB resource quantity and RB resource position.

[0130] Step S503: When there are remaining resources, determine whether there are other users in the available beams in each time slot;

[0131] It should be noted that the remaining resources refer to the remaining RB resources. The existence of remaining resources indicates that the RB resources have not been fully allocated and there are still some remaining. At this time, the remaining resources can be allocated to other target users to be scheduled in the available beam. Other users are target users to be scheduled except the highest priority users.

[0132] It is understandable that when it is determined that there are remaining resources, it is necessary to further determine whether there are other users. If there are no other users, there is no need to continue with the allocation; if there are no other users, the allocation will continue.

[0133] It should be understood that when it is determined that there are no remaining resources, allocation cannot continue.

[0134] Step S504 : when there are other users, corresponding resource block quantities and resource block positions are sequentially allocated to other users of available beams in each time slot based on the service priorities of the other users.

[0135] It is understandable that when there are other users, the corresponding number of resource blocks and resource block positions are still allocated in sequence according to the service priority. The higher the service priority, the higher the priority, until there are no remaining resources or all other users have been allocated.

[0136] It should be understood that resources are allocated to time slots according to the update cycle of the beam hopping map. If the next cycle is reached, it is necessary to redetermine the users to be scheduled and return to step S10 for beam scheduling and resource allocation.

[0137] This embodiment provides a low-orbit satellite beam scheduling and resource allocation method, which determines the highest-priority user of the available beam in each time slot based on the service priority of the target user to be scheduled in the available beam in each time slot; allocates a corresponding number of resource blocks and resource block positions to the highest-priority user of the available beam in each time slot; when there are remaining resources, determines whether there are other users in the available beam in each time slot; when there are other users, allocates a corresponding number of resource blocks and resource block positions to other users of the available beam in each time slot in turn based on the service priority of other users; performs interference isolation and time slot allocation calculations based on user priority and user grouping, and completes beam hopping pattern design; updates the user list and priority ranking for each time slot in real time during each beam hopping pattern update cycle, and performs multi-user resource allocation scheduling in a single time slot, thereby maximizing spectrum efficiency and system throughput while taking into account user delay and scheduling fairness.

[0138] For example, in order to help understand the implementation process of the low-orbit satellite beam scheduling and resource allocation method obtained by combining this embodiment with the above-mentioned embodiment 2, please refer to Figure 5 , Figure 5 A schematic diagram of the overall architecture of a low-orbit satellite beam scheduling and resource allocation method is provided, specifically:

[0139] Based on conditions such as the user list, QoS information, CSI information, uplink and downlink buffer size, beam radius, and interference distance, the system performs user priority sorting, user grouping, interference avoidance, and time slot allocation calculations, outputting a beam hopping pattern. It then prioritizes users within the group, calculates MCS, and allocates RB resources in each time slot, outputting information such as user selection, MCS selection, antenna and resource mapping, and retransmission control during the scheduling process.

[0140] For example, in order to help understand the implementation process of the low-orbit satellite beam scheduling and resource allocation method obtained by combining this embodiment with the above-mentioned embodiment 2, please refer to Figure 6 , Figure 6 A brief flowchart of a low-orbit satellite beam scheduling and resource allocation method is provided. Specifically:

[0141] Step 1: Scan all visible positions under the satellite periodically to obtain the user set U n , including UE location information and user demand information.

[0142] Step 2: Prioritization, sort the user set U n The priority of all users in is calculated one by one, and priority weighted calculation is performed based on QoS priority, buffer packet queue size, channel conditions, user throughput, waiting time and other information. The calculation results are sorted from high to low to generate the sorted user set U n.

[0143] Step 3: Initialize i=1 and obtain the current highest priority user U i .

[0144] Step 4: User group, press U i The UE position and satellite beam radius D form user group N i (wave position center), that is, in the i In this case, the beam covers as many users as possible (best effort).

[0145] Step 5: Users that have been included in the group are removed from the user set.

[0146] Step 6: i++, view the user set U n Check whether there are any users who have not entered the group. If yes, repeat steps 4 to 6. If no, go to step 7.

[0147] Step 7: Interference avoidance, assuming that the minimum spatial co-channel interference avoidance distance between wave positions is R d , when the distance between the centers of the two wave positions is less than R d When the distance between the centers of the two wave positions is greater than or equal to R d When , there is no co-channel interference. Calculate the wave position interference matrix between all user groups.

[0148] Step 8: Time slot allocation. First, select the highest priority wavelet as the starting wavelet. The number of time slots allocated to this wavelet is calculated and continuously allocated according to the beam bandwidth, spectrum efficiency, and the needs of all users of the wavelet. This ensures that the beam does not jump back and forth when illuminating the wavelet. Then, according to the principle of interference avoidance, select the wavelet that is lit at the same time as the starting wavelet from other wavelets. That is, the wavelet with a distance greater than R is selected first. d The highest priority wave position. s The K beams of W time slots in a cycle are allocated in sequence until all time slots are allocated, generating a beam hopping pattern.

[0149] Step 9: First update the user list corresponding to beam k in time slot t.

[0150] Step 10: Sort the users in beam k according to their service priorities (update and re-sort the user status in each time slot).

[0151] Step 11: For the user with the highest service priority in beam k, calculate and select the MCS, allocate the number and location of RBs, and determine the transmission format.

[0152] Step 12: Determine whether RB resources are available. If so, determine whether there are other users in the beam. If so, complete MCS selection and RB resource allocation based on priority.

[0153] Step 13: If there are no remaining RB resources or there are no other users in the beam, then k++;

[0154] Step 14: Determine whether k is less than the number of satellite beams that can be scheduled. If so, repeat steps 9 to 13 until all beams are scheduled.

[0155] Step 15: t++, determine whether the beam hopping pattern update cycle time has arrived. If not, repeat steps 9 to 14 to complete the next time slot resource scheduling.

[0156] Step 16: If the beam hopping pattern update time is reached, update the user set and repeat all steps 2 to 15 (every T s Re-execute).

[0157] It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the low-orbit satellite beam scheduling and resource allocation method of the present application. More simple transformations based on this technical concept are all within the scope of protection of the present application.

[0158] This application also provides a low-orbit satellite beam scheduling and resource allocation device, please refer to Figure 7 , the low-orbit satellite beam scheduling and resource allocation device includes:

[0159] Priority calculation module 10, used to determine the time slot priority of the user to be scheduled;

[0160] A user grouping module 20 is configured to divide the users to be scheduled into different user groups based on their time slot priorities and determine a wave position interference matrix between the user groups;

[0161] A time slot allocation module 30 is configured to allocate time slots based on the time slot priorities of the users to be scheduled and the beam position interference matrix between the user groups, and generate a beam hopping pattern;

[0162] The resource allocation module 40 is configured to determine, within an update period of the beam hopping pattern, target users to be scheduled corresponding to available beams in each time slot;

[0163] The resource allocation module 40 is further configured to allocate resources to each time slot based on the service priority of the target user to be scheduled in the available beam in each time slot.

[0164] In a feasible implementation manner, the user grouping module 20 is further configured to sort the users to be scheduled in descending order based on their time slot priorities to obtain a user sequence;

[0165] The user to be scheduled with the highest time slot priority in the user sequence is taken as the central user, and based on the position of the central user and the satellite beam radius, the coverable users are determined in the user sequence;

[0166] Based on the central user and the coverable users, forming corresponding user groups;

[0167] Deleting the central user and the coverable user from the user sequence;

[0168] When there are ungrouped users to be scheduled in the user sequence, executing the step of selecting the user to be scheduled with the highest time slot priority in the user sequence as the central user;

[0169] When there are no ungrouped users to be scheduled in the user sequence, the steps of allocating time slots based on the priorities of the users to be scheduled and the beam position interference matrix between the user groups and generating a beam hopping pattern are performed.

[0170] In a feasible embodiment, the user grouping module 20 is further configured to obtain a time slot priority evaluation index, wherein the time slot priority evaluation index includes at least a quality of service priority, a buffered data packet queue size, a channel condition, a user throughput rate, and a waiting time;

[0171] The time slot priority of the user to be scheduled is calculated based on the time slot priority evaluation index and the weight corresponding to the time slot priority evaluation index.

[0172] In a feasible implementation manner, the user grouping module 20 is further configured to determine the waveband of the user group based on the waveband corresponding to the users to be scheduled in the user group;

[0173] determining, based on a center distance between the beam positions of the user groups, an interference state between the beam positions of the user groups, the interference state being either the presence of co-channel interference or the absence of co-channel interference;

[0174] Based on the interference state between the beam positions of the user groups, a beam position interference matrix between the user groups is generated.

[0175] In a feasible implementation manner, the time slot allocation module 30 is further configured to determine the priority of the waveband corresponding to the user to be scheduled based on the time slot priority of the user to be scheduled, and use the waveband with the highest priority as the starting waveband;

[0176] Determining the number of time slots allocated to the starting beam position based on beam bandwidth, spectrum efficiency, and user demand information of the starting beam position;

[0177] Allocate consecutive time slots to the starting wave position based on the number of time slots allocated to the starting wave position;

[0178] Determining an interference avoidance wave position corresponding to the starting wave position based on the wave position interference matrix;

[0179] Determining the number of time slots allocated to the interference avoidance beam position based on the beam bandwidth, the spectrum efficiency, and user demand information of the interference avoidance beam position;

[0180] Allocating continuous time slots to the interference avoidance beam position based on the number of time slots allocated to the interference avoidance beam position;

[0181] When the time slot allocation is completed, generating the beam hopping pattern;

[0182] When the time slot allocation is not completed, the interference avoidance beam position is used as a new starting beam position, and a step of determining an interference avoidance beam position corresponding to the starting beam position based on the beam position interference matrix is ​​performed.

[0183] In a feasible implementation manner, the time slot allocation module 30 is further configured to determine the highest priority user of the available beam in each time slot based on the service priority of the target to-be-scheduled user of the available beam in each time slot;

[0184] Allocate the corresponding number of resource blocks and resource block positions to the highest priority user in the available beam in each time slot;

[0185] When there are remaining resources, determine whether there are other users in the available beams in each time slot;

[0186] When other users exist, corresponding numbers of resource blocks and resource block positions are sequentially allocated to other users of available beams in each time slot based on their service priorities.

[0187] In a feasible implementation manner, the resource allocation module 40 is further configured to obtain a service priority evaluation indicator, wherein the service priority evaluation indicator includes at least service quality priority, retransmission request information, channel state information, buffered data to be sent, and average throughput;

[0188] The service priority of the target user to be scheduled is calculated based on the service priority evaluation index and the weight corresponding to the service priority evaluation index.

[0189] The low-orbit satellite beam scheduling and resource allocation device provided in this application, which utilizes the low-orbit satellite beam scheduling and resource allocation method of the above-mentioned embodiment, can solve the technical problem of difficulty in improving throughput and spectrum efficiency while balancing user latency and scheduling fairness. Compared with the prior art, the beneficial effects of the low-orbit satellite beam scheduling and resource allocation device provided in this application are the same as those of the low-orbit satellite beam scheduling and resource allocation method provided in the above-mentioned embodiment. Other technical features of the low-orbit satellite beam scheduling and resource allocation device are the same as those disclosed in the above-mentioned embodiment method and are not further described here.

[0190] The present application provides a low-orbit satellite beam scheduling and resource allocation device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the low-orbit satellite beam scheduling and resource allocation method in the above-mentioned embodiment one.

[0191] Reference below Figure 8 , which shows a schematic structural diagram of a low-orbit satellite beam scheduling and resource allocation device suitable for implementing an embodiment of the present application. The low-orbit satellite beam scheduling and resource allocation device in the embodiment of the present application may include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), and in-vehicle terminals (e.g., in-vehicle navigation terminals), as well as fixed terminals such as digital TVs and desktop computers. Figure 8 The low-orbit satellite beam scheduling and resource allocation device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0192] like Figure 8As shown, the low-orbit satellite beam scheduling and resource allocation device may include a processing device 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes based on a program stored in a read-only memory (ROM) 1002 or a program loaded from a storage device 1003 into a random access memory (RAM) 1004. RAM 1004 also stores various programs and data required for the operation of the low-orbit satellite beam scheduling and resource allocation device. Processing device 1001, ROM 1002, and RAM 1004 are interconnected via a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems may be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, touchpad, keyboard, mouse, image sensor, microphone, accelerometer, gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), speaker, vibrator, etc.; storage devices 1003 including, for example, a magnetic tape, hard disk, etc.; and communication devices 1009. Communication devices 1009 may allow the low-orbit satellite beam scheduling and resource allocation device to communicate wirelessly or wired with other devices to exchange data. While the figure shows a low-orbit satellite beam scheduling and resource allocation device with various systems, it should be understood that implementation or presence of all the illustrated systems is not required. More or fewer systems may alternatively be implemented or present.

[0193] In particular, according to the embodiments disclosed in the present application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, the embodiments disclosed in the present application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program comprising program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network via a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0194] The low-orbit satellite beam scheduling and resource allocation device provided in this application, which utilizes the low-orbit satellite beam scheduling and resource allocation method of the above-described embodiment, can resolve the technical problem of difficulty in improving throughput and spectral efficiency while balancing user latency and scheduling fairness. Compared with the prior art, the beneficial effects of the low-orbit satellite beam scheduling and resource allocation device provided in this application are the same as those of the low-orbit satellite beam scheduling and resource allocation method provided in the above-described embodiment. Other technical features of the low-orbit satellite beam scheduling and resource allocation device are the same as those disclosed in the method of the above-described embodiment and are not further described here.

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

[0196] The above are only specific embodiments of the present application, but the scope of protection of this application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

[0197] The present application provides a computer-readable storage medium having computer-readable program instructions (i.e., a computer program) stored thereon, and the computer-readable program instructions are used to execute the low-orbit satellite beam scheduling and resource allocation method in the above-mentioned embodiment.

[0198] The computer-readable storage medium provided in this application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In this embodiment, the computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination thereof.

[0199] The above-mentioned computer-readable storage medium may be included in the low-orbit satellite beam scheduling and resource allocation device; or it may exist independently without being assembled into the low-orbit satellite beam scheduling and resource allocation device.

[0200] The above-mentioned computer-readable storage medium carries one or more programs. When the above-mentioned one or more programs are executed by the low-orbit satellite beam scheduling and resource allocation device, the low-orbit satellite beam scheduling and resource allocation device enables the low-orbit satellite beam scheduling and resource allocation device to: determine the time slot priority of the user to be scheduled; divide the users to be scheduled into different user groups, and determine the wave position interference matrix between the user groups; allocate time slots based on the time slot priority of the user to be scheduled and the wave position interference matrix between the user groups, and generate a beam hopping spectrum; within the update period of the beam hopping spectrum, determine the target user to be scheduled corresponding to the available beam in each time slot; and allocate resources to each time slot based on the service priority of the target user to be scheduled for the available beam in each time slot.

[0201] Computer program code for performing the operations of the present application may be written in one or more programming languages, or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on the remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0202] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present application. In this regard, each box in the flow chart or block diagram can represent a module, program segment or a part of code, and the module, program segment or a part of code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order than that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented by a dedicated hardware-based system that performs the specified function or operation, or can be implemented by a combination of dedicated hardware and computer instructions.

[0203] The modules described in the embodiments of the present application may be implemented in software or hardware, wherein the name of a module does not necessarily limit the unit itself.

[0204] The computer-readable storage medium provided in this application is a computer-readable storage medium that stores computer-readable program instructions (i.e., a computer program) for executing the aforementioned low-orbit satellite beam scheduling and resource allocation method. This computer-readable storage medium can address the technical issue of difficulty in improving throughput and spectral efficiency while balancing user latency and scheduling fairness. Compared to the prior art, the beneficial effects of the computer-readable storage medium provided in this application are the same as those of the low-orbit satellite beam scheduling and resource allocation method provided in the aforementioned embodiment, and are not further elaborated here.

[0205] The present application also provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of the above-mentioned low-orbit satellite beam scheduling and resource allocation method.

[0206] The computer program product provided in this application can address the technical problem of achieving a balance between user latency and scheduling fairness while improving throughput and spectral efficiency. Compared to existing technologies, the computer program product provided in this application offers the same beneficial effects as the low-orbit satellite beam scheduling and resource allocation method provided in the aforementioned embodiments, and will not be further elaborated here.

[0207] The above are only some embodiments of the present application and are not intended to limit the patent scope of the present application. All equivalent structural transformations made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect application in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A low-orbit satellite beam scheduling and resource allocation method, characterized in that: The method comprises: Determine the time slot priority of the user to be scheduled; Dividing the users to be scheduled into different user groups and determining a wave position interference matrix between the user groups; Performing time slot allocation based on the time slot priorities of the users to be scheduled and the beam position interference matrix between the user groups, and generating a beam hopping pattern; During an update period of the beam hopping pattern, updating target users to be scheduled corresponding to available beams in each time slot; Allocate resources to each time slot based on the service priority of the target user to be scheduled in the available beams within each time slot; The step of performing time slot allocation based on the time slot priorities of the users to be scheduled and the beam position interference matrix between the user groups and generating a beam hopping pattern includes: Determine the priority of the waveband corresponding to the user to be scheduled based on the time slot priority of the user to be scheduled, and use the waveband with the highest priority as the starting waveband; Determining the number of time slots allocated to the starting beam position based on beam bandwidth, spectrum efficiency, and user demand information of the starting beam position; Allocate consecutive time slots to the starting wave position based on the number of time slots allocated to the starting wave position; Determining an interference avoidance wave position corresponding to the starting wave position based on the wave position interference matrix; Determining the number of time slots allocated to the interference avoidance beam position based on the beam bandwidth, the spectrum efficiency, and user demand information of the interference avoidance beam position; Allocating continuous time slots to the interference avoidance beam position based on the number of time slots allocated to the interference avoidance beam position; When the time slot allocation is completed, generating the beam hopping pattern; When the time slot allocation is not completed, the interference avoidance beam position is used as a new starting beam position, and a step of determining an interference avoidance beam position corresponding to the starting beam position based on the beam position interference matrix is ​​performed.

2. The method according to claim 1, wherein The step of dividing the users to be scheduled into different user groups includes: Sort the users to be scheduled in descending order based on their time slot priorities to obtain a user sequence; The user to be scheduled with the highest time slot priority in the user sequence is taken as the central user, and based on the position of the central user and the satellite beam radius, the coverable users are determined in the user sequence; Based on the central user and the coverable users, forming corresponding user groups; Deleting the central user and the coverable user from the user sequence; When there are ungrouped users to be scheduled in the user sequence, executing the step of selecting the user to be scheduled with the highest time slot priority in the user sequence as the central user; When there are no ungrouped users to be scheduled in the user sequence, the steps of allocating time slots based on the time slot priorities of the users to be scheduled and the beam position interference matrix between the user groups and generating a beam hopping pattern are performed.

3. The method according to claim 1, wherein The step of determining the time slot priority of the user to be scheduled comprises: Obtaining a time slot priority evaluation index, wherein the time slot priority evaluation index includes at least a quality of service priority, a buffered data packet queue size, a channel condition, a user throughput rate, and a waiting time; The time slot priority of the user to be scheduled is calculated based on the time slot priority evaluation index and the weight corresponding to the time slot priority evaluation index.

4. The method according to claim 3, wherein The step of determining the wave position interference matrix between the user groups comprises: Determining the wavelength of the user group based on the wavelength corresponding to the users to be scheduled in the user group; determining, based on a center distance between the beam positions of the user groups, an interference state between the beam positions of the user groups, the interference state being either the presence of co-channel interference or the absence of co-channel interference; Based on the interference state between the beam positions of the user groups, a beam position interference matrix between the user groups is generated.

5. The method according to claim 1, wherein The step of allocating resources to each time slot based on the service priority of the target user to be scheduled in the available beam in each time slot includes: Based on the service priorities of the target users to be scheduled in the available beams in each time slot, determining the highest priority users in the available beams in each time slot; Allocate the corresponding number of resource blocks and resource block positions to the highest priority user in the available beam in each time slot; When there are remaining resources, determine whether there are other users in the available beams in each time slot; When other users exist, corresponding numbers of resource blocks and resource block positions are sequentially allocated to other users of available beams in each time slot based on their service priorities.

6. The method according to any one of claims 1 to 5, characterized in that Before the step of allocating resources to each time slot based on the service priority of the target user to be scheduled in the available beam in each time slot, the step further includes: Obtaining a service priority evaluation indicator, wherein the service priority evaluation indicator includes at least service quality priority, retransmission request information, channel state information, buffered data to be sent, and average throughput; The service priority of the target user to be scheduled is calculated based on the service priority evaluation index and the weight corresponding to the service priority evaluation index.

7. A low-orbit satellite beam scheduling and resource allocation device, characterized in that: The device comprises: Priority calculation module, used to determine the time slot priority of the user to be scheduled; A user grouping module is used to divide the users to be scheduled into different user groups and determine the wave position interference matrix between the user groups; A time slot allocation module, configured to allocate time slots based on the time slot priorities of the users to be scheduled and the beam position interference matrix between the user groups, and generate a beam hopping pattern; A resource allocation module, configured to update the target users to be scheduled corresponding to the available beams in each time slot within an update period of the beam hopping pattern; The resource allocation module is further configured to allocate resources to each time slot based on the service priority of the target user to be scheduled in the available beam in each time slot; The step of performing time slot allocation based on the time slot priorities of the users to be scheduled and the beam position interference matrix between the user groups and generating a beam hopping pattern includes: Determine the priority of the waveband corresponding to the user to be scheduled based on the time slot priority of the user to be scheduled, and use the waveband with the highest priority as the starting waveband; Determining the number of time slots allocated to the starting beam position based on beam bandwidth, spectrum efficiency, and user demand information of the starting beam position; Allocate consecutive time slots to the starting wave position based on the number of time slots allocated to the starting wave position; Determining an interference avoidance wave position corresponding to the starting wave position based on the wave position interference matrix; Determining the number of time slots allocated to the interference avoidance beam position based on the beam bandwidth, the spectrum efficiency, and user demand information of the interference avoidance beam position; Allocating continuous time slots to the interference avoidance beam position based on the number of time slots allocated to the interference avoidance beam position; When the time slot allocation is completed, generating the beam hopping pattern; When the time slot allocation is not completed, the interference avoidance beam position is used as a new starting beam position, and a step of determining an interference avoidance beam position corresponding to the starting beam position based on the beam position interference matrix is ​​performed.

8. A low-orbit satellite beam scheduling and resource allocation device, characterized in that: The device includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the low-orbit satellite beam scheduling and resource allocation method according to any one of claims 1 to 6.

9. A storage medium, characterized in that: The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the low-orbit satellite beam scheduling and resource allocation method according to any one of claims 1 to 6 are implemented.

Images