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

Abstract

The invention discloses a low-orbit satellite beam scheduling and resource allocation method and device, equipment and a storage medium, and relates to the technical field of communication, and the method comprises the steps: determining the time slot priority of a to-be-scheduled user; dividing to-be-scheduled users into different user groups, and determining a wave potential interference matrix between the user groups; time slot allocation is carried out based on the time slot priorities of the to-be-scheduled users and the beam position interference matrix between the user groups, and a hopping beam spectrum is generated; determining a target to-be-scheduled user corresponding to an available beam in each time slot in an updating period of the hopping beam atlas; and performing resource allocation on each time slot based on the service priority of the target to-be-scheduled user of the available beam in each time slot. Through the above mode, interference isolation and time slot allocation calculation are completed based on user priorities and user grouping, multi-user resource allocation scheduling is carried out under a single time slot, air interface resource information is fully utilized, and the spectrum utilization rate and the system throughput rate are improved to the maximum degree.

Description

Technical Field

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

[0002] At present, the scheduling design of low-orbit satellite beam hopping usually completes system initialization based on the number of satellite beams and the number of wave positions in the service area, collects user business needs through beams, designs beam lighting mode and lighting time slots based on user priority and the distance or angle interference isolation principle of beams, and finally completes power allocation and beam hopping scheduling execution. This method mainly completes beam scheduling based on user priority, and then allocates time slots and power. There is no further consideration for the scheduling of multiple users under a single beam, that is, there is no overall coordinated consideration of beam scheduling and wireless resource scheduling in low-orbit communication scenarios, and it is difficult to improve throughput and spectrum efficiency on the basis of taking into account user latency and scheduling fairness.

[0003] The above contents are only used to assist in understanding the technical solution of the present invention and do not constitute an admission that the above contents are 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 prior art 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] Perform 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 generate a beam hopping spectrum;

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

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

[0011] In one embodiment, the step of dividing the to-be-scheduled users 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 users 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 taking 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 at least includes a quality of service priority, a buffered data packet queue size, a channel condition, a user throughput rate, and a waiting time;

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

