Downlink resource scheduling method and device for realizing throughput max-min fairness and storage medium

Abstract

The invention discloses a downlink resource scheduling method and device for realizing throughput max-min fairness and a storage medium. The method comprises the following steps: acquiring information; allocating the radio bearer to the terminal device based on a greedy criterion according to the information; sorting all the terminal devices from low to high according to the channel capacities of the terminal devices, and updating the historical minimum channel capacity; and iteratively requesting or exchanging the radio bearer between the terminal devices. According to the method, the resource utilization efficiency is improved while the minimum channel capacity is improved and the max-min fairness is realized, and the reduction of throughput performance is reduced to a greater extent. In addition, proportional fairness is achieved in a weighting mode, and the system can adjust the weight according to requirements in an actual scene to balance throughput and fairness of the system.

Description

Technical Field

[0001] The present invention relates to the technical field of wireless network resource scheduling, and in particular to a downlink resource scheduling method, device and storage medium for realizing max-min fairness of throughput. Background Art

[0002] The core idea of ​​the max-min fairness (MMF) algorithm is to give priority to users with the worst channel conditions when allocating resources, ensuring the fairness of resource allocation and thus improving user experience.

[0003] The algorithms for implementing MMF can be mainly divided into: heuristic-based, optimization-based, and DRL (Deep Reinforcement Learning)-based. The optimization-based algorithm transforms the resource allocation problem into a convex problem, solves it through an efficient convex optimization algorithm, and ensures the global optimal solution. However, problems with more constraints have high computational costs, and not all problems can be transformed into convex problems, so optimization-based algorithms are rarely used in actual systems. DRL-based methods usually require more training data and time to learn effective strategies. In the initial exploration stage, a large number of invalid actions may lead to poor initial performance. Moreover, DRL needs to process a large amount of state space and action space, especially when it involves multi-user and multi-resource scenarios, the computational complexity will increase significantly, and it is not very applicable in real-time systems. The performance of heuristic algorithms is highly dependent on the rules and heuristic strategies used. If the rules are not designed reasonably, the overall performance of the system may be lower than expected.

[0004] Therefore, a downlink resource scheduling method, device and storage medium that achieves max-min fairness in throughput are developed to solve the above problems. Summary of the invention

[0005] The present invention proposes a downlink resource scheduling method, device and storage medium for realizing max-min fairness of throughput, so as to solve the problem that low resource utilization efficiency leads to low overall system performance in the prior art.

[0006] The present invention achieves the above-mentioned purpose through the following technical solutions:

[0007] The present invention provides a downlink resource scheduling method for realizing max-min fairness of throughput, comprising:

[0008] Acquiring information, the information including channel capacities of all terminal devices on the radio bearer;

[0009] allocating the radio bearer to the terminal device based on a greedy criterion according to the information;

[0010] Sort all the terminal devices according to the channel capacity of the terminal devices from low to high, and update the historical minimum channel capacity;

[0011] Iteratively requesting or exchanging the wireless bearers between the terminal devices, including: selecting the terminal device with the lowest channel capacity according to the sorting result and iteratively selecting the terminal device with higher channel capacity in turn for iterative requesting or exchanging operations, the requesting or exchanging operation including judging whether the difference in channel capacity between the selected terminal device with the lowest channel capacity and the terminal device with higher channel capacity is greater than a preset threshold value, if so, the terminal device with the lowest channel capacity requests one wireless bearer from the terminal device with higher channel capacity, if not, exchanging the wireless bearers between the terminal device with the lowest channel capacity and the terminal device with higher channel capacity without reducing the lowest channel capacity, the terminal device with higher channel capacity is iteratively selected as the terminal device from the first to the second in the order.

[0012] Furthermore, the obtaining of information includes:

[0013] Acquire channel sounding reference signals sent by all the terminal devices;

[0014] Acquire a signal to interference and noise ratio of the terminal device on the radio bearer according to the channel sounding reference signal;

[0015] The corresponding channel capacity is calculated based on the Shannon formula according to the signal to interference plus noise ratio to obtain the channel quality of all the terminal devices.

[0016] Further, allocating a radio bearer to the terminal device based on a greedy criterion according to the information includes:

