Resource scheduling method, system and computer readable storage medium

Abstract

The present application relates to a kind of resource scheduling methods, comprising: step S1: in response to the scheduling demand of k terminal UEs waiting for scheduling in current moment, respectively determine the number of high interference RB, middle interference RB and low interference RB and floor noise in current moment;Step S2: whether all using low interference RB can satisfy the scheduling demand of the k UEs is judged, if the judgment result is yes, then low interference RB scheduling is carried out, if the judgment result is no, then step S3 is executed;Step S3: whether using low interference RB and middle interference RB can satisfy the scheduling demand of the k UEs is judged, if the judgment result is yes, then low interference RB and middle interference RB scheduling is carried out, if the judgment result is no, then step S4 is executed;Step S4: high interference RB, middle interference RB and low interference RB scheduling are executed.The present application also relates to a kind of resource scheduling systems and computer readable storage medium.Through the method, system and computer readable storage medium of the present application, the influence of interference on user experience can be reduced.

Description

Technical Field

[0001] This invention relates to a resource scheduling method, a resource scheduling system, and a computer-readable storage medium. Background Technology

[0002] The performance of wireless communication networks is directly related to the interference of transmission frequency bands. When the interference of the frequency bands in which wireless networks are deployed exceeds a certain threshold, it will directly affect the network transmission quality, causing a decrease in transmission rate, an increase in bit error rate, and ultimately affecting the user experience.

[0003] Interference in wireless communication systems typically includes intra-system interference and inter-system interference. Intra-system interference includes intra-cell interference and inter-cell interference. Intra-cell interference is caused by other users interfering with the current user, while inter-cell interference is caused by neighboring cells interfering with the current cell. Inter-system interference refers to interference problems occurring between different frequency systems, including three main types: out-of-band spurious interference, intermodulation interference, and blocking interference. When the power of the interfering signal is high, it reduces the receiver sensitivity and may even prevent the effective signal from being received.

[0004] Especially for networks with complex spectrum planning, such as those using low-frequency resources, existing low-frequency resources are already used for 2G, 3G, 4G networks and IoT private networks (such as parking systems), and some even have self-built repeaters. Therefore, NR or LTE networks are more susceptible to interference from other systems. On the other hand, interference from other systems may be concentrated in a certain time period or a certain spectrum segment. For example, in a certain local network, the L900 system experiences significant interference during the day and less interference at night. Another example is a city's L900 system with 52 RB resources, where only 10 RB resources experience significant narrowband interference from other systems.

[0005] In the current uplink resource scheduling scheme, the average signal-to-interference-plus-noise ratio (SINR) is calculated based on the entire uplink bandwidth. A modulation and coding scheme (MCS) index value is selected based on the average SINR, and then resource blocks (RBs) are searched for and scheduled across the entire frequency band. The presence of narrowband interference leads to two problems: firstly, it causes the overall SINR value to be calculated too low, resulting in a lower overall SINR; secondly, scheduling the terminal to high-interference resources increases the bit error rate, reduces the data rate, and negatively impacts the user experience. Summary of the Invention

[0006] The purpose of this invention is to propose a resource scheduling method that minimizes narrowband interference during the scheduling process, or allocates narrowband interference frequency bands to nearby terminals, thereby reducing the impact of interference on user experience. Furthermore, this invention also aims to provide a corresponding resource scheduling system and a computer-readable storage medium.

[0007] According to a first aspect of the present invention, a resource scheduling method is proposed, comprising:

[0008] Step S1: In response to the scheduling requests of the k terminal UEs waiting to be scheduled at the current time, determine the number and noise floor of the high interference RB, medium interference RB and low interference RB at the current time respectively, where the total number of RBs is N, the number of high interference RBs at the current time is Nh, the number of medium interference RBs is Nm, and the number of low interference RBs is Nl.

[0009] Step S2: Determine whether using all low-interference RBs can meet the scheduling requirements of the k UEs. If the determination result is yes, then perform low-interference RB scheduling. If the determination result is no, then proceed to step S3.

[0010] Step S3: Determine whether the low-interference RB and medium-interference RB can meet the scheduling requirements of the k UEs. If the determination result is yes, then perform low-interference RB and medium-interference RB scheduling. If the determination result is no, then proceed to step S4.

[0011] Step S4: Perform high-interference RB, medium-interference RB, and low-interference RB scheduling.

[0012] The resource scheduling method of this invention is applicable to 4G and NR systems. Using this method, when the number of low-interference RBs meets the demand, only low-interference RBs are scheduled; when the number of low-interference RBs does not meet the demand, medium-interference RBs are scheduled; and if the total number of low-interference and medium-interference RBs is insufficient, high-interference RBs are scheduled. This invention classifies RBs into high-interference, medium-interference, and low-interference RBs based on their noise floor, and performs resource scheduling based on the interference characteristics of the current time period, prioritizing resources with lower interference to optimize user experience.

[0013] According to one embodiment of the present invention, step S2 includes: step S21: calculating the total number nl of low-interference RBs required for scheduling the k terminal UEs; step S22: determining whether the following formula holds true: nl≤Nl. If true, the result of step S2 is yes; if not true, the result of step S2 is no. Thus, it is determined whether the current number of low-interference RBs Nl can meet the total scheduling requirements of the k terminals. If it does, only low-interference RBs are scheduled.

[0014] According to one embodiment of the present invention, step S3 includes: step S31: for the k terminal UEs, calculate the medium interference scheduling coefficient Imi for each UEi; step S32: if Imi > C, then select terminal UEi into the medium interference scheduling queue, where C is the threshold, and sort the UEs in the medium interference scheduling queue from high to low according to Im; step S33: evaluate whether there is a scheme that uses medium interference RB scheduling for the scheduling needs of the first q terminal UEi (1≤i≤q) in the medium interference scheduling queue, and uses low interference RB scheduling for the scheduling needs of the remaining terminal UEi (q≤i≤k). If it exists, the judgment result of step S3 is yes; if it does not exist, the judgment result of step S3 is no.

