Carrier scheduling methods, apparatus, electronic devices and computer storage media
By comprehensively considering information such as maximum traffic value, user waiting time, and PRB utilization rate between carrier cells, precise carrier scheduling is achieved, solving the problem of low carrier scheduling accuracy in existing technologies and realizing more efficient resource utilization and load balancing.
Patent Information
- Application Number
- CN202210633065.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-06-06
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2042-06-06
AI Technical Summary
Existing carrier scheduling methods rely on manual evaluation of indicators, resulting in low scheduling accuracy, inability to effectively handle sudden high load conditions, uneven resource allocation, and negative impact on user experience.
Based on the next-time maximum traffic value and user waiting time of each carrier cell in the target area, combined with the preset weighting coefficient and PRB utilization rate, the carrier reduction impact information and demand information are determined, and precise carrier scheduling is performed.
It improves the accuracy of carrier scheduling, optimizes resource allocation, reduces resource waste, and enhances the network's load balancing capabilities.
Smart Images

Figure CN117241319B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of wireless communication technology, specifically to a carrier scheduling method, apparatus, electronic device, and computer storage medium. Background Technology
[0002] Currently, high load remains a challenging and critical issue in network operation and maintenance, significantly impacting user experience. Carrier scheduling, without increasing carrier resources, flexibly allocates carrier resources from areas with reduced service demand to high-load areas. It is an effective means of addressing high-load cells awaiting expansion and those with high-load warnings, saving resources while fully utilizing potentially idle carriers to resolve high-load issues in localized hotspot areas.
[0003] Traditional carrier resource allocation adjustments are mainly carried out by network optimization engineers based on recent indicators, setting high load thresholds and low load thresholds. Carrier capacity is expanded for cells that reach the high load threshold, and carrier capacity is reduced for cells that are below the low load threshold. This approach cannot handle sudden situations, resulting in low accuracy of current carrier scheduling. Summary of the Invention
[0004] This application provides a carrier scheduling method, apparatus, electronic device, and computer storage medium to solve the technical problem that the accuracy of current carrier scheduling is low due to manual carrier scheduling based on index evaluation.
[0005] In a first aspect, embodiments of this application provide a carrier scheduling method, including:
[0006] The carrier reduction impact information of each carrier cell is determined based on the maximum traffic value of each carrier cell in the target area at the next time moment;
[0007] Based on the total waiting time of users in each carrier cell, the preset weighting coefficient, and the physical resource module (PRB) utilization rate of each carrier cell, the carrier demand information of each carrier cell is determined.
[0008] Carrier scheduling is performed among the carrier cells based on the carrier reduction impact information and the carrier demand information.
[0009] In one embodiment, the step of determining the carrier reduction impact information of each carrier cell based on the maximum traffic value of each carrier cell in the target area at the next time moment includes:
[0010] For each carrier cell in the target area, perform the following steps respectively:
[0011] Determine the maximum traffic value of the current carrier cell at the next time step;
[0012] Based on the maximum traffic value of the current carrier cell at the next time moment, the number of handovers from the current carrier cell to its corresponding neighboring cells, and the ratio between the number of handovers from the current carrier cell to each neighboring cell and the total number of handovers to each neighboring cell, the traffic obtained by each neighboring cell from the current carrier cell at the next time moment is determined.
[0013] Based on the preset weighting coefficient, the traffic obtained by each neighboring cell of the current carrier cell from the current carrier cell in the next moment, the current carrier traffic of each neighboring cell of the current carrier cell, and the PRB utilization rate of the current moment, determine the PRB utilization rate of each neighboring cell of the current carrier cell in the next moment.
[0014] Based on the PRB utilization rate of each neighboring cell of the current carrier cell at the next time step and the preset utilization rate threshold, determine the carrier reduction impact information of the current carrier cell.
[0015] In one embodiment, the step of determining the maximum traffic value of the current carrier cell at the next time moment includes:
[0016] Get the current carrier traffic of the current carrier cell and the average carrier traffic up to the previous time.
[0017] The average carrier traffic of the current carrier cell is determined based on the current carrier traffic and the average carrier traffic up to the previous time.
[0018] Based on the actual carrier traffic value of the current carrier cell in the previous time period, the predicted carrier traffic value in the previous time period, and the preset moving average coefficient, determine the weighted average value of the carrier traffic of the current carrier cell within the preset interval period.
[0019] The maximum traffic value of the current carrier cell at the next moment is determined based on the average carrier traffic and the weighted average carrier traffic.
[0020] In one embodiment, the step of determining the maximum traffic value of the current carrier cell at the next time moment based on the average carrier traffic and the weighted average carrier traffic includes:
[0021] Compare the average carrier traffic with the weighted average carrier traffic;
[0022] Based on the comparison results, the maximum traffic value of the current carrier cell at the next moment is determined from the average traffic of the carrier and the weighted average traffic of the carrier.
[0023] In one embodiment, the step of determining the carrier reduction impact information of the current carrier cell based on the PRB utilization rate of each neighboring cell at the next time step and a preset utilization threshold includes:
[0024] The PRB utilization rate of each neighboring cell of the current carrier cell at the next time step is compared with a preset utilization threshold to determine the number of neighboring cells whose PRB utilization rate at the next time step is less than the preset utilization threshold.
[0025] The carrier reduction impact information of the current carrier cell is determined based on the number of neighboring cells whose PRB utilization rate is less than the preset utilization rate threshold at the next moment.
[0026] In one embodiment, the step of determining the carrier demand information of each carrier cell based on the total waiting time of users in each carrier cell, a preset weighting coefficient, and the PRB utilization rate of each carrier cell includes:
[0027] For each of the aforementioned carrier cells, the following steps shall be performed respectively:
[0028] Determine the waiting time for GBR users and nonGBR users in the current carrier cell;
[0029] The total waiting time of users in the current carrier cell is determined based on the waiting time of the GBR users, the waiting time of the nonGBR users, and a preset weighting coefficient.
[0030] Based on the total waiting time and the PRB utilization rate of the current carrier cell, the carrier demand information of the current carrier cell is determined.
[0031] In one embodiment, the step of determining the carrier demand information of the current carrier cell based on the total waiting time and the PRB utilization of the current carrier cell includes:
[0032] The total waiting time is normalized to obtain the normalized total waiting time;
[0033] Based on the normalized total waiting time and the PRB utilization rate of the current carrier cell, determine the carrier demand information of the current carrier cell.
[0034] Secondly, embodiments of this application provide a carrier scheduling apparatus, comprising:
[0035] The first determining module is used to determine the carrier reduction impact information of each carrier cell based on the maximum traffic value of each carrier cell in the target area at the next time moment;
[0036] The second determining module is used to determine the carrier demand information of each carrier cell based on the total waiting time of users in each carrier cell, the preset weighting coefficient and the PRB utilization rate of each carrier cell.
[0037] The scheduling module is used to perform carrier scheduling among the carrier cells based on the carrier reduction impact information and the carrier demand information.
[0038] Thirdly, embodiments of this application provide an electronic device, including a processor and a memory storing a computer program, wherein the processor executes the program to implement the steps of the carrier scheduling method described in the first or second aspect.
[0039] Fourthly, embodiments of this application provide a computer storage medium, which is a computer-readable storage medium including a computer program. When the computer program is executed by a processor, it implements the steps of the carrier scheduling method described in the first or second aspect.
[0040] The carrier scheduling method, apparatus, electronic device, and computer storage medium provided in this application, by comprehensively considering information such as the maximum traffic value of each carrier cell in the next moment in the target area, the total waiting time of users in each carrier cell, the preset weight coefficient, and the PRB utilization rate of each carrier cell, determine the carrier reduction impact information and carrier demand information of each carrier cell. This enables precise carrier scheduling among each carrier cell in the target area, avoiding the problem of low carrier scheduling accuracy caused by manual carrier scheduling based on index evaluation, and effectively improving the accuracy of carrier scheduling. Attached Figure Description
[0041] To more clearly illustrate the technical solutions in this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0042] Figure 1 This is one of the flowcharts illustrating the carrier scheduling method provided in the embodiments of this application;
[0043] Figure 2 This is a second schematic flowchart of the carrier scheduling method provided in the embodiments of this application;
[0044] Figure 3 This is the third flowchart illustrating the carrier scheduling method provided in the embodiments of this application;
[0045] Figure 4 This is a functional module diagram of an embodiment of the carrier scheduling device of this application;
[0046] Figure 5 This is a schematic diagram of the structure of the electronic device provided in the embodiments of this application. Detailed Implementation
[0047] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions of this application will be clearly and completely described below with reference to the accompanying drawings of the embodiments. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.
[0048] High load has always been a key and challenging issue in network operation and maintenance, significantly impacting user experience. Carrier scheduling, without increasing carrier resources, can flexibly allocate carrier resources from areas with reduced service demand to areas with high load. It is an effective means of resolving high-load cells awaiting expansion and those with high-load warnings. It can also fully utilize potentially idle carriers to address high load issues in localized hotspot areas while conserving resources.
[0049] The existing carrier resource configuration adjustment is mainly carried out by network optimization engineers based on recent indicators, setting high load thresholds and low load thresholds. Carrier capacity is expanded for cells that reach the high load threshold, and carrier capacity is reduced for cells that are below the low load threshold. This approach cannot handle sudden situations and can easily affect user experience.
[0050] Therefore, the current load balancing technology in the existing network mainly has the following problems: setting a load threshold as the peak judgment standard leads to a large amount of waste of resources when network resources are configured according to the highest demand, and insufficient scheduling resources when the load is too low. It does not consider the situation of mutual scheduling and use of resources, and it cannot effectively distinguish the priority of scheduling needs when there are many high-load cells. The carrier reduction of low-load cells is not accurate enough. Since it is difficult to find cells with absolutely zero traffic in the current network during busy hours, it is necessary to assess the impact on users under the original cell after reducing the carrier of the cell, whether it will cause load problems in the area where the original cell is located, etc., which are not considered in the current network method.
[0051] The carrier scheduling method, apparatus, electronic device, and computer storage medium provided by the present invention will be described in detail below with reference to embodiments.
[0052] Figure 1 This is one of the flowcharts illustrating the carrier scheduling method provided in an embodiment of this application. (Refer to...) Figure 1 This application provides a carrier scheduling method, which may include:
[0053] Step S100: Determine the carrier reduction impact information of each carrier cell based on the maximum traffic value of each carrier cell in the target area at the next time moment;
[0054] It should be noted that the carrier scheduling method provided in this embodiment can be applied to electronic devices such as servers, PCs, and even smartphones. Furthermore, this application does not limit the carrier scheduling method to the devices listed above, but rather allows it to be applied to other applicable devices according to the actual situation.
[0055] In some embodiments of the present invention, a server is used as an example for description. The server can determine an area consisting of multiple carrier cells as a target area, which can specifically be a community, street, prefecture-level city, or even a larger area. A carrier cell is a cell that has or uses a carrier. A carrier is a physical concept, a radio wave of a specific frequency, measured in Hz (Hertz), and is an electromagnetic wave that is modulated in terms of frequency, amplitude, or phase to transmit speech, audio, images, or other signals.
[0056] To perform precise carrier scheduling in a target area across its various carrier cells, it is necessary to determine the impact of carrier reduction on each carrier cell, as well as the carrier demand information for each carrier cell. The impact of carrier reduction characterizes the degree of influence on the original area after carrier reduction in a carrier cell; the carrier demand information characterizes the carrier cell's demand for carrier traffic.
[0057] To determine the carrier reduction impact information for each carrier cell, the server can identify the maximum traffic value of each carrier cell in the target area at the next moment. This can be achieved by considering the average carrier traffic of each carrier cell after multiple time intervals and the weighted average of the carrier traffic of each carrier cell at the same moment within each period. Further, each carrier cell is considered as a cell to be removed from the carrier network. For each cell to be removed, the impact on its neighboring cells after carrier reduction (removal) is determined based on the maximum traffic value of the current carrier cell at the next moment, thus obtaining the carrier reduction impact information for that carrier cell. After determining the carrier reduction impact information for each carrier cell, multiple carrier reduction impact information pieces are obtained, each corresponding to a specific carrier cell. This facilitates subsequent carrier scheduling among the carrier cells based on the carrier reduction impact information of each carrier cell and the carrier demand information of each carrier cell. Therefore, precise carrier scheduling can be performed between carrier cells to avoid the problem of low carrier scheduling accuracy caused by manual carrier scheduling based on index evaluation, and effectively improve the accuracy of carrier scheduling.
[0058] Step S200: Based on the total waiting time of users in each carrier cell, the preset weighting coefficient, and the PRB utilization rate of each carrier cell, determine the carrier demand information of each carrier cell;
[0059] Precise carrier scheduling among carrier cells requires determining the carrier demand information of each carrier cell in the target area. To address this, the server can designate each carrier cell in the target area as a high-load cell. For each high-load cell, the total waiting time of users within that cell is calculated. Based on this total waiting time and the PRB utilization rate of that carrier cell, the carrier demand information for that cell is determined. This process is repeated until the carrier demand information for all carrier cells in the target area is obtained. This allows for subsequent carrier scheduling among carrier cells based on the impact of carrier reduction and the carrier demand information, achieving precise carrier scheduling and avoiding the low accuracy issues associated with manual carrier scheduling based on performance indicators. This significantly improves the accuracy of carrier scheduling.
[0060] Within a carrier cell, users include GBR (Guaranteed Bit Rate) users and nonGBR (Non-GBR) users, and the total waiting time for users includes the waiting time for both GBR and non-GBR users. GBR users are those with guaranteed bit rates, while non-GBR users are those without guaranteed bit rates. PRB (Physical Resource Block) refers to the resources of 12 consecutive carriers in the frequency domain; therefore, PRB utilization is the utilization rate of the resources of these 12 consecutive carriers in the frequency domain.
[0061] Step S300: Carrier scheduling is performed among the carrier cells based on the carrier reduction impact information and the carrier demand information.
[0062] After obtaining the carrier reduction impact information and carrier demand information for each carrier cell in the target area, the server can determine the carrier demand priority and carrier reduction impact priority for each carrier cell in the target area. It then allocates idle carriers from the carrier cell with the lowest carrier reduction impact priority to the carrier cell with the highest carrier demand priority; similarly, it allocates idle carriers from the carrier cell with the second lowest carrier reduction impact priority to the carrier cell with the second highest carrier demand priority, and so on. This allows for precise carrier scheduling within each carrier cell of the target area.
[0063] In one embodiment, a carrier idle table can be generated based on the carrier reduction impact information, and a carrier demand table can be generated based on the carrier demand information of each carrier cell. Specifically, the carrier idle table can be generated by sorting the carrier reduction impact information of each carrier cell, and the carrier demand table can be generated by sorting the carrier demand information of each carrier cell. The sorting order can be from smallest to largest carrier reduction impact, and from largest to smallest carrier demand information. Carrier scheduling between carrier cells is then performed based on the carrier idle table and the carrier demand table. For example, the idle carrier of the carrier cell ranked first in the carrier idle table can be allocated to the carrier cell ranked first in the carrier demand table, and so on.
[0064] The carrier scheduling method provided in this application determines the carrier reduction impact information and carrier demand information of each carrier cell by comprehensively considering information such as the maximum traffic value of each carrier cell in the next moment in the target area, the total waiting time of users in each carrier cell, the preset weight coefficient and the PRB utilization rate of each carrier cell. This allows for precise carrier scheduling among the carrier cells in the target area, avoiding the problem of low carrier scheduling accuracy caused by manual carrier scheduling based on index evaluation, and effectively improving the accuracy of carrier scheduling.
[0065] Figure 2 This is a second schematic flowchart illustrating the carrier scheduling method provided in an embodiment of this application. (Refer to...) Figure 2 In one embodiment, the step of determining the carrier reduction impact information of each carrier cell based on the maximum traffic value of each carrier cell in the target area at the next time moment includes:
[0066] Step S1001: For each carrier cell in the target area, execute steps S1002-S1005 respectively;
[0067] Step S1002: Determine the maximum traffic value of the current carrier cell at the next time step;
[0068] Step S1003: Based on the maximum traffic value of the current carrier cell at the next moment, the number of handovers from the current carrier cell to its corresponding neighboring cells, and the ratio between the number of handovers from the current carrier cell to each neighboring cell and the total number of handovers to each neighboring cell, determine the traffic obtained by each neighboring cell from the current carrier cell at the next moment.
[0069] Step S1004: Determine the PRB utilization rate of each neighboring cell of the current carrier cell in the next moment based on the preset weight coefficient, the traffic obtained by each neighboring cell of the current carrier cell from the current carrier cell in the next moment, the current carrier traffic of each neighboring cell of the current carrier cell, and the PRB utilization rate at the current moment.
[0070] Step S1005: Determine the carrier reduction impact information of the current carrier cell based on the PRB utilization rate of each neighboring cell at the next moment and the preset utilization rate threshold.
[0071] When determining the impact information of carrier reduction, the server can simultaneously determine the impact information of carrier reduction for each carrier cell separately; alternatively, it can sort the carrier cells and then determine the impact information of carrier reduction for each carrier cell one by one according to the sorting order. Regardless of which method is used, the following operation is performed for each carrier cell: determine the maximum traffic value of the current carrier cell at the next moment, which can be determined by the average carrier traffic of the current carrier cell after multiple moments and the weighted average of the carrier traffic of the current carrier cell at the same moment in each period.
[0072] Furthermore, the current carrier cell is designated as the cell to be removed from the carrier. Based on the maximum traffic value of the current carrier cell in the next moment, the impact on its neighboring cells after carrier reduction (removal) is determined. Specifically, the number of handovers from the current carrier cell to each of its neighboring cells and the ratio of the number of handovers from the current carrier cell to each of its neighboring cells to the total number of handovers to all neighboring cells are obtained. Using the information such as the maximum traffic value of the current carrier cell in the next moment, the number of handovers from the current carrier cell to each of its corresponding neighboring cells, and the ratio of the number of handovers from the current carrier cell to each of its neighboring cells to the total number of handovers to all neighboring cells, the traffic obtained by each neighboring cell from the current carrier cell in the next moment is calculated using a preset traffic calculation formula. The preset traffic calculation formula is as follows:
[0073]
[0074] Where, d j W represents the traffic received by neighboring cell j from carrier cell i at the next time step. (t+1 p represents the maximum traffic value of carrier cell i at the next time step. ij Let be the number of handovers from carrier cell i to neighboring cell j. Let d be the proportion of handovers from carrier cell i to neighboring cell j to the total number of handovers to all neighboring cells, n be the number of neighboring cells of carrier cell i, and h be the number of handovers. Furthermore, d j This indicates that at the next moment, the traffic received by neighboring cell j from carrier cell i is allocated according to the handover ratio and handover success rate.
[0075] Based on the above formula, the traffic that each neighboring cell of the current carrier cell will receive from the current carrier cell at the next moment can be calculated.
[0076] After obtaining the traffic received by each neighboring cell from the current carrier cell at the next time step, the current carrier traffic and PRB utilization rate of each neighboring cell are obtained, and a preset weighting coefficient is acquired. Based on the preset weighting coefficient, the traffic received by each neighboring cell from the current carrier cell at the next time step, the current carrier traffic, and the PRB utilization rate, the PRB utilization rate of each neighboring cell at the next time step is calculated. Specifically, the preset weighting coefficient, the traffic received by each neighboring cell from the current carrier cell at the next time step, the current carrier traffic, and the PRB utilization rate are input into a preset utilization rate calculation formula to calculate the PRB utilization rate of each neighboring cell at the next time step. In this embodiment, the preset utilization rate calculation formula is as follows:
[0077]
[0078] Where δ is the weighting coefficient, which can be set to 0.5–0.8, to correct the PRB utilization rate prediction of neighboring cells; PRB j (t+1) Let data be the PRB utilization rate of neighboring cell j in the next time step. j (t) For the current carrier traffic of neighboring cell j, d j Let J be the traffic that neighboring cell J of carrier cell i receives from carrier cell i at the next time step.
[0079] After obtaining the PRB utilization rate of each neighboring cell of the current carrier cell at the next time step, a preset utilization rate threshold is obtained. This utilization rate threshold is then compared with the PRB utilization rate of each neighboring cell at the next time step. Based on the comparison results of the PRB utilization rate of each neighboring cell at the next time step with the utilization rate threshold, the carrier reduction impact information of the current carrier cell is determined.
[0080] Repeat the steps described above to determine the carrier reduction impact information of the carrier cell until the carrier reduction impact information of all carrier cells in the target cell is obtained.
[0081] Furthermore, the step of determining the maximum traffic value of the current carrier cell at the next time moment includes:
[0082] Step S10021: Obtain the current carrier traffic of the current carrier cell and the average carrier traffic up to the previous time.
[0083] Step S10022: Determine the average carrier traffic of the current carrier cell based on the current carrier traffic and the average carrier traffic up to the previous time.
[0084] Step S10023: Based on the actual value of carrier traffic in the previous time period, the predicted value of carrier traffic in the previous time period, and the preset moving average coefficient, determine the weighted average value of carrier traffic in the current carrier cell within the preset interval period.
[0085] Step S10024: Determine the maximum traffic value of the current carrier cell at the next moment based on the average carrier traffic and the weighted average carrier traffic.
[0086] When determining the maximum traffic value of the current carrier cell at the next moment, the server can obtain the current carrier traffic of the current carrier cell and the average carrier traffic up to the previous moment. Specifically, the carrier traffic of the current carrier cell at the current moment and the previous n moments can be obtained through the traffic monitoring device, and the average carrier traffic up to the previous moment can be calculated.
[0087] Furthermore, the average carrier traffic of the current carrier cell can be calculated based on the current carrier traffic and the average carrier traffic up to the previous time. Specifically, the current carrier traffic and the average carrier traffic up to the previous time can be input into a preset formula for calculating the average carrier traffic. The preset formula for calculating the average carrier traffic is shown below:
[0088]
[0089] Where W1 is the average carrier traffic of the current carrier cell, and n is the preset number of time intervals. (t+1) W0 represents the average carrier traffic up to the previous time step. t The current carrier traffic of the carrier cell.
[0090] Simultaneously, the server can obtain the actual carrier traffic value and the predicted carrier traffic value of the current carrier cell in the previous time period. The time period can be 1 hour, 1 day (24 hours), etc., and can be set according to actual conditions. Further, a preset moving average coefficient is obtained. In this implementation, the preset moving average coefficient can be set to be greater than 0.5, for example, 0.6, 1.1, 2.2, etc. Further, based on the actual carrier traffic value, the predicted carrier traffic value, and the preset moving average coefficient of the current carrier cell in the previous time period, the weighted average carrier traffic value of the current carrier cell within a preset interval period is calculated. Specifically, the actual carrier traffic value, the predicted carrier traffic value, and the preset moving average coefficient of the current carrier cell in the previous time period are input into the preset weighted average traffic calculation formula to calculate the weighted average carrier traffic value within the preset interval period. The preset weighted average traffic calculation formula can be as follows:
[0091]
[0092] Where W2 is the weighted average of the carrier traffic of the current carrier cell within a preset interval period, and W0 is... (t-1) W2 represents the actual carrier traffic value of the current carrier cell in the previous time period. (t-1) denoted as the predicted carrier traffic value for the current carrier cell in the previous time period, where 'a' is the moving average coefficient.
[0093] Furthermore, the average carrier traffic of the current carrier cell is compared with the weighted average carrier traffic, and the maximum traffic value of the current carrier cell at the next moment is determined based on the comparison result. This allows for the determination of the traffic obtained by each neighboring cell from the current carrier cell at the next moment, based on the maximum traffic value of the current carrier cell at the next moment, the number of handovers from the current carrier cell to its corresponding neighboring cells, and the ratio between the number of handovers from the current carrier cell to each neighboring cell and the total number of handovers to each neighboring cell.
[0094] Further, the step of determining the maximum traffic value of the current carrier cell at the next time moment based on the average carrier traffic and the weighted average carrier traffic includes:
[0095] Step S100241: Compare the average carrier traffic with the weighted average carrier traffic.
[0096] Step S100242: Based on the comparison result, determine the maximum traffic value of the current carrier cell at the next moment from the average carrier traffic and the weighted average carrier traffic.
[0097] When determining the maximum traffic value of a current carrier cell at the next time step based on the average carrier traffic and the weighted average carrier traffic, the average carrier traffic and the weighted average carrier traffic are compared to determine their relative magnitudes, yielding a comparison result. This comparison result includes cases where the average carrier traffic is greater than the weighted average carrier traffic, the average carrier traffic is less than the weighted average carrier traffic, and the average carrier traffic is equal to the weighted average carrier traffic.
[0098] Further, if the comparison result shows that the average carrier traffic is greater than the weighted average carrier traffic, then the average carrier traffic is determined as the maximum traffic value of the current carrier cell at the next time step. If the comparison result shows that the average carrier traffic is less than the weighted average carrier traffic, then the weighted average carrier traffic is determined as the maximum traffic value of the current carrier cell at the next time step. If the comparison result shows that the average carrier traffic is equal to the weighted average carrier traffic, then either the average carrier traffic or the weighted average carrier traffic is determined as the maximum traffic value of the current carrier cell at the next time step. Specifically, the step of determining the maximum traffic value of the current carrier cell at the next time step from the average carrier traffic and the weighted average carrier traffic based on the comparison result can be implemented by the following formula:
[0099] W = max{w1, w2}
[0100] Where W is the maximum traffic value of the current carrier cell at the next moment, W1 is the average carrier traffic, W2 is the weighted average carrier traffic, and max{W1, W2} is the maximum value between W1 and W2.
[0101] Furthermore, the step of determining the carrier reduction impact information of the current carrier cell based on the PRB utilization rate of each neighboring cell at the next time step and a preset utilization threshold includes:
[0102] Step S10051: Compare the PRB utilization rate of each neighboring cell of the current carrier cell at the next time step with a preset utilization rate threshold, and determine the number of neighboring cells whose PRB utilization rate at the next time step is less than the preset utilization rate threshold.
[0103] Step S10052: Determine the carrier reduction impact information of the current carrier cell based on the number of neighboring cells whose PRB utilization rate is less than the preset utilization rate threshold at the next moment.
[0104] After obtaining the PRB utilization rate of each neighboring cell of the current carrier cell at the next time step, a preset utilization threshold is obtained. This threshold is then compared with the PRB utilization rate of each neighboring cell at the next time step to determine the relationship between the PRB utilization rate of each neighboring cell and the preset utilization threshold. Based on this relationship, the number of neighboring cells whose PRB utilization rate at the next time step is less than the preset utilization threshold is determined. Further, based on the number of neighboring cells whose PRB utilization rate at the next time step is less than the preset utilization threshold, the carrier reduction impact information of the current carrier cell is determined. Specifically, the ratio of the number of neighboring cells whose PRB utilization rate at the next time step is less than the preset utilization threshold to the total number of neighboring cells of the current carrier cell is calculated, and the result of this ratio is determined as the carrier reduction impact information of the current carrier cell. The larger the ratio, the less impact carrier reduction will have on neighboring cells under a given load threshold. This indicates a smaller impact of carrier reduction on the original area, making the cell more suitable for reduction; in other words, the lower the impact of carrier reduction. Specifically, the carrier reduction impact information of the current carrier cell can be determined by the following formula, based on the PRB utilization rate of each neighboring cell at the next time step and the preset utilization threshold:
[0105]
[0106] Among them, F i PRB can be used as carrier reduction impact information for carrier cells. j (t+1) Let be the PRB utilization rate of each neighboring cell of the carrier cell at the next time step, Δ be the preset utilization rate threshold, and n be the total number of neighboring cells of the current carrier cell. The function I(x) represents 1 when x is true and 0 otherwise, that is, 1 when the PRB utilization rate is less than the preset utilization rate threshold. The number of 1s obtained is counted as the number of neighboring cells whose PRB utilization rate is less than the preset utilization rate threshold.
[0107] This embodiment determines the carrier reduction impact information of each carrier cell based on the maximum traffic value of each carrier cell in the target area at the next time moment. This allows for subsequent carrier scheduling among the carrier cells based on the carrier reduction impact information of each carrier cell and the carrier demand information of each carrier cell. Therefore, precise carrier scheduling can be performed among the carrier cells, avoiding the problem of low carrier scheduling accuracy caused by manual carrier scheduling based on index evaluation, and effectively improving the accuracy of carrier scheduling.
[0108] Figure 3 This is the third flowchart illustrating the carrier scheduling method provided in this application. (Refer to...) Figure 3In one embodiment, the step of determining the carrier demand information of each carrier cell based on the total waiting time of users in each carrier cell, a preset weighting coefficient, and the PRB utilization rate of each carrier cell includes:
[0109] Step S2001: For each of the carrier cells, execute steps S2002-S2004 respectively;
[0110] Step S2002: Determine the waiting time for GBR users and the waiting time for nonGBR users in the current carrier cell;
[0111] Step S2003: Determine the total waiting time of users in the current carrier cell based on the waiting time of the GBR user, the waiting time of the nonGBR user, and a preset weighting coefficient;
[0112] Step S2004: Determine the carrier demand information of the current carrier cell based on the total waiting time and the PRB utilization rate of the current carrier cell.
[0113] When determining carrier demand information, the server can simultaneously determine the carrier demand information for each carrier cell separately; alternatively, it can sort the carrier cells and then determine the carrier demand information for each carrier cell one by one according to the sorting order. Regardless of the method used, the following operations are performed for each carrier cell: the current carrier cell is designated as a high-load cell, the total number of GBR users and nonGBR users under the current carrier cell are obtained, and the waiting time for each GBR user and each nonGBR user is obtained.
[0114] Furthermore, the waiting time for GBR users in the current carrier cell is calculated using the following formula:
[0115]
[0116] Where T1 is the waiting time for GBR users in the current carrier cell, t i Let u1 be the waiting time for the i-th GBR user, and u1 be the total number of GBR users.
[0117] Furthermore, the waiting time for non-GBR users in the current carrier cell is calculated using the following formula:
[0118]
[0119] Where T2 is the waiting time for nonGBR users in the current carrier cell, t j Let u1 be the waiting time for the j-th nonGBR user, and u2 be the total number of nonGBR users.
[0120] Furthermore, a preset weighting coefficient is obtained. This coefficient can be set based on the emphasis placed on the waiting time of GBR users and non-GBR users; for example, it can be set to 0.7, 0.6, 0.8, etc. Further, based on the waiting time of GBR users and non-GBR users in the current carrier cell, and the preset weighting coefficient, the total waiting time of users in the current carrier cell is determined. Specifically, the waiting time of GBR users and non-GBR users in the current carrier cell, along with the preset weighting coefficient, can be input into the following formula for calculation to obtain the total waiting time of users in the current carrier cell:
[0121] T = δT1 + (1 - δ)T2
[0122] Where T1 is the waiting time of GBR users in the current carrier cell, T2 is the waiting time of nonGBR users in the current carrier cell, δ is the weighting coefficient, and T is the total waiting time of users in the current carrier cell.
[0123] After obtaining the total waiting time of users in the current carrier cell, the total waiting time of users in the current carrier cell can be normalized first, and the carrier demand weight of the current carrier cell can be determined based on the normalized total waiting time and the PRB utilization rate of the current carrier cell as the carrier demand information of the current carrier cell.
[0124] Further, the step of determining the carrier demand information of the current carrier cell based on the total waiting time and the PRB utilization rate of the current carrier cell includes:
[0125] Step S20041: Normalize the total waiting time to obtain the normalized total waiting time;
[0126] Step S20042: Determine the carrier demand information of the current carrier cell based on the normalized total waiting time and the PRB utilization rate of the current carrier cell.
[0127] After obtaining the total waiting time of users in the current carrier cell, the total waiting time of users in the current carrier cell can be normalized according to the following formula:
[0128]
[0129] Among them, tf i Let T be the carrier demand weight of carrier cell i, which is also the carrier demand information of the current carrier cell; T be the total waiting time of users in the current carrier cell; j be the j-th nonGBR user; and n be the number of nonGBR users.
[0130] Further, the PRB utilization rate of the current carrier cell is obtained. Based on the normalized total waiting time and the PRB utilization rate of the current carrier cell, the carrier demand information of the current carrier cell is determined. Specifically, the normalized total waiting time and the PRB utilization rate of the current carrier cell can be input into a preset carrier demand weight calculation formula to calculate the carrier demand weight of the current carrier cell as its carrier demand information. The preset carrier demand weight calculation formula is shown below:
[0131] E i =PRB i *tf i
[0132] Among them, E i The carrier demand weight of the current carrier cell, i.e., the carrier demand information of the current carrier cell, is represented by the PRB. i Let tf be the PRB utilization rate of the i-th carrier cell. i The carrier demand weight of carrier cell i is also the carrier demand information of the current carrier cell.
[0133] Repeat the steps described above to determine the carrier demand information for each carrier cell until the carrier demand information for all carrier cells in the target area is obtained.
[0134] This embodiment determines the carrier demand information of each carrier cell based on the total waiting time of users in each carrier cell, the preset weight coefficient, and the PRB utilization rate of each carrier cell. This facilitates subsequent carrier scheduling among the carrier cells based on the carrier reduction impact information and carrier demand information, thereby achieving accurate carrier scheduling among the carrier cells. This avoids the problem of low carrier scheduling accuracy caused by manual carrier scheduling based on indicator evaluation, and effectively improves the accuracy of carrier scheduling.
[0135] Furthermore, this application also provides a carrier scheduling device.
[0136] Reference Figure 4 , Figure 4 This is a schematic diagram of the functional modules of an embodiment of the carrier scheduling device of this application.
[0137] The carrier scheduling device includes:
[0138] The first determining module 100 is used to determine the carrier reduction impact information of each carrier cell based on the maximum traffic value of each carrier cell in the target area at the next moment;
[0139] The second determining module 200 is used to determine the carrier demand information of each carrier cell based on the total waiting time of users in each carrier cell, the preset weighting coefficient and the PRB utilization rate of each carrier cell.
[0140] The scheduling module 300 is used to perform carrier scheduling among the carrier cells based on the carrier reduction impact information and the carrier demand information.
[0141] The carrier scheduling device provided in this application embodiment determines the carrier reduction impact information and carrier demand information of each carrier cell by comprehensively considering information such as the maximum traffic value of each carrier cell in the next moment in the target area, the total waiting time of users in each carrier cell, the preset weight coefficient and the PRB utilization rate of each carrier cell. It can perform precise carrier scheduling among each carrier cell in the target area, thereby avoiding the problem of low carrier scheduling accuracy caused by manual carrier scheduling based on index evaluation, and effectively improving the accuracy of carrier scheduling.
[0142] In one embodiment, the first determining module 100 is specifically used for:
[0143] For each carrier cell in the target area, perform the following steps respectively:
[0144] Determine the maximum traffic value of the current carrier cell at the next time step;
[0145] Based on the maximum traffic value of the current carrier cell at the next time moment, the number of handovers from the current carrier cell to its corresponding neighboring cells, and the ratio between the number of handovers from the current carrier cell to each neighboring cell and the total number of handovers to each neighboring cell, the traffic obtained by each neighboring cell from the current carrier cell at the next time moment is determined.
[0146] Based on the preset weighting coefficient, the traffic obtained by each neighboring cell of the current carrier cell from the current carrier cell in the next moment, the current carrier traffic of each neighboring cell of the current carrier cell, and the PRB utilization rate of the current moment, determine the PRB utilization rate of each neighboring cell of the current carrier cell in the next moment.
[0147] Based on the PRB utilization rate of each neighboring cell of the current carrier cell at the next time step and the preset utilization rate threshold, determine the carrier reduction impact information of the current carrier cell.
[0148] In one embodiment, the first determining module 100 includes a first determining unit (not shown in the figure), the first determining unit being used to:
[0149] Get the current carrier traffic of the current carrier cell and the average carrier traffic up to the previous time.
[0150] The average carrier traffic of the current carrier cell is determined based on the current carrier traffic and the average carrier traffic up to the previous time.
[0151] Based on the actual carrier traffic value of the current carrier cell in the previous time period, the predicted carrier traffic value in the previous time period, and the preset moving average coefficient, determine the weighted average value of the carrier traffic of the current carrier cell within the preset interval period.
[0152] The maximum traffic value of the current carrier cell at the next moment is determined based on the average carrier traffic and the weighted average carrier traffic.
[0153] In one embodiment, the first determining unit includes a comparison unit (not shown in the figure), the comparison unit being used to:
[0154] Compare the average carrier traffic with the weighted average carrier traffic;
[0155] Based on the comparison results, the maximum traffic value of the current carrier cell at the next moment is determined from the average traffic of the carrier and the weighted average traffic of the carrier.
[0156] In one embodiment, the first determining module 100 includes a second determining unit (not shown in the figure), the second determining unit being used for:
[0157] The PRB utilization rate of each neighboring cell of the current carrier cell at the next time step is compared with a preset utilization threshold to determine the number of neighboring cells whose PRB utilization rate at the next time step is less than the preset utilization threshold.
[0158] The carrier reduction impact information of the current carrier cell is determined based on the number of neighboring cells whose PRB utilization rate is less than the preset utilization rate threshold at the next moment.
[0159] In one embodiment, the second determining module 200 is specifically used for:
[0160] For each of the aforementioned carrier cells, the following steps shall be performed respectively:
[0161] Determine the waiting time for GBR users and nonGBR users in the current carrier cell;
[0162] The total waiting time of users in the current carrier cell is determined based on the waiting time of the GBR users, the waiting time of the nonGBR users, and a preset weighting coefficient.
[0163] Based on the total waiting time and the PRB utilization rate of the current carrier cell, the carrier demand information of the current carrier cell is determined.
[0164] In one embodiment, the second determining module 200 includes a normalization unit (not shown in the figure), the normalization unit being used for:
[0165] The total waiting time is normalized to obtain the normalized total waiting time;
[0166] Based on the normalized total waiting time and the PRB utilization rate of the current carrier cell, determine the carrier demand information of the current carrier cell.
[0167] Figure 5 An example is a schematic diagram of the physical structure of an electronic device, such as... Figure 5 As shown, the electronic device may include: a processor 810, a communication interface 820, a memory 830, and a communication bus 840, wherein the processor 810, the communication interface 820, and the memory 830 communicate with each other via the communication bus 840. The processor 810 can call a computer program in the memory 830 to execute the steps of a carrier scheduling method, such as including:
[0168] The carrier reduction impact information of each carrier cell is determined based on the maximum traffic value of each carrier cell in the target area at the next time moment;
[0169] Based on the total waiting time of users in each carrier cell, the preset weighting coefficient, and the physical resource module (PRB) utilization rate of each carrier cell, the carrier demand information of each carrier cell is determined.
[0170] Carrier scheduling is performed among the carrier cells based on the carrier reduction impact information and the carrier demand information.
[0171] Furthermore, the logical instructions in the aforementioned memory 830 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0172] On the other hand, embodiments of this application also provide a computer storage medium, which is a computer-readable storage medium storing a computer program. The computer program is used to cause a processor to execute the steps of the methods provided in the above embodiments, for example including:
[0173] The carrier reduction impact information of each carrier cell is determined based on the maximum traffic value of each carrier cell in the target area at the next time moment;
[0174] Based on the total waiting time of users in each carrier cell, the preset weighting coefficient, and the physical resource module (PRB) utilization rate of each carrier cell, the carrier demand information of each carrier cell is determined.
[0175] Carrier scheduling is performed among the carrier cells based on the carrier reduction impact information and the carrier demand information.
[0176] The computer-readable storage medium can be any available medium or data storage device that the processor can access, including but not limited to magnetic storage (e.g., floppy disk, hard disk, magnetic tape, magneto-optical disk (MO)), optical storage (e.g., CD, DVD, BD, HVD), and semiconductor storage (e.g., ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state drive (SSD)).
[0177] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.
[0178] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.
[0179] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit them. Although this application 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 of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of this application.
Claims
1. A carrier scheduling method, characterized by, include: For each carrier cell in the target area, the following steps are performed to determine the carrier reduction impact information of each carrier cell: Based on the maximum traffic value of the current carrier cell at the next moment, the number of handovers from the current carrier cell to its corresponding neighboring cells, and the ratio between the number of handovers from the current carrier cell to each neighboring cell and the total number of handovers to each neighboring cell, the traffic obtained by each neighboring cell from the current carrier cell at the next moment is determined; Based on the preset weighting coefficient, the traffic obtained by each neighboring cell from the current carrier cell at the next moment, the current carrier traffic of each neighboring cell, and the PRB utilization rate at the current moment, the PRB utilization rate of each neighboring cell at the next moment is determined. The number of neighboring cells whose PRB utilization rate is less than the preset utilization rate threshold at the next moment is compared with the total number of neighboring cells of the current carrier cell. The result of the ratio calculation is determined as the carrier reduction impact information of the current carrier cell. For each carrier cell, the following steps are performed to determine the carrier demand information of each carrier cell: based on the waiting time of GBR users and the waiting time of nonGBR users in the current carrier cell, and a preset weighting coefficient, the total waiting time of users in the current carrier cell is determined; The total waiting time is normalized, and the normalized total waiting time is multiplied by the PRB utilization rate of the current carrier cell to obtain the carrier demand information of the current carrier cell. Carrier scheduling is performed among the carrier cells based on the carrier reduction impact information and the carrier demand information.
2. The carrier scheduling method of claim 1, wherein, The maximum traffic value of the current carrier cell at the next moment is determined by the following steps: Get the current carrier traffic of the current carrier cell and the average carrier traffic up to the previous time. The average carrier traffic of the current carrier cell is determined based on the current carrier traffic and the average carrier traffic up to the previous time. Based on the actual carrier traffic value of the current carrier cell in the previous time period, the predicted carrier traffic value in the previous time period, and the preset moving average coefficient, determine the weighted average value of the carrier traffic of the current carrier cell within the preset interval period. The maximum traffic value of the current carrier cell at the next moment is determined based on the average carrier traffic and the weighted average carrier traffic.
3. The carrier scheduling method according to claim 2, characterized in that, The step of determining the maximum traffic value of the current carrier cell at the next moment based on the average carrier traffic and the weighted average carrier traffic includes: Compare the average carrier traffic with the weighted average carrier traffic; Based on the comparison results, the maximum traffic value of the current carrier cell at the next moment is determined from the average traffic of the carrier and the weighted average traffic of the carrier.
4. The carrier scheduling method according to claim 1, characterized in that, The step of calculating the ratio of the number of neighboring cells whose PRB utilization rate is less than a preset utilization rate threshold at the next moment to the total number of neighboring cells of the current carrier cell, and determining the result of the ratio calculation as the carrier reduction impact information of the current carrier cell, includes: The PRB utilization rate of each neighboring cell of the current carrier cell at the next time step is compared with a preset utilization threshold to determine the number of neighboring cells whose PRB utilization rate at the next time step is less than the preset utilization threshold. The ratio of the number of neighboring cells whose PRB utilization rate is less than the preset utilization rate threshold at the next moment to the total number of neighboring cells of the current carrier cell is calculated as the carrier reduction impact information of the current carrier cell.
5. A carrier scheduling device, characterized in that, include: The first determining module is used to perform the following steps for each carrier cell in the target area to determine the carrier reduction impact information of each carrier cell: based on the maximum traffic value of the current carrier cell at the next moment, the number of handovers from the current carrier cell to its corresponding neighboring cells, and the ratio between the number of handovers from the current carrier cell to each neighboring cell and the total number of handovers to each neighboring cell, determine the traffic obtained by each neighboring cell from the current carrier cell at the next moment; and based on the preset weighting coefficient, the traffic obtained by each neighboring cell from the current carrier cell at the next moment, the current carrier traffic of each neighboring cell, and the PRB utilization rate at the current moment, determine the PRB utilization rate of each neighboring cell at the next moment. The number of neighboring cells whose PRB utilization rate is less than the preset utilization rate threshold at the next moment is compared with the total number of neighboring cells of the current carrier cell. The result of the ratio calculation is determined as the carrier reduction impact information of the current carrier cell. The second determining module is used to perform the following steps for each of the carrier cells to determine the carrier demand information of each carrier cell: based on the waiting time of GBR users and the waiting time of nonGBR users in the current carrier cell, and a preset weighting coefficient, determine the total waiting time of users in the current carrier cell; The total waiting time is normalized, and the normalized total waiting time is multiplied by the PRB utilization rate of the current carrier cell to obtain the carrier demand information of the current carrier cell. The scheduling module is used to perform carrier scheduling among the carrier cells based on the carrier reduction impact information and the carrier demand information.
6. An electronic device comprising a processor and a memory storing a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the carrier scheduling method according to any one of claims 1 to 4.
7. A computer storage medium, wherein the computer storage medium is a computer-readable storage medium, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the carrier scheduling method according to any one of claims 1 to 4.
Citation Information
Patent Citations
Carrier scheduling method and device, computing equipment and computer storage medium
CN113055892A
Evaluation method for LTE network carrier scheduling capacity reduction cell
CN113079520A