[0017] Setting parameters, wherein the parameters include the number of outer layer iterations, loop variables, initial values, and the initial historical minimum channel capacity, and allocating each of the radio bearers to the terminal device with the highest channel quality based on a greedy criterion according to the parameters;

[0018] Setting the weighted ratio and weight of the terminal device;

[0019] The terminal devices are sorted from high to low according to the channel quality, and the channel capacity of the first P terminal devices on all the radio bearers is multiplied by the weight, where , K is the number of the terminal devices, is the weighted ratio, and a weighted result is obtained;

[0020] Calculating the total channel capacity and average channel capacity of all the terminal devices according to the weighted results;

[0021] Enter the outer loop;

[0022] If the loop variable is less than the outer iteration number, the current minimum channel capacity is calculated based on the total channel capacity. If the current minimum channel capacity is greater than the historical minimum channel capacity, proceed to the next step; otherwise, stop the iteration and jump out of the outer loop. When the outer iteration number reaches the upper limit or meets the interruption condition, stop the iteration and output the final allocation result.

[0023] Further, allocating a radio bearer to the terminal device based on a greedy criterion according to the information includes:

[0024] According to the principle of greed Assigned to ;

[0025] Set the UE weight ratio , weight , by channel quality Sort the UE from high to low. The channel capacity of each UE on all RBs is multiplied by ,in Then calculate the total channel capacity of the UE , and the average channel capacity ,in for The number of allocated RBs, including the channel quality of the UE , the channel capacity that each RB can bring to the UE , , ;

[0026] Set the number of outer iterations , the loop variable is , the initial value is , set the initial historical minimum channel capacity ;

[0027] if , calculate the current minimum channel capacity ,if , but , go to the next step, otherwise stop iteration and jump out of the outer loop. When the number of outer iterations reaches the upper limit or meets the interruption condition, stop iteration and output the final allocation result;

[0028] Further, iteratively performing the acquisition or exchange of the radio bearer between the terminal devices includes:

[0029] Select the first one in the sorted list of all terminal devices UE , and the last Position , is the loop variable, from Increase to ( ),let and Execute RB claim / exchange;

[0030] Determine the terminal device with the lowest channel capacity With higher channel capacity whether the channel capacity difference of the terminal device is greater than a preset channel capacity threshold;

[0031] If so, without making When the channel capacity is lower than the current minimum channel capacity, Use the radio bearer RB owned by Channel capacity increases with maximum wireless bearer Reassign to , update the channel capacity of UE;

[0032] If not, without making When the channel capacity is lower than the current minimum channel capacity, RB in possession Channel capacity increases with maximum wireless bearer Reassign to , The channel capacity in the owned RB is lower than RB is available Select and use Channel capacity increases for maximum wireless bearer Reassign to ,if If it does not exist, cancel the swap and update the UE's channel capacity.

[0033] Further, iteratively performing the acquisition or exchange of the radio bearer between the terminal devices includes:

[0034] Setting inner layer iteration parameters, wherein the inner layer iteration parameters include the number of inner layer iterations;

[0035] Enter the inner iteration loop;

[0036] Select sort list The number 1 terminal device , and the last Terminal equipment ,in, is the loop variable, with an initial value of 1. ;

[0037] if , then suppose , The list of RBs owned is , ,from Choose one The largest increase in channel capacity ,if , then Reassign to , , , update UE channel capacity, , otherwise, stop iteration and jump out of the inner loop;

[0038] if , then from Choose 1 from The largest increase in channel capacity , Channel capacity is less than The RB list is , from Select the one that increases the channel capacity the most ,if and , then exchange RB, , , , otherwise stop iterating and exit the loop if If it is empty, it will stop iterating and jump out of the inner loop;

[0039] in, Indicates the historical lowest channel capacity, Indicates terminal equipment The channel capacity of Indicates terminal equipment The channel capacity of Indicates terminal equipment The current average channel capacity is used as the judgment threshold. Indicates terminal equipment exist The channel capacity on Indicates terminal equipment exist The channel capacity on Indicates terminal equipment exist The channel capacity on Indicates terminal equipment exist The channel capacity on .

[0040] The present invention also provides a downlink resource scheduling device for realizing max-min fairness of throughput, comprising:

[0041] An acquisition module, the acquisition module is used to acquire information, the information including the channel capacity of all terminal devices on the radio bearer;

[0042] An allocation module, the allocation module being configured to allocate the radio bearer to the terminal device based on a greedy criterion according to the information;

[0043] A sorting module, the sorting module is used to sort all the terminal devices from low to high according to the channel capacity of the terminal devices, and update the historical minimum channel capacity;

[0044] A request or exchange module, the request or exchange module is used to iteratively request or exchange the wireless bearers between the terminal devices, including: selecting the terminal device with the lowest channel capacity according to the sorting result and iteratively selecting the terminal device with higher channel capacity in turn for iterative request or exchange operation, the request or exchange operation includes judging whether the difference in channel capacity between the selected terminal device with the lowest channel capacity and the terminal device with higher channel capacity is greater than a preset threshold value, if so, the terminal device with the lowest channel capacity requests one wireless bearer from the terminal device with higher channel capacity, if not, the wireless bearers of the terminal device with the lowest channel capacity and the terminal device with higher channel capacity are exchanged without reducing the lowest channel capacity, and the terminal device with higher channel capacity is iteratively selected as the terminal device from the first to the second in the order.

[0045] The present invention also provides a storage medium, which is a readable storage medium. A computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of a downlink resource scheduling method for achieving throughput max-min fairness are implemented.

[0046] The beneficial effects of the present invention are:

[0047] The present invention improves the minimum channel capacity and realizes max-min fairness, while improving resource utilization efficiency and greatly reducing the decline in throughput performance. In addition, proportional fairness is achieved through weighting. In actual scenarios, the system can adjust the weight according to demand to balance system throughput and fairness. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] Figure 1 It is a flow chart of the 5G downlink resource scheduling system of the present invention;

[0049] Figure 2The present invention is a flowchart of a downlink resource scheduling method for achieving max-min fairness in throughput according to an embodiment of the present invention. DETAILED DESCRIPTION

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

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

[0052] It should be noted that similar reference numerals and letters denote similar items in the following drawings, and therefore, once an item is defined in one drawing, further definition and explanation thereof is not required in subsequent drawings.

[0053] In the description of the present invention, it should be understood that the terms "upper", "lower", "inside", "outside", "left", "right", etc. indicate directions or positional relationships based on the directions or positional relationships shown in the accompanying drawings, or are directions or positional relationships in which the product of the invention is usually placed when in use, or are directions or positional relationships commonly understood by those skilled in the art. These directions or positional relationships are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific direction, be constructed and operated in a specific direction, and therefore should not be understood as a limitation on the present invention.

[0054] In the description of the present invention, it is also necessary to explain that, unless otherwise clearly specified and limited, the terms such as "setting" and "connection" should be understood in a broad sense. For example, "connection" can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or an indirect connection through an intermediate medium, or it can be the internal communication of two elements. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0055] In the present invention, "SRS" means channel sounding reference signal, and "SINR" means signal to interference and noise ratio.

[0056] The specific implementation modes of the present invention are described in detail below in conjunction with the accompanying drawings.

[0057] like Figure 1 As shown, the present invention proposes a downlink resource scheduling method for achieving throughput max-min fairness, which includes the following stages:

[0058] Channel information collection phase: The base station measures the SRS sent by the UE and uses channel reciprocity to obtain the SINR of the UE on the RB, and uses the Shannon formula to calculate the corresponding channel capacity and the UE channel quality, that is, the average channel capacity of the UE on all RBs;

[0059] Initial allocation, weighted phase: Allocate RBs to UEs based on the greedy criterion. Specifically, allocate each RB to the UE with the highest channel quality to obtain an initial allocation result. Set the weighted UE ratio , set the weight , the channel capacity of the UE with the highest channel quality ranking P on all RBs multiplied by ,in . Update UE channel capacity;

[0060] UE sorting stage: Sort the UEs from low to high according to their current channel capacity to obtain a UE sorting list ;

[0061] UE selection stage: select the first UE in the UE sorting list , and the last Position , is the loop variable, from Increase to ( ),let and Execute RB claim / exchange;