[0015] Terminals not selected for the medium interference scheduling queue can only use low interference RBs, while terminals in the medium interference scheduling queue can use both low interference RBs and medium interference RBs. Based on this, it is determined whether using low interference RBs and medium interference RBs can meet the scheduling requirements.

[0016] According to one embodiment of the present invention, step S33 includes: Step S331: Selecting the first j terminals in the medium interference scheduling queue, performing medium interference RB scheduling on the j terminals and calculating the total number of RBs nm required for medium interference RB scheduling; Step S332: Performing low interference RB scheduling on the remaining terminals UEi (j≤i≤k) and calculating the total number of RBs nl required for low interference RB scheduling; Step S333: Determining whether the following conditions are simultaneously satisfied: nl≤Nl and nm≤(N-Nh-n1). If all conditions are satisfied, then q=j, medium interference RB scheduling is used for the j terminals, and low interference RB scheduling is used for the remaining terminals. If nm≤(N-Nh-n1) is not satisfied, then proceed to step S4. If nl≤Nl is not satisfied, but nm≤(N-Nh-n1) is satisfied, then increase j in steps and repeat steps S331 to S333 until the above two conditions are met or all terminals in the medium interference scheduling queue are scheduled for medium interference RB. If all terminals in the medium interference scheduling queue are scheduled for medium interference RB and nl≤Nl is still not satisfied, then select the highest priority r1 terminals among the terminals scheduled for low interference RB to fill the low interference RB. The remaining terminals scheduled for low interference RB are included in the next scheduling cycle and are not scheduled for high interference RB.

[0017] In this way, the number of terminals undergoing scheduled interference RBs can be gradually increased in a step-by-step manner. This ensures that, given feasible scheduling schemes, more terminals utilize low-interference RBs and fewer terminals utilize medium-interference RBs, prioritizing high-interference RBs for nearby and low-priority users, thus determining the optimal scheduling scheme. If all terminals in the medium-interference scheduling queue undergo medium-interference RB scheduling, but low-interference resources are still insufficient, low-interference terminals that cannot be scheduled will wait for the next scheduling cycle.

[0018] According to one embodiment of the present invention, step S4 includes: Step S41: For the k terminal UEs, calculate the high interference scheduling coefficient Ihi for each UEi. If Ihi > C', then select terminal UEi into the high interference scheduling queue, where C' is a threshold, and sort the UEs in the high interference scheduling queue from high to low according to Ih; Step S42: For terminals not selected into the high interference scheduling queue, calculate the medium interference scheduling coefficient Imi for each UEi. If Imi > C, then select terminal UEi into the medium interference scheduling queue, where C is a threshold, and sort the UEs in the medium interference scheduling queue from high to low according to Im; Step S43: Select the first j' terminals in the high interference scheduling queue, and perform high interference RB scheduling on the j' terminals and calculate the total number of RBs nh required for high interference RB scheduling. Select the first j terminals in the medium interference scheduling queue, and perform medium interference RB scheduling on the j terminals and calculate the total number of RBs nm required for medium interference RB scheduling. Perform low interference RB scheduling on the remaining terminals and calculate the total number of RBs nl required for low interference RB scheduling. Step S44: Adjust j' and j, and occupy resources in the order of low interference RB, medium interference RB, and high interference RB. Terminals that cannot be scheduled are included in the next scheduling cycle.

[0019] Terminals not selected for the medium-interference and high-interference scheduling queues can only use the low-interference RB. Terminals in the medium-interference scheduling queue can use both low-interference and medium-interference RBs, while terminals in the high-interference scheduling queue can use all three types of RBs. The scheduling scheme is determined based on this.

[0020] According to one embodiment of the present invention, after step S43, it is determined whether nl≤Nl, nm≤N-Nh-n1, and nh≤N-nm-n1 are simultaneously satisfied. If satisfied, the scheduling scheme is feasible; otherwise, step S44 is continued. In this embodiment, j' and j can be selected based on empirical values. If the scheduling scheme is feasible, the scheduling scheme can be directly determined without adjustment.

[0021] According to one embodiment of the present invention, step S44 includes: Step S441: Determine whether nl≤Nl is satisfied. If not, increase the number of terminals to be scheduled for medium interference RB in a stepwise manner, while keeping the number of terminals to be scheduled for high interference RB unchanged. The added terminals can be selected from the high interference scheduling queue first, and then from the medium interference scheduling queue in a forward-to-back manner, until nl≤Nl is satisfied or there are no more terminals in the medium interference scheduling queue and the high interference scheduling queue to be scheduled for low interference RB. If nl≤Nl is still not satisfied, select the r1 terminals with the highest priority among the terminals to be scheduled for low interference RB to occupy If the low-interference RB is full, the remaining terminals to be scheduled for low-interference RB are included in the next scheduling cycle; Step S442: Determine whether nm≤N-Nh-n1 is satisfied. If not, increase the number of terminals to be scheduled for high-interference RB in steps until nm≤N-Nh-n1 or nh>Nh or all terminals in the high-interference scheduling queue are scheduled for high-interference RB. If nm≤N-Nh-n1 is still not satisfied, select the r2 terminals with the highest priority among the terminals to be scheduled for medium-interference RB to fill the medium-interference RB, and include the remaining terminals to be scheduled for medium-interference RB in the next scheduling cycle.