[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 wave position corresponding to the user to be scheduled based on the time slot priority of the user to be scheduled, and use the wave position with the highest priority as the starting wave position;

[0023] Determine 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 continuous time slots to the starting wave position based on the number of time slots allocated to the starting wave position;

[0025] Based on the wave position interference matrix, determining the interference avoidance wave position corresponding to the starting wave position;

[0026] Determine 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 slot allocations of 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 wave position is used as a new starting wave position, and a step of determining an interference avoidance wave position corresponding to the starting wave position is performed based on the wave position interference matrix.

[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 user to be scheduled in the user group;

[0032] Determine, based on the center distance between the wave positions of the user groups, an interference state between the wave positions of the user groups, wherein the interference state is either one of the presence of co-channel interference and 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 for the highest priority user of 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 the service priorities of other users.

[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] Acquire a service priority evaluation index, wherein the service priority evaluation index includes at least service quality priority, retransmission request information, channel state information, buffered data to be sent, and average throughput;

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

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

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

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

[0045] A time slot allocation module, used 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 spectrum;

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

[0047] The resource allocation module is further used 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 executable on the processor, and 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, 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 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 the user to be scheduled; divides the users to be scheduled into different user groups, and determines the wave position interference matrix between the user groups; allocates 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 generates a beam hopping spectrum; within the update period of the beam hopping spectrum, determines the target user to be scheduled corresponding to the available beam in each time slot; allocates 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. Based on user priority and user grouping, interference isolation and time slot allocation calculation are completed, and beam hopping pattern design is completed. Within 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 the spectrum efficiency and system throughput on the basis of taking into account user delay and scheduling fairness, and solving the technical problem that it is difficult to improve throughput and spectrum efficiency on the basis of 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 drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0054] Figure 1 This is a flow chart 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 a timing sequence of low-orbit satellite beam hopping scheduling of a low-orbit satellite beam scheduling and resource allocation method provided in Example 1 of the present application;

[0056] Figure 3 This is a flow chart 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 a low-orbit satellite beam scheduling and resource allocation method provided in Embodiment 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 brief process of a 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 purpose, 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 only used to explain the technical solutions of the present application and are not used 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 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 users 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 beams in each time slot; allocating resources to each time slot based on the service priority of the target user to be scheduled of the available beams in each time slot.

[0066] Low-orbit satellite communications generally refer to satellites with an altitude between 300-1500km and a single beam coverage range of about 100-1000km. They are equipped with multi-beam phased array antennas to obtain wide-area coverage and high-throughput communications. The service area of ​​low-orbit satellite networks is large, and the distribution of users and traffic demand is usually spatially uneven. Beam-hopping technology can use all available satellite resources to provide services for specific locations or users. By adjusting the lighting duration and cycle of the beam, different capacity values ​​are provided to balance the requirements of different beam coverage areas. In addition, beam-hopping can also place the unlit beam position as an isolation area between the same-frequency beams to reduce same-frequency interference.

[0067] The beam-hopping technology of traditional satellite communications calculates the user capacity demand based on the wave position, and allocates the beam direction and coverage time slot to the wave position within the coverage range within the unit period, thereby completing the scheduling and allocation of beam-hopping. In traditional ground 5G base stations, wireless resource scheduling is the management and allocation of air interface wireless resources, providing downlink and uplink data transmission services for terminals. The scheduling management of the base station will dynamically select which terminals can be scheduled (can send and receive data through the air interface) and how much wireless air interface resources to allocate to these terminals based on various information. The scheduling management module uses different scheduling algorithms to maximize the system throughput or maximize the user experience, and can also pursue a certain balance between the two.

[0068] However, low-orbit satellites move too fast, and the network topology changes dynamically, which requires real-time resource scheduling. Compared with high-orbit satellites, the beam coverage is relatively small, and the latency requirements for mobile users (aircraft, ships, etc.) are higher. Therefore, resource allocation needs to take into account service latency performance while improving throughput and spectrum efficiency.

[0069] The present application provides a solution to complete interference isolation and time slot allocation calculation based on user priority and user grouping, complete beam hopping pattern design, update the user list and priority sorting for each time slot in real time during each beam hopping pattern update cycle, and perform multi-user resource allocation scheduling in a single time slot, thereby maximizing the spectrum efficiency and system throughput on the basis of taking into account user delay and scheduling fairness, and solving the technical problem that it is difficult to improve throughput and spectrum efficiency on the basis of taking into account user delay and scheduling fairness.

[0070] It should be noted that the execution subject of this embodiment can be a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or an electronic device capable of realizing the above functions, a low-orbit satellite beam scheduling and resource allocation device, etc., and this embodiment does not specifically limit this. The following takes the low-orbit satellite beam scheduling and resource allocation device as an example to illustrate this embodiment and the following embodiments.

[0071] The present application embodiment provides a low-orbit satellite beam scheduling and resource allocation method, referring to 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 needs to be scheduled and resource allocated. The beam periodically scans all visible wave positions under the satellite to obtain the user to be scheduled, and at the same time, the location information and user demand information of each user to be scheduled can be obtained. The time slot priority refers to the priority of the user to be scheduled when allocating time slots. The user group is the user set obtained after the user to be scheduled is grouped. The specific number is determined according to the actual situation and is not specifically limited. According to the time slot priority of the user to be scheduled, the user to be scheduled is divided into different user groups for 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 a quality of service priority, a buffer data packet queue size, a channel condition, a user throughput rate, and a 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, including at least 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, 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 the sorted users to be scheduled. In this embodiment, the users to be scheduled are sorted from high to low according to the time slot priority to generate the user sequence.

[0082] Step S202, taking the to-be-scheduled user with the highest time slot priority in the user sequence as the central user, and determining the coverable users in the user sequence based on the position of the central user and the satellite beam radius;

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

[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 time, the central user and the corresponding covered users have been grouped and are deleted from the user sequence so as to continue to divide the next user group.

[0087] Step S204, when there are ungrouped users to be scheduled in the user sequence, execute the step of taking 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, execute 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, and generating a beam hopping spectrum.

[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 wave position, and each wave position may correspond to multiple users to be scheduled. According to the wave positions of the users to be scheduled, the wave position of each user group can be determined.

[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 the two wave positions, including two states: the presence of co-channel interference and the absence of co-channel interference. The interference state is the presence of co-channel interference, indicating that there is co-channel interference (co-channel interference) between the two wave positions, and the interference state is the absence of co-channel interference, indicating 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, i.e., a wave position interference matrix, can be generated.

[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 exists, 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 wave positions, and the interference state is no co-channel interference. Thus, the interference state between the wave positions of the user group can be determined, and then the wave position interference matrix can be generated.

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

[0094] It should be noted that the reference Figure 2 , T b Represents the smallest time scale (time slot) in the system, in T 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 priority of the wave position corresponding to the user to be scheduled based on the time slot priority of the user to be scheduled, and taking the wave position with the highest priority as the starting wave position;

[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, and the starting wave position is the wave position to which the time slot is first allocated.

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

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

[0100] Step S303, allocating continuous 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 the interference avoidance wave position corresponding to the starting wave position based on the wave position 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 among other wave positions, and the wave positions with high priority 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 bandwidth, the spectrum efficiency and the user demand information of the interference avoidance beam position;

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

[0106] Step S306, allocating continuous time slots to the interference avoidance wave position based on the number of time slot allocations of the interference avoidance wave position;

[0107] It can be understood that by calculating the number of time slots allocated to the interference avoidance wave position according to the beam bandwidth, spectrum efficiency, and user demand information, and allocating them continuously, it can be ensured to the maximum extent that the beam irradiates the wave position without jumping back and forth.

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

[0109] It should be noted that the completion of time slot allocation means that all current time slots have been allocated, and the beam hopping map can be generated, and the next step S40 is continued; the incomplete time slot allocation means 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 spectrum.

[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 period of time.

[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 spectrum;

[0113] It should be noted that the update period of the beam hopping pattern is the beam hopping pattern update period Ts. The available beams refer to the K beams that can be scheduled in the time slot. The users of each available beam in the time slot may change, and the target user to be scheduled is the real-time scheduled user of each available beam in 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: 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.

[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, cached 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, according to the service priority of the target to-be-scheduled user of the available beam in each time slot, resources are allocated to 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 the users in the beam are updated in each time slot, thereby ensuring that the newly added and switched high-priority users 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 the user to be scheduled; divides the users to be scheduled into different user groups, and determines the wave position interference matrix between the user groups; allocates 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 generates a beam hopping spectrum; within the update period of the beam hopping spectrum, determines the target user to be scheduled corresponding to the available beam in each time slot; allocates 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. Based on the user priority and user grouping, the interference isolation and time slot allocation calculation are completed, and the beam hopping pattern design is completed. In 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, so as to maximize the spectrum efficiency and system throughput on the basis of taking into account user delay 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-mentioned embodiment 1 can refer to the above introduction, and will not be repeated later. Figure 3 , step S50 may include steps S501 to S504:

[0123] Step S501, based on the service priority of the target user to be scheduled in the available beam in each time slot, determine the highest priority user in the available beam 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 6 REs constitute a minimum frequency domain allocation granularity, that is, N RB =N RE / 6, then the total available wireless time and frequency resources in one time slot are:

[0125] F=N OFDM *N RB

[0126] The wireless resources of a time slot are numbered, 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 the 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 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 proceed.

[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 to perform beam scheduling and resource allocation.

[0137] The present 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 the 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 the 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; completes interference isolation and time slot allocation calculation 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 within 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, 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 the user list, QoS information, CSI information, uplink and downlink buffer size, beam radius, interference distance and other conditions, it completes user priority sorting, user grouping, interference avoidance, time slot allocation calculation, etc. in sequence, outputs the beam hopping pattern, and then sorts the user priorities within the group in each time slot, calculates MCS and allocates RB resources, and outputs information such as user selection, MCS selection, antenna and resource mapping, and retransmission control in the scheduling process.

[0140] For example, 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: The beam periodically scans all visible positions under the satellite to obtain the user set U n , including UE location information and user demand information.

[0142] Step 2: Prioritization, for the user set U n The priority of all users in is calculated one by one, and priority weighted calculation is performed according to 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: The 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 been grouped. 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 wave position as the starting wave position. The number of time slots allocated to this wave position is calculated and continuously allocated according to the beam bandwidth, spectrum efficiency, and the needs of all users of the wave position, which guarantees that the beam irradiates the wave position without jumping back and forth. Then, according to the principle of interference avoidance, select the wave position that is lit at the same time as the starting wave position among other wave positions, that is, give priority to selecting the wave position with a distance greater than R. 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 spectrum.

[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 service priority (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 of RBs and RB positions, and determine the transmission format;

[0152] Step 12: Determine whether there are any remaining RB resources. If there are any remaining RB resources, continue to determine whether there are other users in the beam. If there are, continue to complete MCS selection and RB resource allocation according to priority.

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

[0154] Step 14: Determine whether k is less than the number of satellite schedulable beams. 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 it has not arrived, repeat 9 to 14 to complete the next time slot resource scheduling;

[0156] Step 16: If the beam hopping spectrum 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] A priority calculation module 10, used to determine the time slot priority of the user to be scheduled;

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

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

[0162] A resource allocation module 40, 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;

[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 used to sort the users to be scheduled in descending order based on the time slot priorities of the users to be scheduled 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 users 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 taking 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 implementation manner, the user grouping module 20 is further used to obtain a time slot priority evaluation index, wherein the time slot priority evaluation index at least includes a quality of service priority, a buffer data packet queue size, a channel condition, a user throughput rate, and a waiting time;

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

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

[0173] Determine, based on the center distance between the wave positions of the user groups, an interference state between the wave positions of the user groups, wherein the interference state is either one of the presence of co-channel interference and 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 used to determine the priority of the wave position corresponding to the user to be scheduled based on the time slot priority of the user to be scheduled, and use the wave position with the highest priority as the starting wave position;

[0176] Determine 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 continuous time slots to the starting wave position based on the number of time slots allocated to the starting wave position;

[0178] Based on the wave position interference matrix, determining the interference avoidance wave position corresponding to the starting wave position;

[0179] Determine 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 slot allocations of 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 wave position is used as a new starting wave position, and a step of determining an interference avoidance wave position corresponding to the starting wave position is performed based on the wave position interference matrix.

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

[0184] Allocate the corresponding number of resource blocks and resource block positions for the highest priority user of 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 the service priorities of other users.

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

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

[0189] The low-orbit satellite beam scheduling and resource allocation device provided by the present application adopts the low-orbit satellite beam scheduling and resource allocation method in the above embodiment, which can solve the technical problem that it is difficult to improve throughput and spectrum efficiency on the basis of taking into account user delay and scheduling fairness. Compared with the prior art, the beneficial effects of the low-orbit satellite beam scheduling and resource allocation device provided by the present application are the same as the beneficial effects of the low-orbit satellite beam scheduling and resource allocation method provided by the above embodiment, and other technical features in the low-orbit satellite beam scheduling and resource allocation device are the same as the features disclosed in the above embodiment method, which will not be repeated 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 diagram of the structure of a low-orbit satellite beam scheduling and resource allocation device suitable for implementing the 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, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 8 The low-orbit satellite beam scheduling and resource allocation device shown is merely 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 (such as a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. In RAM1004, various programs and data required for the operation of the low-orbit satellite beam scheduling and resource allocation device are also stored. The processing device 1001, ROM1002 and RAM1004 are connected to each other through 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: an input device 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 may allow the low-orbit satellite beam scheduling and resource allocation device to communicate wirelessly or wired with other devices to exchange data. Although the figure shows a low-orbit satellite beam scheduling and resource allocation device with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems may be implemented or have instead.

[0193] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a 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 through 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 by the present application adopts the low-orbit satellite beam scheduling and resource allocation method in the above embodiment, which can solve the technical problem that it is difficult to improve throughput and spectrum efficiency on the basis of taking into account user delay and scheduling fairness. Compared with the prior art, the beneficial effects of the low-orbit satellite beam scheduling and resource allocation device provided by the present application are the same as the beneficial effects of the low-orbit satellite beam scheduling and resource allocation method provided by the above embodiment, and the other technical features in the low-orbit satellite beam scheduling and resource allocation device are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.

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

[0196] The above are only specific implementations of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0197] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) 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 the present 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 of the above. 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 of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination 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 of the above.

[0199] The above-mentioned computer-readable storage medium may be included in the low-orbit satellite beam scheduling and resource allocation device; or 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: determines the time slot priority of the user to be scheduled; divides the users to be scheduled into different user groups, and determines the wave position interference matrix between the user groups; allocates 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 generates a beam hopping spectrum; within the update period of the beam hopping spectrum, determines the target user to be scheduled corresponding to the available beam in each time slot; and allocates resources to each time slot based on the service priority of the target user to be scheduled of 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 separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of 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., via the Internet using an Internet service provider).

[0202] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the 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 square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square 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 square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0203] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0204] The readable storage medium provided by the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned low-orbit satellite beam scheduling and resource allocation method, and can solve the technical problem of difficulty in improving throughput and spectrum efficiency on the basis of taking into account user delay and scheduling fairness. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the present application are the same as the beneficial effects of the low-orbit satellite beam scheduling and resource allocation method provided by the above-mentioned embodiment, and will not be repeated here.

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

[0206] The computer program product provided by the present application can solve the technical problem that it is difficult to improve throughput and spectrum efficiency on the basis of taking into account user delay and scheduling fairness. Compared with the prior art, the beneficial effects of the computer program product provided by the present application are the same as the beneficial effects of the low-orbit satellite beam scheduling and resource allocation method provided by the above embodiment, which will not be repeated 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 changes 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; Perform 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 generate a beam hopping spectrum; Determining, within an update period of the beam hopping spectrum, a target user to be scheduled corresponding to an available beam in each time slot; Based on the service priority of the target user to be scheduled in the available beams in each time slot, resources are allocated to each time slot.

2. The method according to claim 1, characterized in that The step of dividing the users to be scheduled into different user groups comprises: 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; 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 users 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 taking 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 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, characterized in that 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 at least includes a quality of service priority, a buffer data packet queue size, a channel condition, a user throughput rate, and a waiting time; Based on the time slot priority evaluation index and the weight corresponding to the time slot priority evaluation index, the time slot priority of the user to be scheduled is calculated.

4. The method according to claim 1, characterized in that 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 comprises: Based on the time slot priority of the user to be scheduled, determine the priority of the corresponding wave position of the user to be scheduled, and use the wave position with the highest priority as the starting wave position; Determine the number of time slots allocated to the starting beam position based on the beam bandwidth, spectrum efficiency and user demand information of the starting beam position; Allocate continuous time slots to the starting wave position based on the number of time slots allocated to the starting wave position; Based on the wave position interference matrix, determining the interference avoidance wave position corresponding to the starting wave position; Determine 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 slot allocations of 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 wave position is used as a new starting wave position, and a step of determining an interference avoidance wave position corresponding to the starting wave position is performed based on the wave position interference matrix.

5. The method according to claim 3, characterized in that 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 user to be scheduled in the user group; Determine, based on the center distance between the wave positions of the user groups, an interference state between the wave positions of the user groups, wherein the interference state is either one of the presence of co-channel interference and 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.

6. The method according to claim 1, characterized in that 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 comprises: 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 for the highest priority user of 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 the service priorities of other users.

7. The method according to any one of claims 1 to 6, 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: Acquire a service priority evaluation index, wherein the service priority evaluation index includes at least service quality priority, retransmission request information, channel state 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, the service priority of the target user to be scheduled is calculated.

8. A low-orbit satellite beam scheduling and resource allocation device, characterized in that: The device comprises: A priority calculation module, used to determine the time slot priority of the user to be scheduled; A user grouping module, used to divide the to-be-scheduled users into different user groups and determine the wave position interference matrix between the user groups; A time slot allocation module, used 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 spectrum; A resource allocation module, used to determine the target to-be-scheduled user corresponding to the available beam in each time slot within the update period of the beam hopping spectrum; The resource allocation module is further used 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.

9. A low-orbit satellite beam scheduling and resource allocation device, characterized in that: The device comprises: 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 as described in any one of claims 1 to 7.

10. 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 as described in any one of claims 1 to 7 are implemented.

Images