[0062] RB acquisition / exchange phase: If the channel tolerance of the two selected UEs is large, the RB acquisition phase is entered. When the channel capacity is lower than the current minimum channel capacity, RB in possession The largest increase in channel capacity Reassign to Update the UE channel capacity; if the channel capacities of the two selected UEs are not much different, enter the RB exchange phase. When the channel capacity is lower than the current minimum channel capacity, RB in possession The largest increase in channel capacity Reassign to . The channel capacity in the owned RB is lower than RB is available Select and use The largest increase in channel capacity Reassign to .if If not present, cancel the swap. Update UE channel capacity.

[0063] like Figure 2 As shown, the present invention provides a downlink resource scheduling method for realizing max-min fairness of throughput, and each step is specifically as follows:

[0064] The channel information collection phase includes the following steps:

[0065] Step 1.1: The base station measures the signal to interference noise ratio of each UE on each RB ,in , , and then use the Shannon formula to calculate the channel capacity that each RB can bring to the UE , and the channel quality of the UE ;

[0066] The initial allocation and weighting phase consists of the following steps:

[0067] Step 2.1: Use the greedy principle to Assigned to ;

[0068] Step 2.2: Set the UE weighting ratio , weight , by channel quality Sort the UE from high to low. The channel capacity of each UE on all RBs is multiplied by ,in Then calculate the total channel capacity of the UE , and the average channel capacity ,in for The number of allocated RBs;

[0069] Step 2.3: Set the number of outer layer iterations , the loop variable is , The initial value is 1, setting the initial historical minimum channel capacity ;

[0070] Step 2.4, enter the outer iteration loop, if , calculate the current minimum channel capacity ,if , but , execute steps 3.1-5.1, otherwise stop iteration and jump out of the outer loop. When the number of outer iterations reaches the upper limit or the interrupt condition is met, stop iteration and output the final allocation result.

[0071] The UE sorting phase includes the following steps:

[0072] Step 3.1: Sort the UEs from low to high according to the total channel capacity to get a sorted list. , update the historical minimum channel capacity ;

[0073] The UE selection phase includes the following steps:

[0074] Step 4.1, set the number of inner layer iterations to ( is the number of UEs), and execute steps 4.1-5.1 for each iteration. No.1 , and the last Position ,in, is the loop variable, with an initial value of 1. .let and Execute RB claim / exchange;

[0075] The RB request / exchange phase includes the following steps:

[0076] Enter the inner iteration loop:

[0077] Step 5.1: If , indicating that the channel capacity difference between the two selected UEs is large, execute step 5.1.1, otherwise execute step 5.1.2;

[0078] Step 5.1.1, set , The list of RBs owned is , ,from Choose 1 from The largest increase in channel capacity ,if , then Reassign to , , , update UE channel capacity, , otherwise, stop iteration and jump out of the inner loop;

[0079] Step 5.1.2: From Choose 1 from The largest increase in channel capacity , the S1 channel capacity is lower than The RB list is , from Select the one that increases the channel capacity the most ,if and , then exchange RB, , , , otherwise stop iterating and exit the loop if If it is empty, it will stop iterating and jump out of the inner loop;

[0080] in, Indicates the historical lowest channel capacity, Indicates terminal equipment The channel capacity, Indicates terminal equipment The channel capacity, Indicates terminal equipment The current average channel capacity is used as the judgment threshold. Indicates terminal equipment exist The channel capacity on Indicates terminal equipment exist The channel capacity on Indicates terminal equipment exist The channel capacity on Indicates terminal equipment exist The channel capacity on .

[0081] Compared with the prior art, the present invention has the following advantages:

[0082] 1. Obtain more detailed channel information by measuring SRS. Through the SRS channel detection signal sent by the UE, the base station can obtain more accurate SINR. Compared with CQI feedback, it can provide more fine-grained channel information, solving the problem of unfair resource allocation caused by inaccurate channel estimation in traditional scheduling. The advantage is that the accuracy of channel information is improved.