[0022] In this way, the number of terminals scheduled for interference RBs and high-interference RBs can be gradually increased in a step-by-step manner. Therefore, when feasible scheduling schemes exist, the goal is to maximize the use of low-interference RBs by more terminals and low-interference RBs by fewer terminals, prioritizing the allocation of high-interference RBs to nearby users and low-priority users, thus determining the optimal scheduling scheme. In cases of resource shortage, terminals unable to obtain scheduling will wait for the next scheduling cycle.

[0023] According to one embodiment of the present invention, the number of low-interference RBs (RBs) required for low-interference RB scheduling, nRBli, is calculated for each terminal UEi as follows: The uplink SINRl of each low-interference RB is calculated using the following formula: SINRli = Pli / noisel. Where Pli = psrsi × (ns / nsrs), psrsi is the uplink reference signal received by the base station for the UEi, ns is the number of symbols contained in one RB, nsrs is the number of symbols occupied by the uplink reference signal, and noisel is the average noise floor of Nl low-interference RBs. The MCS is determined based on SINRli, and the TBS required by the UEi is determined based on the service type and BSR requirements of the UEi, thereby calculating nRBli.

[0024] According to one embodiment of the present invention, for each terminal UEi, the number of RBs (Reference Blocks) required for interference RB scheduling, nRBmi, is calculated as follows: The SINRm of the interference RBs for each terminal UEi is calculated according to the following formula: SINRmi = Pmi / noisem. Where Pmi = psrsm × (ns / nsrs), psrsm is the uplink reference signal received by the base station for the UEi, ns is the number of symbols contained in one RB, nsrs is the number of symbols occupied by the uplink reference signal, and noisem is the average noise floor of Nm interference RBs. Based on SINRmi, the MCS (Multi-Segment Classification) is determined, and based on the service type and BSR (Browser Service Response) requirements of the terminal UEi, the TBS (Traffic Base Station) required by the terminal UEi is determined, thereby calculating nRBmi.

[0025] According to one embodiment of the present invention, the number of high-interference RBs, nRBhi, required for scheduling high-interference RBs for each terminal UEi is calculated as follows: SINRhi is calculated for each terminal UEi using the following formula: SINRhi = Phi / noiseh. Where Phi = psrsh

[0026] ×(ns / nsrs), psrsh is the uplink reference signal received by the base station for UEi, ns is the number of symbols contained in one RB, nsrs is the number of symbols occupied by the uplink reference signal, and noiseh is the average noise floor of Nh high-interference RBs. Based on SINRhi, the MCS is determined; based on the service type and BSR requirements of the terminal UEi, the TBS required by the terminal UEi is determined, thereby calculating nRBhi.

[0027] According to one embodiment of the present invention, the interference scheduling coefficient Imi of terminal UEi

[0028] The following formula is used to calculate Imi: Imi = a × IPHi + b × IRSRPi + c × IQCIi. Where IPHi is the power margin identifier, IRSRPi is the RSRP identifier, IQCIi is the QoS level identifier, and a, b, and c are weighting coefficients.