[0083] 2. The weights can be adjusted according to actual needs to achieve proportional fairness in a weighted manner. The initial allocation allocates RBs to UEs based on a greedy criterion, and UEs with good channel quality can be allocated more RBs. In the subsequent RB acquisition / exchange phase, the more RBs a UE has and the higher the channel capacity, the more likely it is that its RBs will be reallocated to UEs with poor channel quality. By weighting UEs with good channel quality and reducing their channel capacity, the gap between them and UEs with poor channel quality is reduced, and more RB exchanges are performed in iterations instead of RB acquisitions, thereby guaranteeing resource allocation for UEs with good channel quality to a certain extent, improving fairness while taking into account throughput. When the weights are When set to 1, max-min fairness is achieved. When achieving proportional fairness.

[0084] 3. Through RB acquisition and exchange, the minimum rate of UE is fully improved, which is closer to the global optimal solution. Compared with the prior art that only focuses on the UE with the lowest rate, the method of the present invention allows low-rate UE to more fully acquire / exchange RBs with other UEs through iteration without reducing the minimum channel capacity of the UE, gradually approaching the global optimal solution. Compared with the traditional method that only focuses on the minimum rate, the iterative mechanism of the present invention improves resource utilization and overall performance while ensuring fairness.

[0085] In order to verify the effect of the method of the present invention, the present invention has conducted simulation experiments on the NS3 simulation platform and compared the NS3 native traditional heuristic method, the greedy algorithm (Greedy), the method based on Gurobi solution (which can be regarded as the upper bound of performance), the baseline algorithm (Alg1), and the method proposed by the present invention (Alg2). The parameter table of the NS3 simulation platform is as follows Table 1:

[0086] Table 1

[0087] Parameter Type Parameter Value Channel Model InH_OfficeOpen_nLoS Number of UEs 12 Number of RBGs 17 Number of RBs in RBG 16 Numerology 1 Center frequency (Hz) 3.5e9 Bandwidth (Hz) 100e6 Transmit power 10dbm Data transmission type Full Buffer

[0088] As shown in Table 2, in the constructed 5G single base station downlink full packet transmission scenario, the performance of the present invention in terms of UE minimum throughput, system average throughput, and system fairness is superior to the baseline algorithm, and the fairness is close to the performance upper bound provided by Gurobi, and the system average throughput is higher than Gurobi. This shows that the method proposed in the present invention can improve resource utilization efficiency and reduce system throughput performance degradation while achieving max-min fairness.

[0089] Table 2

[0090]

[0091] As shown in Table 3, the influence of setting weighting on the present invention is shown. The lower the weight, the more the method tends to improve system throughput and reduce fairness; the higher the weight, the more the method tends to improve fairness and reduce throughput. By weighting, our method can achieve proportional fairness. In actual scenarios, the weight can be adjusted according to needs to balance system throughput and fairness.

[0092] Table 3

[0093]

[0094] In summary, the present invention collects channel information in the channel information collection stage, calculates the channel capacity of all UEs on RBs, receives channel information in the initial allocation and weighting stage, allocates RBs to UEs according to the greedy criterion, and then weights the UEs. The UE sorting stage sorts according to the channel capacity of the current UE, and the UE selection stage selects the UE with the lowest channel capacity according to the sorting result. And iteratively select the channel with higher capacity Request / exchange RBs. Calculate the channel capacity gap of the selected UEs. If the gap is large, request RBs; if the gap is small, exchange RBs. In the RB request phase, the UE with low channel capacity requests an RB from the UE with high channel capacity; in the RB exchange phase, the UEs exchange RBs without reducing the minimum channel capacity. By iteratively requesting and exchanging RBs between UEs, while improving the UE with low channel capacity and achieving max-min fairness, the resource utilization efficiency is improved, and the decline in throughput performance is greatly reduced. In addition, proportional fairness is achieved in a weighted manner. In actual scenarios, the system can adjust the weights according to demand to balance the system throughput and fairness. Experimental results show that on the NS3 simulation platform, for a single base station and multi-user downlink full-flood transmission scenario, the method of the present invention can make full use of the multi-user diversity brought by the frequency selective fading channel, so that the system's minimum throughput and fairness are close to the performance upper bound, while achieving higher average throughput and resource utilization efficiency.

[0095] The present invention also provides a downlink resource scheduling device for realizing max-min fairness of throughput, comprising:

[0096] An acquisition module, the acquisition module is used to acquire information, the information including the channel capacity of all terminal devices on the radio bearer;

[0097] An allocation module, the allocation module being configured to allocate the radio bearer to the terminal device based on a greedy criterion according to the information;