[0029] According to one embodiment of the present invention, the high interference scheduling coefficient Ihi of terminal UEi is calculated according to the following formula: Ihi=(a'×IPHi+b'×IRSRPi+c'×IQCIi)×

[0030] Ilasti. Where IPHi is the power margin identifier, IRSRPi is the RSRP identifier, IQCIi is the QoS level identifier, a', b', and c' are weighting coefficients, and Ilasti is an identifier indicating whether the previous scheduling period was a high-interference RB scheduling.

[0031] According to a second aspect of the present invention, a resource scheduling system is provided, comprising multiple RBs and multiple UEs, and a scheduling module, wherein the scheduling module is capable of receiving scheduling requests from the UEs and executing the aforementioned resource scheduling method.

[0032] According to a third aspect of the present invention, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions that, when executed by a processor, implement the aforementioned resource scheduling method. Attached Figure Description

[0033] The accompanying drawings are provided to further understand the technical solutions of the present invention and constitute a part of the specification. They are used together with the embodiments of the present invention to explain the technical solutions of the present invention, and do not constitute a limitation on the technical solutions of the present invention.

[0034] Figure 1 A flowchart of an embodiment of the resource scheduling method of the present invention is shown;

[0035] Figure 2 An embodiment of the resource scheduling system of the present invention is shown;

[0036] Figure 3 An embodiment of the computer-readable storage medium of the present invention is shown. Detailed Implementation

[0037] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the specific implementation methods of the present invention will be described in detail below with reference to the accompanying drawings. It should be understood that the specific implementation methods described herein are for illustration and explanation only and are not intended to limit the present invention.

[0038] Figure 1 A schematic diagram of an embodiment of the resource scheduling method of the present invention is shown. The resource scheduling method includes:

[0039] Step S1: In response to the scheduling requests of the k terminal UEs waiting to be scheduled at the current time, determine the number and noise floor of the high interference RB, medium interference RB and low interference RB at the current time respectively, where the total number of RBs is N, the number of high interference RBs at the current time is Nh, the number of medium interference RBs is Nm, and the number of low interference RBs is Nl.

[0040] Step S2: Determine whether using all low-interference RBs can meet the scheduling requirements of the k UEs. If the determination result is yes, then perform low-interference RB scheduling. If the determination result is no, then proceed to step S3.

[0041] Step S3: Determine whether the low-interference RB and medium-interference RB can meet the scheduling requirements of the k UEs. If the determination result is yes, then perform low-interference RB and medium-interference RB scheduling. If the determination result is no, then proceed to step S4.

[0042] Step S4: Perform high-interference RB, medium-interference RB, and low-interference RB scheduling.

[0043] Before step S1, the number and / or noise floor of low-interference RBs, medium-interference RBs, and high-interference RBs in different time periods can be counted. Each day can be divided into different time periods based on interference patterns (especially cell uplink), i.e., time period 1, time period 2, ..., time period n. The interference distribution patterns differ across time periods. For example, if the system uses N RBs, time period 1 contains only low-interference RBs, meaning all RBs in time period 1 are low-interference RBs; in time period 2, RB1-RBx1 and RBx2-RBn are low-interference RBs, and RBx1-RBx2 are high-interference RBs; in time period 3, RB1-RBx3 are medium-interference RBs, RBx4-RBx5 are high-interference RBs, and RBx3-RBx4 and RBx5-RBn are low-interference RBs.

[0044] The definitions of high, medium, and low interference RBs are as follows: if the noise floor of an RB is less than or equal to A (dBm), then the RB is a low interference RB; if the noise floor of an RB is greater than B (dBm), then the RB is a high interference RB; if the noise floor of an RB is between A and B (dBm), then the RB is a medium interference RB. The thresholds A and B can be preset.

[0045] In step S1, when performing resource scheduling, especially uplink resource scheduling, the number of high, medium, and low interference RBs at the current time is first determined, and the noise floor of each high, medium, and low interference RB is determined respectively. The noise floor (noiseh) of the high interference RBs can be the average noise floor of the Nh RBs listed as high interference; the noise floor (noisem) of the medium interference RBs can be the average noise floor of the Nm RBs listed as medium interference; and the noise floor (noisel) of the low interference RBs can be the average noise floor of the Nl RBs listed as low interference. These quantities and / or noise floors can be determined based on the above statistics.

[0046] In step S2, the feasibility of using low-interference resource scheduling for all is evaluated. According to one implementation scheme, step S2 includes: step S21: for the k terminal UEs, calculate the total number nl of RBs required for low-interference RB scheduling; step S22: determine whether the following formula holds true: nl≤Nl. If it holds true, the result of step S2 is yes; if it does not hold true, the result of step S2 is no.

[0047] The total number of RBs nl required for low-interference RB scheduling can be calculated as follows: For the terminals UE1, UE2...UEk waiting for scheduling at the current time, the system determines the uplink SINR of each UE based on the uplink reference signal strength (such as SRS) and the noise floor noisel of the low-interference RB according to the following formula. If low-interference RB scheduling is adopted, the uplink SINR of each UE is: SINRli=Pli / noisel.

[0048] Where Pli is the received signal strength per RB converted based on the uplink reference signal strength of UEi received by the base station, Pli = psrsl × (ns / nsrs), ns is the number of symbols contained in an RB, and nsrs is the number of symbols occupied by the uplink reference signal. For example, if the unit of the reference signal is 1 symbol and each RB has 7 symbols, then Pli = psrsl × 7, where psrsl is the uplink reference signal of UEi received by the base station.

[0049] The system determines the MCS for terminal scheduling based on SINRli, and determines the TBS required by the terminal based on the UEi service type and BSR (uplink buffer data) requirements, thereby calculating the number of low-interference resources nRBli required by the UEi.

[0050] Following the above method, the system calculates SINRli for each terminal using low-interference RB scheduling, and determines the number of resources nRBli required for each UE. The total number of RBs required for low-interference RB scheduling is nl = ∑nRBli.

[0051] We determine whether low-interference resources can meet the requirements by checking if the following formula holds true: nl ≤ Nl. If the formula holds true, low-interference RBs are scheduled, and medium-interference and high-interference RBs are not used. If the formula does not hold true, we continue to check whether the system can meet the business requirements by using low-interference and medium-interference RBs.

[0052] In the latter case, step S3 assesses whether low-interference and medium-interference resource scheduling is feasible. In one implementation, step S3 may include: Step S31: For the k terminal UEs, calculate the medium-interference scheduling coefficient Imi for each UEi; Step S32: If Imi > C, select terminal UEi into the medium-interference scheduling queue, where C is the threshold, and sort the UEs in the medium-interference scheduling queue from high to low according to Im; Step S33: Assess whether there exists a scheme where the scheduling needs of the first q terminal UEi (1≤i≤q) in the medium-interference scheduling queue are scheduled using medium-interference RB scheduling, and the scheduling needs of the remaining terminal UEi (q≤i≤k) are scheduled using low-interference RB scheduling. If such a scheme exists, the result of step S3 is yes; if not, the result of step S3 is no.

[0053] In step S31, the interference scheduling coefficient Im of the terminal with resource scheduling needs can be calculated as follows, taking UEi as an example: Imi=a×IPHi+b×IRSRPi+c×IQCIi.

[0054] IPHi is a power margin indicator, set based on the power margin reported by the terminal. A higher power margin results in a larger IPHi value, while a value of 0 is set to 0 when the power margin is below a threshold. For example, if the power margin is below y1, IPHi = 0; if the power margin is y1-y2, IPHi = 1; if the power margin is y2-y3, IPHi = 2, and so on. The purpose of setting the power margin is to prioritize the scheduling of medium- and high-interference resources for terminals with large power margins, as these terminals can increase their power through power control, thereby improving the signal-to-noise ratio and ensuring a better user experience.

[0055] Here, IRSRPi is the RSRP identifier, which is set based on the reference signal quality measured by the terminal. The higher the received RSRP, the closer the UE is considered to be to the base station, and the less interference the increased power will cause to other cells, so the IRSRP value is higher. For example, if the RSRP is less than -110dBm, IRSRPi = 1; if the RSRP is between -85dBm and -110dBm, IRSRPi = 2; and if the RSRP is greater than -85dBm, IRSRPi = 3.

[0056] Here, IQCI is a QoS level identifier, which is set based on QCI or 5QI levels. The higher the terminal service priority, the lower the IQCI, meaning that lower priority terminals are preferentially selected for interference RB scheduling. For example, if QCI=9, then IQCI=9, and so on; if QCI=1, then IQCI=1.

[0057] Where a, b, and c are weighting coefficients used to adjust the weights of power margin, downlink signal strength, and QCI in the Im value calculation. For example, a = b × IRSRPmax + c × IQCImax, b = c × IQCImax, c = 1, where IRSRPmax is the maximum value that IRSRP can reach, and IQCImax is the maximum value that IQCI can reach. The example selection of a, b, and c indicates that power margin has the highest weight. Regardless of other parameters, for two terminals, a higher power margin coefficient results in a higher Im value. When power margins are the same, the terminal with the larger IRSRP value has a higher Im value.

[0058] In step S32, the system can sort the interference scheduling coefficients Im of all terminals with resource scheduling needs from high to low.

[0059] If Imi > C, then terminal UEi enters the medium interference scheduling queue. Here, C is a threshold; for example, C can be 'a', meaning that only when Imi is greater than 0 will the terminal enter the medium interference scheduling queue. After filtering the medium interference scheduling queue, the terminals are sorted from highest to lowest according to Im, and the number of terminals in the queue is denoted as Lm.

[0060] In step S33, an exemplary method for evaluating medium- and low-interference resource scheduling schemes is as follows:

[0061] Step S331: Select the first j terminals in the interference scheduling queue, and perform interference RB scheduling on these j terminals, calculating the total number of RBs nm required for interference RB scheduling. For each terminal UEi, the number of RBs nRBmi required for interference RB scheduling can be calculated as follows:

[0062] First, calculate the SINRm of the interference RB in each terminal: SINRmi = Pmi / noisem.

[0063] Wherein, Pmi is the received signal strength per RB converted based on the uplink reference signal strength of UEi received by the base station, Pmi = psrsm × (ns / nsrs), ns is the number of symbols contained in an RB, and nsrs is the number of symbols occupied by the uplink reference signal. For example, if the unit of the reference signal is 1 symbol and each RB has 7 symbols, then Pmi = psrsm × 7, where psrsm is the uplink reference signal of UEi received by the base station.

[0064] Then, the system determines the MCS of j terminals to be scheduled using medium-interference RB based on SINRmi, and determines the TBS required by the terminal based on the UEi service type and BSR (uplink buffer data) requirements, thereby calculating the number of resources nRBmi required for each UEi. The total number of RBs required for medium-interference RB scheduling nm = nRBm1 + nRBm2 + ... + nRBmj, that is, the number of resources required by the j terminals to be scheduled using medium-interference RB is added together.

[0065] Step S332: For the remaining terminals UEi (j≤i≤k), low-interference RB scheduling is proposed, and the total number of RBs nl required for low-interference RB scheduling is calculated. The system proposes to use low-interference RB scheduling for the other kj terminals (the total number of terminals with scheduling needs in this scheduling period is k). Based on the SINRli calculation method for low-interference resource scheduling described above, the MCS can be determined. Combined with the service type and BSR (uplink buffer data) requirements, the required TBS for each terminal can be determined, thereby calculating the required resource quantity nRBli for each terminal. The total number of RBs required for low-interference RB scheduling is calculated as: nl = nRBl(j+1) + nRBl(j+2) + ... + nRBlk, which is the sum of the resource quantities required by the kj terminals proposed for low-interference RB scheduling.

[0066] Then, in step S333, it can be determined whether the following conditions are met simultaneously: nl≤Nl and nm≤(N-Nh-n1).

[0067] If all conditions are met, the above-mentioned medium-interference and low-interference resource scheduling schemes are valid. The j terminals are then scheduled using medium-interference RBs, and the remaining terminals are scheduled using low-interference RBs. If nm ≤ (N - Nh - n1) is not met, the full resource scheduling scheme (i.e., simultaneously scheduling high, medium, and low-interference resources) is entered, and step S4 is executed.

[0068] If nl≤Nl is not satisfied, but nm≤(N-Nh-n1) is satisfied, then j is increased in steps, and the above steps are repeated until both conditions are met or all terminals in the medium interference scheduling queue are intended for medium interference RB scheduling. Specifically, the first j+δ terminals in the medium interference scheduling queue are reselected for medium interference resource scheduling. According to steps S331 to S333, it is determined whether the conditions are met. If they are met, the medium interference and low interference resource scheduling schemes are established, and medium interference resource scheduling is applied to j+δ terminals according to the scheme, while low interference resource scheduling is applied to other terminals. If nm≤(N-Nh-n1) is not satisfied, then the full resource scheduling scheme is entered; if nl≤Nl is not satisfied, the first j+2δ terminals in the medium interference scheduling candidate terminal queue are selected for medium interference resource scheduling. The judgment method is the same as above, and so on, until the number of medium interference scheduling terminals that meet the scheduling requirements is found to be j+δ×s. Where j is the number of terminals initially selected, which can be 1, 2, etc., preferably 1. δ is the adjustment step size, which can be 1 for example. s is a natural number.

[0069] If at any step j+δ×s is greater than or equal to the number of terminals Lm in the medium interference scheduling queue, it means that all terminals in the medium interference scheduling queue are intended for medium interference RB scheduling, and the repetition stops. If nm≤(N-Nh-n1) is not satisfied, it is determined that the evaluation method for medium and low interference resource scheduling schemes is not feasible, and the full resource scheduling scheme is entered, and step S4 is executed. If nl≤Nl is still not satisfied, but nm≤(N-Nh-n1) is satisfied, it means that low interference scheduling resources are insufficient, so the highest priority r1 terminals among the terminals intended for low interference RB scheduling are selected to fill the low interference RB, and the remaining terminals intended for low interference RB scheduling are included in the next scheduling cycle, and high interference RB scheduling is not performed.

[0070] After the above process, when it is determined that step S4 needs to be executed for full resource scheduling, all system resources, including high interference, medium interference and low interference RBs, will participate in the scheduling.

[0071] In one implementation, step S4 determines the scheduling scheme as described below.

[0072] First, in step S41, for the k terminal UEs, the high interference scheduling coefficient Ihi for each UEi is calculated. If Ihi > C', then the terminal UEi is selected into the high interference scheduling queue, where C' is the threshold. The UEs in the high interference scheduling queue are sorted from high to low according to Ih.

[0073] Taking UEi as an example, the high interference scheduling coefficient Ih can be calculated according to the following formula: Ihi=(a'×IPHi+b'×IRSRPi+c'×IQCIi)×Ilasti.

[0074] Here, a', b', and c' are weighting coefficients used to adjust the weights of power margin, downlink signal strength, and QCI in the Ih value calculation. For example, compared to the weights a, b, and c in the Im calculation process, c' can be larger, thus increasing the weight of service priority in the Ih calculation and prioritizing the scheduling of high-interference resources for low-priority users. Ilasti is an indicator of whether the previous scheduling period involved high-interference resource scheduling. If the terminal was scheduled for high-interference RB in the previous scheduling period, then Ilasti = 0; otherwise, Ilasti = 1. Setting Ilasti is to avoid frequent high-interference scheduling of a terminal. If the terminal used high-interference scheduling in the previous scheduling period, then Ilasti = 0 in this scheduling period, making Ih = 0, and the terminal will not enter the high-interference scheduling queue.

[0075] After filtering the high-interference scheduling queue, the terminals are sorted from highest to lowest according to their high-interference scheduling coefficient (Ih), and the number of terminals in the queue is denoted as Lh. Alternatively, or supplementarily, all terminals with resource scheduling needs can be sorted from highest to lowest according to their high-interference scheduling coefficient (Ih) before filtering.

[0076] Then, in step S42, for terminals not selected into the high interference scheduling queue, the medium interference scheduling coefficient Imi is calculated for each UEi. If Imi > C, then terminal UEi is selected into the medium interference scheduling queue, where C is the threshold. The UEs in the medium interference scheduling queue are sorted from high to low according to Im. The medium interference scheduling coefficient Imi can be calculated in the manner described above.

[0077] In step S43, the first j' terminals of the high-interference scheduling queue are selected, and high-interference RB scheduling is planned for these j' terminals, calculating the total number of RBs nh required for high-interference RB scheduling. The first j terminals of the medium-interference scheduling queue are selected, and medium-interference RB scheduling is planned for these j terminals, calculating the total number of RBs nm required for medium-interference RB scheduling. For the remaining terminals, low-interference RB scheduling is planned, calculating the total number of RBs nl required for low-interference RB scheduling. These required total number of RBs can be calculated as described above.

[0078] At this point, it can be determined whether nl≤Nl, nm≤N-Nh-n1, and nh≤N-nm-n1 are simultaneously satisfied. If they are satisfied, the scheduling scheme is feasible; otherwise, step S44 is continued. In this embodiment, initial values ​​j and j' can be selected based on experience.

[0079] In step S44, j' and j are adjusted to occupy resources in the order of low interference RB, medium interference RB, and high interference RB. Terminals that cannot be scheduled are included in the next scheduling cycle.

[0080] In one implementation, the initial values ​​j and j' can preferably be set to 1.

[0081] Step S44 may include:

[0082] Step S441: Determine whether nl≤Nl is satisfied. If not, increase the number of terminals to be scheduled for medium interference RB in a step manner, while keeping the number of terminals to be scheduled for high interference RB unchanged, until nl≤Nl is satisfied or there are no more terminals in the medium interference scheduling queue and the high interference scheduling queue to be scheduled for low interference RB.

[0083] Specifically, if nl ≤ Nl is not satisfied, j + δ terminals are selected for medium-interference resource scheduling. Terminals proposed for medium-interference scheduling are removed from the low-interference scheduling queue, while the number of terminals for high-interference RB scheduling remains unchanged. The additional δ terminals are preferably selected first from the high-interference scheduling queue, then from the medium-interference scheduling queue, proceeding sequentially. It is then checked whether nl ≤ Nl is satisfied. If not, j + 2δ terminals are selected for medium-interference resource scheduling. Terminals proposed for medium-interference scheduling are removed from the low-interference scheduling queue, while the number of terminals for high-interference resource scheduling remains unchanged. More terminals are selected for medium-interference scheduling in steps of δ, until j + x × δ terminals are selected for medium-interference scheduling, ensuring that nl ≤ Nl or all terminals in the low-interference scheduling queue cannot use medium-interference or high-interference RB scheduling. The preferred value of δ is 1.

[0084] If the condition nl≤Nl is still not met, it indicates that there are insufficient low-interference scheduling resources. In this case, the highest priority r1 terminals among the terminals to be scheduled for low-interference RB are selected to fill the low-interference RB, and the remaining terminals to be scheduled for low-interference RB are included in the next scheduling cycle.

[0085] Step S442: Determine whether nm≤N-Nh-n1 is satisfied. If not, increase the number of terminals to be scheduled for high interference RB in a step manner until nm≤N-Nh-n1 or nh>Nh or all terminals in the high interference scheduling queue are scheduled for high interference RB. If nm≤N-Nh-n1 is still not satisfied, select the r2 terminals with the highest priority among the terminals to be scheduled for medium interference RB to fill the medium interference RB, and include the remaining terminals to be scheduled for medium interference RB in the next scheduling cycle.

[0086] Specifically, if nm ≤ N - Nh - n1, the terminals undergoing interference RB scheduling are determined to be the j + x × δ terminals from step S441. If nm ≤ N - Nh - n1 is not satisfied, the first j' + δ' terminals in the high interference scheduling queue are selected for high interference RB scheduling, and the terminals to be scheduled for high interference RB scheduling are removed from the medium interference scheduling queue, while the number of terminals to be scheduled for low interference RB scheduling remains unchanged. It is then determined whether nm ≤ N - Nh - n1 is satisfied; if not, the first j' + 2δ' terminals in the high interference RB scheduling queue are selected for high interference RB scheduling, and the terminals to be scheduled for high interference RB scheduling are removed from the medium interference scheduling queue, while the number of terminals to be scheduled for low interference RB scheduling remains unchanged. More terminals are selected for high interference scheduling with a step size of δ' until j' + x' × δ' terminals undergo high interference RB scheduling, satisfying one of the following conditions: nm ≤ N - Nh - n1, nh > Nh, or all terminals in the high interference scheduling queue have been scheduled for high interference RB scheduling. If nm ≤ N - Nh - n1, the number of terminals scheduled by the high-interference RB is j' + x' × δ', and the number of terminals scheduled by the medium-interference RB is j + x × δ - x' × δ'. If nh > Nh, the number of terminals scheduled by the high-interference RB is j' + (x' - 1) × δ'. If all terminals in the high-interference scheduling queue are intended for high-interference RB scheduling, the number of terminals scheduled by the high-interference RB is j' + x' × δ'. The preferred value of δ' is 1.

[0087] If nm≤N-Nh-n1 is still not satisfied, it indicates that there is insufficient interference scheduling resources. The two terminals with the highest priority among the terminals to be scheduled for interference RB are selected to fill the interference resources. Terminals that cannot be scheduled will wait for the next scheduling cycle.

[0088] Here, if nl≤Nl, nm≤N-Nh-n1 and nh≤N-nm-n1 are satisfied, then the scheduling scheme is feasible and meets the needs of all terminals.

[0089] Figure 2 An embodiment of a resource scheduling system according to the present invention is shown. The resource scheduling system includes multiple RBs and multiple terminal UEs, as well as a scheduling module, which is capable of receiving scheduling requests from the terminal UEs and executing the aforementioned resource scheduling method.

[0090] Figure 3 An embodiment of a computer-readable storage medium according to the present invention is shown, wherein the computer-readable storage medium stores computer instructions that, when executed by a processor, implement the aforementioned resource scheduling method.

[0091] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A resource scheduling method, comprising: Step S1: In response to the scheduling requests of the k terminal UEs waiting to be scheduled at the current time, determine the number and noise floor of the high interference RB, medium interference RB and low interference RB at the current time respectively, where the total number of RBs is N, the number of high interference RBs at the current time is Nh, the number of medium interference RBs is Nm, and the number of low interference RBs is Nl. Step S2: Determine whether using all low-interference RBs can meet the scheduling requirements of the k UEs. If the determination result is yes, then perform low-interference RB scheduling; if the determination result is no, then proceed to step S3. Step S2 includes: Step S21: For the k terminal UEs, calculate the total number of RBs nl required for low-interference RB scheduling, wherein, for each terminal UEi, the number of RBs nRBli required for low-interference RB scheduling is calculated as follows: The uplink SINRl of the low-interference RB for each UEi is calculated using the following formula: SINRli = Pli / noisel. Where Pli = psrsl × (ns / nsrs), psrsl is the uplink reference signal of UEi received by the base station, ns is the number of symbols contained in one RB, nsrs is the number of symbols occupied by the uplink reference signal, and noisel is the average noise floor of Nl low interference RBs. Based on SINRli, the MCS is determined, and based on the service type and BSR requirements of UEi, the TBS required by UEi is determined, thereby calculating nRBli. Step S22: Determine whether the following expression holds true: nl≤Nl. If it holds true, the result of step S2 is yes; if it does not hold true, the result of step S2 is no. Step S3: Determine whether the low-interference RB and medium-interference RB can meet the scheduling requirements of the k UEs. If the determination result is yes, then perform low-interference RB and medium-interference RB scheduling. If the determination result is no, then proceed to step S4. Step S3 includes: Step S31: For the k terminal UEs, calculate the interference scheduling coefficient Imi for each UEi; Step S32: If Imi > C, then select terminal UEi into the interference scheduling queue, where C is the threshold, and sort the UEs in the interference scheduling queue from high to low according to Im; Step S33: Evaluate whether there is a scheme that uses medium-interference RB scheduling for the scheduling needs of the first q terminals UEi (1≤i≤q) in the medium-interference scheduling queue, and uses low-interference RB scheduling for the scheduling needs of the remaining terminals UEi (q≤i≤k). If there is, the judgment result of step S3 is yes; if there is no, the judgment result of step S3 is no. Step S4: Perform high-interference RB, medium-interference RB, and low-interference RB scheduling.

2. The resource scheduling method according to claim 1, characterized in that, Step S33 includes: Step S331: Select the first j terminals in the interference scheduling queue, perform interference RB scheduling on the j terminals and calculate the total number of RBs nm required for interference RB scheduling; Step S332: For the remaining terminals UEi (j≤i≤k), low-interference RB scheduling is to be performed and the total number of RBs nl required for low-interference RB scheduling is calculated; Step S333: Determine whether the following conditions are met simultaneously: nl≤Nl and nm≤(N-Nh-n1). If all conditions are met, then q=j, and medium-interference RB scheduling is used for the j terminals, while low-interference RB scheduling is used for the remaining terminals. If nm ≤ (N - Nh - n1) is not satisfied, then proceed to step S4. If nl≤Nl is not satisfied, but nm≤(N-Nh-n1) is satisfied, then j is increased in steps, and steps S331 to S333 are repeated until both conditions are met or all terminals in the interference scheduling queue are scheduled for interference RB. If all terminals in the medium interference scheduling queue are scheduled for medium interference RB and still do not satisfy nl≤Nl, then the highest priority r1 terminals among the terminals scheduled for low interference RB are selected to fill the low interference RB, and the remaining terminals scheduled for low interference RB are included in the next scheduling cycle.

3. The resource scheduling method according to claim 1, characterized in that, Step S4 includes: Step S41: For the k terminal UEs, calculate the high interference scheduling coefficient Ihi for each UEi. If Ihi > C', then select terminal UEi into the high interference scheduling queue. C' is the threshold. Sort the UEs in the high interference scheduling queue from high to low according to Ih. Step S42: For terminals that are not selected into the high interference scheduling queue, calculate the medium interference scheduling coefficient Imi for each UEi. If Imi > C, then select terminal UEi into the medium interference scheduling queue. C is the threshold. Sort the UEs in the medium interference scheduling queue from high to low according to Im. Step S43: Select the first j' terminals in the high interference scheduling queue, perform high interference RB scheduling on the j' terminals and calculate the total number of RBs nh required for high interference RB scheduling; select the first j terminals in the medium interference scheduling queue, perform medium interference RB scheduling on the j terminals and calculate the total number of RBs nm required for medium interference RB scheduling; perform low interference RB scheduling on the remaining terminals and calculate the total number of RBs nl required for low interference RB scheduling. Step S44: Adjust j' and j, and occupy resources in the order of low interference RB, medium interference RB, and high interference RB. Terminals that cannot be scheduled are included in the next scheduling cycle.

4. The resource scheduling method according to claim 3, characterized in that, After step S43, it is determined whether nl≤Nl, nm≤N-Nh-n1 and nh≤N-nm-n1 are satisfied simultaneously. If they are satisfied, the scheduling scheme is feasible; otherwise, step S44 is executed.

5. The resource scheduling method according to claim 3, characterized in that, Step S44 includes: Step S441: Determine whether nl≤Nl is satisfied. If not, increase the number of terminals to be scheduled for medium interference RB in a step manner, while keeping the number of terminals to be scheduled for high interference RB unchanged, until nl≤Nl is satisfied or there are no more terminals in the medium interference scheduling queue and high interference scheduling queue to be scheduled for low interference RB. If nl≤Nl is still not satisfied, select the r1 terminals with the highest priority among the terminals to be scheduled for low interference RB to fill the low interference RB, and include the remaining terminals to be scheduled for low interference RB in the next scheduling cycle. Step S442: Determine whether nm≤N-Nh-n1 is satisfied. If not, increase the number of terminals to be scheduled for high interference RB in a step manner until nm≤N-Nh-n1 or nh>Nh or all terminals in the high interference scheduling queue are scheduled for high interference RB. If nm≤N-Nh-n1 is still not satisfied, select the r2 terminals with the highest priority among the terminals to be scheduled for medium interference RB to fill the medium interference RB, and include the remaining terminals to be scheduled for medium interference RB in the next scheduling cycle.

6. The resource scheduling method according to claim 2 or 3, characterized in that, For each terminal UEi, the number of RBs nRBmi required for interference RB scheduling is calculated as follows: The SINRm of the interference RB in each terminal UEi is calculated according to the following formula: SINRmi = Pmi / noisem. Where Pmi = psrsm × (ns / nsrs), psrsm is the uplink reference signal of UEi received by the base station, ns is the number of symbols contained in one RB, nsrs is the number of symbols occupied by the uplink reference signal, and noisem is the average noise floor of Nm interfering RBs. Based on SINRmi, the MCS is determined, and based on the service type and BSR requirements of the terminal UEi, the TBS required by the terminal UEi is determined, thereby calculating nRBmi.

7. The resource scheduling method according to claim 3, characterized in that, For each terminal UEi, the number of RBs nRBhi required for high-interference RB scheduling is calculated as follows: The high interference RB of each terminal UEi is calculated according to the following formula: SINRhi = Phi / noiseh, Where Phi = psrsh × (ns / nsrs), psrsh is the uplink reference signal of UEi received by the base station, ns is the number of symbols contained in one RB, nsrs is the number of symbols occupied by the uplink reference signal, and noiseh is the average noise floor of Nh high interference RBs. Based on SINRhi, the MCS is determined, and based on the service type and BSR requirements of the terminal UEi, the TBS required by the terminal UEi is determined, thereby calculating nRBhi.

8. The resource scheduling method according to claim 1, characterized in that, The interference scheduling coefficient Imi of terminal UEi is calculated according to the following formula: Imi=a×IPHi+b×IRSRPi+c×IQCIi Where IPHi is the power margin identifier, IRSRPi is the RSRP identifier, IQCIi is the QoS level identifier, and a, b, and c are weighting coefficients.

9. The resource scheduling method according to claim 3, characterized in that, The high-interference scheduling coefficient Ihi of terminal UEi is calculated according to the following formula: Ihi=(a'×IPHi+b'×IRSRPi+c'×IQCIi)×Ilasti Where IPHi is the power margin identifier, IRSRPi is the RSRP identifier, IQCIi is the QoS level identifier, a', b', and c' are weighting coefficients, and Ilasti is an identifier indicating whether the previous scheduling period was a high-interference RB scheduling.

10. A resource scheduling system, comprising multiple RBs and multiple UEs, and a scheduling module, the scheduling module being able to receive scheduling requests from the UEs and to execute the resource scheduling method according to any one of the preceding claims.

11. A computer-readable storage medium, wherein, The computer-readable storage medium stores computer instructions that, when executed by a processor, implement the resource scheduling method according to any one of claims 1 to 9.

Images