[0098] A sorting module, the sorting module is used to sort all the terminal devices from low to high according to the channel capacity of the terminal devices, and update the historical minimum channel capacity;

[0099] A request or exchange module, the request or exchange module is used to iteratively request or exchange the wireless bearers between the terminal devices, including: selecting the terminal device with the lowest channel capacity according to the sorting result and iteratively selecting the terminal device with higher channel capacity in turn for iterative request or exchange operation, the request or exchange operation includes judging whether the difference in channel capacity between the selected terminal device with the lowest channel capacity and the terminal device with higher channel capacity is greater than a preset threshold value, if so, the terminal device with the lowest channel capacity requests one wireless bearer from the terminal device with higher channel capacity, if not, the wireless bearers of the terminal device with the lowest channel capacity and the terminal device with higher channel capacity are exchanged without reducing the lowest channel capacity, and the terminal device with higher channel capacity is iteratively selected as the terminal device from the first to the second in the order.

[0100] The present invention also provides a storage medium, which is a readable storage medium. A computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of a downlink resource scheduling method for achieving throughput max-min fairness are implemented.

[0101] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the technical principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A downlink resource scheduling method for achieving max-min fairness in throughput, characterized in that: include: Acquiring information, the information including channel capacities of all terminal devices on the radio bearer; allocating the radio bearer to the terminal device based on a greedy criterion according to the information; Sort all the terminal devices according to the channel capacity of the terminal devices from low to high, and update the historical minimum channel capacity; Iteratively requesting or exchanging the wireless bearers between the terminal devices, including: selecting the terminal device with the lowest channel capacity according to the sorting result and iteratively selecting the terminal device with higher channel capacity in turn for iterative requesting or exchanging operations, the requesting or exchanging operation including judging whether the difference in channel capacity between the selected terminal device with the lowest channel capacity and the terminal device with higher channel capacity is greater than a preset threshold value, if so, the terminal device with the lowest channel capacity requests one wireless bearer from the terminal device with higher channel capacity, if not, exchanging the wireless bearers between the terminal device with the lowest channel capacity and the terminal device with higher channel capacity without reducing the lowest channel capacity, the terminal device with higher channel capacity is iteratively selected as the terminal device from the first to the second in the order.

2. A downlink resource scheduling method for achieving max-min fairness of throughput according to claim 1, characterized in that: The information obtained includes: Acquire channel sounding reference signals sent by all the terminal devices; Acquire a signal to interference and noise ratio of the terminal device on the radio bearer according to the channel sounding reference signal; The corresponding channel capacity is calculated based on the Shannon formula according to the signal to interference plus noise ratio to obtain the channel quality of all the terminal devices.

3. A downlink resource scheduling method for achieving max-min fairness of throughput according to claim 2, characterized in that: Allocating a radio bearer to the terminal device based on a greedy criterion according to the information includes: Setting parameters, wherein the parameters include the number of outer layer iterations, loop variables, initial values, and the initial historical minimum channel capacity, and allocating each of the radio bearers to the terminal device with the highest channel quality based on a greedy criterion according to the parameters; Setting the weighted ratio and weight of the terminal device; The terminal devices are sorted from high to low according to the channel quality, and the channel capacity of the first P terminal devices on all the radio bearers is multiplied by the weight, where , K is the number of the terminal devices, is the weighted ratio, and a weighted result is obtained; Calculating the total channel capacity and average channel capacity of all the terminal devices according to the weighted results; Enter the outer loop; If the loop variable is less than the outer iteration number, the current minimum channel capacity is calculated based on the total channel capacity. If the current minimum channel capacity is greater than the historical minimum channel capacity, proceed to the next step; otherwise, stop the iteration and jump out of the outer loop. When the outer iteration number reaches the upper limit or meets the interruption condition, stop the iteration and output the final allocation result.

4. A downlink resource scheduling method for achieving max-min fairness of throughput according to claim 3, characterized in that: Allocating a radio bearer to the terminal device based on a greedy criterion according to the information includes: According to the principle of greed Assigned to ; Set the UE weight ratio , weight , by channel quality Sort the UE from high to low. The channel capacity of each UE on all RBs is multiplied by ,in , and then calculate the total channel capacity of the UE , and the average channel capacity ,in for The number of allocated RBs, including the channel quality of the UE , the channel capacity that each RB can bring to the UE , , ; Set the number of outer iterations , the loop variable is , the initial value is , set the initial historical minimum channel capacity ; if , calculate the current minimum channel capacity ,if , but , go to the next step, otherwise stop iteration and jump out of the outer loop. When the number of outer iterations reaches the upper limit or meets the interrupt condition, stop iteration and output the final allocation result.

5. A downlink resource scheduling method for achieving max-min fairness in throughput according to claim 4, characterized in that: Iteratively acquiring or exchanging the radio bearer between the terminal devices includes: Select the first one in the sorted list of all terminal devices UE , and the last Position , is the loop variable, from Increase to , ,let and Execute RB claim / exchange; Determine the terminal device with the lowest channel capacity With higher channel capacity whether the channel capacity difference of the terminal device is greater than a preset channel capacity threshold; If so, without making When the channel capacity is lower than the current minimum channel capacity, Use the radio bearer RB owned by Channel capacity increases with maximum wireless bearer Reassign to , update the channel capacity of UE; If not, without making When the channel capacity is lower than the current minimum channel capacity, Owned RB Channel capacity increases with maximum wireless bearer Reassign to , The channel capacity in the RB owned is lower than RB is available Select and use Channel capacity increases for maximum radio bearer Reassign to ,if If it does not exist, cancel the swap and update the UE's channel capacity.

6. A downlink resource scheduling method for achieving max-min fairness in throughput according to claim 5, characterized in that: Iteratively acquiring or exchanging the radio bearer between the terminal devices includes: Setting inner layer iteration parameters, wherein the inner layer iteration parameters include the number of inner layer iterations; Enter the inner iteration loop; Select sort list The number 1 terminal device , and the last Terminal equipment ,in, is the loop variable, with an initial value of 1. ; if , then suppose The list of RBs owned is ,from Choose one The largest increase in channel capacity ,if , then Reassign to , , , update UE channel capacity, , otherwise, stop iteration and jump out of the inner loop; if , then from Choose 1 The largest increase in channel capacity , Channel capacity is less than The RB list is , from Select the one that increases the channel capacity the most ,if and , then exchange RB, , , Otherwise, stop iterating and exit the loop if If it is empty, it will stop iterating and jump out of the inner loop; in, Indicates the historical lowest channel capacity, Indicates terminal equipment The channel capacity of Indicates terminal equipment The channel capacity of Indicates terminal equipment The current average channel capacity is used as the judgment threshold. Indicates terminal equipment exist The channel capacity on Indicates terminal equipment exist The channel capacity on Indicates terminal equipment exist The channel capacity on Indicates terminal equipment exist The channel capacity on .

7. A downlink resource scheduling device for achieving max-min fairness in throughput, characterized in that: include: An acquisition module, the acquisition module is used to acquire information, the information including the channel capacity of all terminal devices on the radio bearer; An allocation module, the allocation module being configured to allocate the radio bearer to the terminal device based on a greedy criterion according to the information; A sorting module, the sorting module is used to sort all the terminal devices from low to high according to the channel capacity of the terminal devices, and update the historical minimum channel capacity; A request or exchange module, the request or exchange module is used to iteratively request or exchange the wireless bearers between the terminal devices, including: selecting the terminal device with the lowest channel capacity according to the sorting result and iteratively selecting the terminal device with higher channel capacity in turn for iterative request or exchange operation, the request or exchange operation includes judging whether the difference in channel capacity between the selected terminal device with the lowest channel capacity and the terminal device with higher channel capacity is greater than a preset threshold value, if so, the terminal device with the lowest channel capacity requests one wireless bearer from the terminal device with higher channel capacity, if not, the wireless bearers of the terminal device with the lowest channel capacity and the terminal device with higher channel capacity are exchanged without reducing the lowest channel capacity, and the terminal device with higher channel capacity is iteratively selected as the terminal device from the first to the second in the order.

8. A storage medium, characterized in that: The storage medium is a 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 a downlink resource scheduling method for realizing throughput max-min fairness as described in any one of claims 1 to 6 are implemented.

Images