Power distribution method, electronic equipment and readable storage medium

Abstract

The invention discloses a power distribution method, electronic equipment and a readable storage medium, and belongs to the field of communication. The method comprises the following steps: acquiring a plurality of predicted load values of a plurality of cells to be distributed; the plurality of cells to be allocated are a plurality of cells under the same base station; the plurality of predicted load values comprise the predicted load value of each to-be-allocated cell in the plurality of to-be-allocated cells, and the predicted load value is the predicted load value of the to-be-allocated cell at the next time point of the current time point; and performing power distribution on the plurality of cells to be distributed based on the plurality of predicted load values.

Description

Technical Field

[0001] This application belongs to the field of communications, specifically relating to a power distribution method, an electronic device, and a readable storage medium. Background Technology

[0002] Currently, many communication technologies are characterized by strong bursts of power, such as Long-Term Evolution (LTE) and New Radio (NR). This characteristic leads to power fluctuations with moments of instantaneous fullness and momentary idleness. To address this, an effective power allocation scheme can improve power utilization and avoid power waste.

[0003] In the process of power allocation, the relevant technologies usually allocate power to the cells to be allocated based on the current power utilization and bandwidth of the cells. However, the power allocation results obtained by this method are not ideal. Summary of the Invention

[0004] This application provides a power allocation method, an electronic device, and a readable storage medium, which can solve the problem of unsatisfactory power allocation results in related technologies.

[0005] In a first aspect, embodiments of this application provide a power allocation method, including: Obtain multiple predicted load values ​​for multiple cells to be allocated; the multiple cells to be allocated are multiple cells under the same base station; the multiple predicted load values ​​include the predicted load value of each cell to be allocated, and the predicted load value is the predicted load value of the cell to be allocated at the next time point of the current time point; Based on the multiple predicted load values, power allocation is performed on the multiple cells to be allocated.

[0006] In a second aspect, embodiments of this application provide an electronic device including a processor and a memory, wherein the memory stores programs or instructions executable on the processor, and the programs or instructions, when executed by the processor, implement the steps of the method described in the first aspect.

[0007] Thirdly, embodiments of this application provide a readable storage medium on which a program or instructions are stored, which, when executed, implement the steps of the method described in the first aspect.

[0008] Fourthly, embodiments of this application provide a computer program product comprising a computer program that, when executed by a processor, implements the steps of the method described in the first aspect.

[0009] The at least one technical solution provided in the embodiments of this application can achieve the following technical effects: In this embodiment, multiple predicted load values ​​of multiple cells to be allocated are obtained; the multiple cells to be allocated are multiple cells under the same base station; the multiple predicted load values ​​include the predicted load value of each of the multiple cells to be allocated, and the predicted load value is the predicted load value of the cell to be allocated at the next time point from the current time point; based on the multiple predicted load values, power allocation is performed on the multiple cells to be allocated. Thus, compared with related technologies that allocate power based on the current power utilization and bandwidth of the cells, the related technologies cannot predict the load situation of the cells at the next time point, resulting in a lag. However, this embodiment can allocate power to multiple cells to be allocated based on the predicted load information of the cells to be allocated at the next time point, eliminating the lag in power allocation and solving the problem of unsatisfactory power allocation results obtained in related technologies. Attached Figure Description

[0010] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0011] Figure 1 This is a flowchart of a power allocation method provided in an embodiment of this application; Figure 2 This is a flowchart of another power allocation method provided in an embodiment of this application; Figure 3 This is a flowchart of another power allocation method provided in an embodiment of this application; Figure 4 A detailed flowchart of a power allocation method provided in an embodiment of this application; Figure 5 This is a structural block diagram of a power distribution device provided in an embodiment of this application; Figure 6 This is a structural block diagram of an electronic device provided in an embodiment of this application. Detailed Implementation

[0012] The technical solutions of the embodiments of this application will be clearly described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this application. 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.

[0013] The terms "first," "second," etc., used in the specification and claims of this application are used to distinguish similar objects and not to describe a specific order or sequence. It should be understood that such use of data can be interchanged where appropriate so that embodiments of this application can be implemented in orders other than those illustrated or described herein, and the objects distinguished by "first," "second," etc., are generally of the same class and the number of objects is not limited; for example, a first object can be one or more. Furthermore, in the specification and claims, "and / or" indicates at least one of the connected objects, and the character " / " generally indicates that the preceding and following objects are in an "or" relationship.

[0014] Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0015] The power allocation method provided in this application is applied to power allocation technology in communication base stations, for example, it can be applied to power allocation technology in LTE or NR communication networks. For multiple cells to be allocated under the same communication base station, the power of the multiple cells to be allocated can be dynamically allocated by predicting the predicted load value of each cell at the next time point. In this application embodiment, the power can be the transmit power of the communication base station.

[0016] The power allocation method provided in this application can be executed by a target device, which can be a single electronic device or multiple electronic devices. Specifically, the power allocation method can be executed by a single electronic device, such as a desktop computer, laptop computer, mobile phone, or tablet, or a server, such as a standalone physical server, a server cluster consisting of multiple servers, or a cloud server capable of cloud computing. For example, the target device may include a baseband unit (BBU) on the base station side, through which power allocation can be implemented. When the power allocation method provided in this application is executed by multiple electronic devices, these multiple electronic devices can form a service cluster, cooperating with each other to complete the various steps.

[0017] The power allocation method provided in this application will be described in detail below with reference to the accompanying drawings, through specific embodiments and application scenarios.

[0018] Please see Figure 1 , Figure 1This is a flowchart illustrating a power allocation method provided in an embodiment of this application. Figure 1 As shown, the method includes the following steps: Step 110: Obtain multiple predicted load values ​​for multiple cells to be allocated; the multiple cells to be allocated are multiple cells under the same base station; the multiple predicted load values ​​include the predicted load value of each cell to be allocated, and the predicted load value is the predicted load value of the cell to be allocated at the next time point of the current time point.

[0019] In this embodiment, the cell to be allocated can be a communication cell. For the same base station, by deploying multiple sets of antennas or multi-port antennas, multiple different, independent logical coverage areas covering different directions can be created, and each logical coverage area can be understood as a communication cell. For example, a common three-sector base station can divide the 360-degree horizontal coverage area of ​​a base station into three 120-degree sectors. This embodiment does not limit the load type of the predicted load value. Physical Resource Block (PRB) utilization is the most direct and core indicator for measuring cell capacity load. The following examples use predicted load value to illustrate the predicted PRB utilization. However, it should be noted that the load in this embodiment can also use other load parameters, such as power utilization rate and throughput rate.

[0020] In this embodiment, a load forecasting mechanism at the Transmission Time Interval (TTI) level is provided. TTI is the basic time unit for scheduling and transmission in wireless communication. In this embodiment, TTI can be understood as the data transmission cycle of a cell, and the power allocation cycle can also be TTI. The time difference between the next time point and the current time point can be one TTI; that is, the next time point can be the moment of the next TTI after the current time point. However, it should be noted that this is only an example, and this embodiment does not limit the interval between the next time point and the current time point to one TTI.

[0021] Step 120: Based on the multiple predicted load values, perform power allocation on the multiple cells to be allocated.

[0022] In this embodiment, for the same base station, its power can be intelligently allocated to each cell. Power allocation determines power consumption; the more power allocated to a cell, the greater its power consumption. During the power allocation process for the multiple cells to be allocated, for example, at least a portion of the power of the cell with the lowest predicted load value can be allocated to the cell with the highest predicted load value. That is, at least a portion of the power originally allocated to the cell with the lowest predicted load value is allocated to the cell with the highest predicted load value, thereby improving the power utilization of the cell with the lowest predicted load value and preventing low-load cells from having idle power while high-load cells remain fully occupied.

[0023] In this embodiment, multiple predicted load values ​​of multiple cells to be allocated are obtained; the multiple cells to be allocated are multiple cells under the same base station; the multiple predicted load values ​​include the predicted load value of each of the multiple cells to be allocated, and the predicted load value is the predicted load value of the cell to be allocated at the next time point from the current time point; based on the multiple predicted load values, power allocation is performed on the multiple cells to be allocated. Thus, compared with related technologies that allocate power based on the current power utilization and bandwidth of the cells, the related technologies cannot predict the load situation of the cells at the next time point, resulting in a lag. However, this embodiment can allocate power to multiple cells to be allocated based on the predicted load information of the cells to be allocated at the next time point, eliminating the lag in power allocation and solving the problem of unsatisfactory power allocation results obtained in related technologies.

[0024] In one embodiment of this application, for any one of the plurality of cells to be allocated, the predicted load value of the cell to be allocated is obtained based on the target load value of the cell to be allocated at the next time point, where the target load value can be understood as a reserved load value; the target load value of the cell to be allocated is the sum of a first ratio and a second ratio. The first ratio is the proportion of load occupied by users waiting for scheduling in the cell to be allocated at the current time point, and the second ratio is the proportion of waiting time for users using Guaranteed Bit Rate (GBR) services in the cell to be allocated at the current time point. In this way, the predicted load value of the cell to be allocated also considers the proportion of load occupied by users waiting for scheduling and the proportion of waiting time for users using GBR services. The predicted load value obtained in this way can better reflect the load situation of the cell to be allocated at the next time point.

[0025] In this application embodiment, the GBR service can be understood as a specific service. Once a user uses the GBR service, a dedicated, fixed bandwidth is provided to that user. Even if there is no data transmission for the service temporarily, this resource is reserved and will not be occupied by other users. By pre-allocating network resources, a minimum bit rate is maintained during data transmission, ensuring stable data transmission even during network congestion. In other words, users of the GBR service have priority in network resources, and their minimum network speed is guaranteed first.

[0026] In this embodiment of the application, the predicted load value of the cell to be allocated can be the sum of the target load value and the estimated load value of the cell to be allocated at the next time point. For example, the predicted load value of the cell to be allocated can be obtained by the following formula: .in, This is used to represent the predicted load value of the cell to be allocated at the next time point. This is used to indicate the estimated load value of the cell to be allocated at the next time point. This is used to represent the target load value of the cell to be allocated at the next time point. However, it should be noted that the predicted load value of the cell to be allocated in this embodiment is not limited to the target load value of the cell to be allocated, nor is it limited to the combination of the target load value and the estimated load value of the cell to be allocated. For example, the estimated load value of the cell to be allocated at the next time point can be directly determined as the predicted load value of the cell to be allocated.

[0027] The estimated load value of the cell to be allocated is, for example, the estimated PRB utilization rate. The estimated PRB utilization rate of the cell to be allocated is obtained by: obtaining the current PRB utilization rate, the historical average PRB utilization rate, and the load correction value of the cell at the current time point; and predicting the estimated PRB utilization rate of the cell at the next time point based on the current PRB utilization rate, the historical average PRB utilization rate, and the load correction value.

[0028] For example, predicting the estimated PRB utilization of the cell to be allocated at the next time point based on the current PRB utilization, the historical average PRB utilization, and the load correction value includes: obtaining the estimated PRB utilization of the cell to be allocated at the next time point based on the current PRB utilization, the historical average PRB utilization, and the load correction value using the following formula: ; in, The value t represents the estimated PRB utilization rate, and t represents the current time point. Used to represent the historical average PRB utilization rate Used to represent the current PRB utilization rate This is used to represent the load correction value of the cell to be allocated at the current time point. The load correction value can be a load error correction value at the TTI level, which numerically represents the average error between the actual load (actual PRB utilization) and the expected load (estimated PRB utilization) of the cell to be allocated at t historical time points.

[0029] Specifically, the load adjustment value of the cell to be allocated at the current time can be obtained based on the estimated PRB utilization rate of the cell at historical time points and the actual PRB utilization rate of the cell at historical time points. For example, the load adjustment value of the cell to be allocated at the current time point is obtained by the following formula: ; in, The value used to represent the load correction is t, which represents the current time point, and i represents the historical time point i. Used to represent the estimated PRB utilization rate at the historical time point i. The value used to represent the actual PRB utilization rate at the historical time point i is a positive integer less than or equal to t.

[0030] For example, the target load value for the cell to be allocated is obtained using the following formula: ; in, Used to represent the target load value of the cell to be allocated. This indicates the number of users waiting for scheduling in the cell to be allocated at the current time. This is used to represent the total number of service users in the cell to be assigned at the current time. Used to represent the PRB utilization rate of the cell to be allocated. This represents the waiting time for the i-th user in the cell to be assigned. The value of m represents the waiting time for the j-th user using GBR services in the cell to be allocated, and m represents the number of users using GBR services in the cell to be allocated. The target load value of the cell to be allocated is the sum of the load proportion occupied by users waiting for scheduling and the waiting time proportion of users using GBR services, used to reserve resources.

[0031] Among them, the users waiting for scheduling can be those users in the cell to be allocated who are waiting for resource scheduling. The scheduling time of the i-th user can be the time delay experienced by the i-th user waiting for base station scheduling, that is, the time delay experienced from the time the i-th user sends a scheduling request to the base station and prepares the data packet for transmission, to the time delay experienced by the data packet actually being scheduled by the base station for data transmission. The GBR service in this embodiment can be understood as a specific service. Once a user uses the GBR service, a portion of dedicated, fixed bandwidth can be provided to that user. Even if there is no data transmission for the service temporarily, this portion of resources will be reserved and will not be occupied by other users. Specifically, please refer to the previous introduction of GBR users.

[0032] In this embodiment of the application, a load forecasting mechanism at the TTI level is provided. At a given time point t, by using scheduling information and time slot-level traffic PRB information for prediction, the scheduling information of all cells under the same base station at the next time point can be determined.

[0033] Please see Figure 2 , Figure 2 This is a flowchart of another power allocation method provided in an embodiment of this application. For example... Figure 2 As shown, the method includes the following steps: Step 210: Obtain multiple predicted load values ​​for multiple cells to be allocated; the multiple cells to be allocated are multiple cells under the same base station; the multiple predicted load values ​​include the predicted load value of each cell to be allocated, and the predicted load value is used to represent the predicted load information of the cell to be allocated at the next time point of the current time point.

[0034] Step 220: Determine a first type of cell and a second type of cell from the plurality of cells to be allocated, wherein the predicted load value of the first type of cell is less than a threshold and the predicted load value of the second type of cell is greater than the threshold.

[0035] In this embodiment, the predicted load value is, for example, the predicted PRB load value. For any one of the plurality of cells to be allocated, if the predicted load value of the cell is less than a threshold, it indicates that the cell is a low-utilization cell, and power adjustment can be performed on the cell, that is, the idle power of the cell can be allocated to other cells. If the predicted load value of the cell is greater than the threshold, the load of the cell will continue to increase, and power adjustment can be performed on the cell, that is, the power of other idle cells can be allocated to the cell. If there are cells among the plurality of cells to be allocated whose predicted load value is equal to the threshold, power allocation can be left to these cells, and the status quo can be maintained.

[0036] Step 230: Allocate the idle power of the first type of cell to the second type of cell.

[0037] In this embodiment of the application, the specific power allocation scheme is not limited in the process of allocating the idle power of the first type of cells to the second type of cells. For example, for any one first cell in the first type of cells, at least a portion of the idle power of the first cell can be allocated to one or more second cells in the second type of cells, or the idle power of one or more first cells in the first type of cells can be allocated to one or more second cells in the second type of cells.

[0038] In this embodiment, a first type of cell and a second type of cell are obtained through threshold division. The first type of cell can be understood as a low-load cell, and the second type of cell can be understood as a high-load cell. By allocating the idle power of the first type of cell to the second type of cell, it is possible to allocate the idle power of the low-load cell to the high-load cell.

[0039] In one embodiment of this application, the first type of cells includes N first cells, and the second type of cells includes M second cells. Step 230, allocating idle power from the first type of cells to the second type of cells, includes: obtaining M power demand values ​​from the M second cells, wherein the M power demand values ​​include the power demand value of each of the M second cells; determining a target second cell from the M second cells in descending order of power demand values; determining K first cells from the N first cells based on the power demand value of the target second cell; and allocating the idle power of the K first cells to the target second cells; wherein N and M are both positive integers, and K is a positive integer less than or equal to N.

[0040] In this embodiment of the application, the target second cell may be one or more cells; the following examples all use a single target second cell as an example. When the target second cell is a single cell, it may be the second cell with the highest power demand among the M second cells. Priority can be given to meeting the power demand of the target second cell to avoid a continuous increase in the load of the target second cell and a worse user experience for its users.

[0041] The K first cells may be one or more first cells. In the process of allocating the idle power of the K first cells to the target second cell, all the idle power of the K first cells may be allocated to the target second cell, or a portion of the idle power of the K first cells may be allocated to the target second cell. No restriction is imposed here.

[0042] In this embodiment of the application, during the process of allocating the idle power of the first type of cell to the second type of cell, the idle power of the first type of cell can be preferentially allocated to the target second cell with a high power demand value in the second type of cell, thereby improving the network environment of the target second cell and avoiding the continuous increase of the load of the target second cell.

[0043] The following describes one method for determining the power demand value of a second cell. In one embodiment of this application, obtaining the M power demand values ​​of the M second cells includes: for the j-th second cell among the M second cells, obtaining the second allocation ratio of the j-th second cell and the second power utilization rate of the j-th second cell at the current time point; determining the power demand value of the j-th second cell by multiplying the second allocation ratio and the second power utilization rate; and obtaining M power demand values ​​based on the M second cells. Where j is a positive integer less than or equal to M.

[0044] In this embodiment of the application, based on the M power demand values, a power adjustment input list as shown in the following formula can be obtained: .in, Used to indicate that the power adjustment is included in the list. Used to represent the power demand value of the j-th second cell, Used to represent the second power utilization rate of the j-th second cell Used to represent the second allocation ratio of the j-th second cell. Used to represent the predicted load value of the j-th second cell, This is used to represent the threshold. The threshold can be configured and adjusted according to the actual power distribution scenario, and there is no limitation on the specific range of the threshold value here.

[0045] The second allocation ratio of the j-th second cell is obtained based on the second target information of the j-th second cell. The second target information includes at least one of the following: the second weight of the j-th second cell, the second power utilization rate, the second predicted load value of the j-th second cell at the next time point, the expected load value of the j-th second cell at the current time point, and the load difference of the j-th second cell at the current time point. The second weight of the j-th second cell can be a preset weight value, or the second weight of the j-th second cell can be obtained based on the proportion of the low-order modulation and coding scheme (MCS) of the j-th second cell. For details on the updating of the second weight, please refer to the following section on the second weight.

[0046] For example, the second target information includes the second weight of the j-th second cell, the second power utilization rate, the second predicted load value of the j-th second cell at the next time point, the expected load value of the j-th second cell at the current time point, and the load difference of the j-th second cell at the current time point. The second allocation ratio of the j-th second cell can be obtained by the following formula: ; in, Used to represent the second allocation ratio. Used to represent the second weight, Used to represent the expected load value Used to represent the load difference. Used to represent the second power utilization rate, Used to represent the second predicted load value.

[0047] The load difference can be the difference between the load value of the j-th second cell at the current time and the threshold. A larger load difference indicates that the j-th second cell requires more power regulation input. Here, the load is, for example, the PRB utilization rate; that is, the load difference of the j-th second cell can be the difference between the PRB utilization rate of the j-th second cell at the current time and the threshold. Specifically, the load difference is obtained using the following formula: ;in, Used to represent the load difference. This is used to represent the PRB utilization rate of the j-th second cell at the current time point. Used to represent the threshold.

[0048] Furthermore, the expected load value of the j-th second cell is obtained based on the target load information of the j-th second cell. The target load information includes at least one of the following: the average throughput of the j-th second cell in the current allocation period, the total traffic of the j-th second cell in the current allocation period, the total traffic of low-quality MCS users in the j-th second cell in the current allocation period, the total traffic of users waiting to be scheduled in the j-th second cell in the current allocation period, the number of users waiting to be scheduled, the number of low-quality MCS users, and the PRB utilization rate of the j-th second cell at the current time point.

[0049] The current allocation period refers to the time period between the current time point and the previous time point, with a duration of TTI. Low-quality MCS users refer to users with poor wireless channel quality who communicate using low-quality MCS strategies; these can be understood as users with low bit error rate or perceived speed. Traffic refers to the amount of data transmitted. For example, the total traffic of the j-th second cell in the current allocation period can be the total amount of data transmitted by users in the j-th second cell during the current allocation period, and so on for other total traffic. Throughput refers to the data transmission rate; the average throughput of the j-th second cell in the current allocation period can be the average data transmission rate of the j-th second cell during the current allocation period.

[0050] For example, the target load information may include the average throughput of the j-th second cell at the current time, the total traffic of the j-th second cell at the current time, the total traffic of low-quality MCS users in the j-th second cell at the current time, the total traffic of users waiting to be scheduled in the j-th second cell at the current time, the number of users waiting to be scheduled, the number of low-quality MCS users, and the PRB utilization rate of the j-th second cell at the current time. The expected load value of the j-th second cell can be obtained by the following formula: ; in, Used to represent the expected load value of the j-th second cell, Used to represent the average throughput. This is used to represent the total traffic of the j-th second cell at the current time. Used to represent the total traffic of the low-quality users in the MCS. Used to represent the total traffic of the users waiting to be scheduled. This is used to represent the number of users waiting to be scheduled. This is used to represent the number of low-quality users in the MCS. This is used to indicate the PRB utilization rate of the cell to be allocated.

[0051] In this embodiment, the power allocation ratio of the second cell can be dynamically configured based on data such as cell traffic and cell load, i.e., the second allocation ratio, according to the above method. Compared with the method of setting static parameters in related technologies, this embodiment can realize dynamic power adjustment and has better flexibility.

[0052] For reference Figure 3 , Figure 3 This is a flowchart of another power allocation method provided in an embodiment of this application. For example... Figure 3 As shown, the method includes the following steps: Step 310: Obtain multiple predicted load values ​​for multiple cells to be allocated.

[0053] The plurality of cells to be allocated are multiple cells under the same base station; the plurality of predicted load values ​​include the predicted load value of each of the plurality of cells to be allocated, and the predicted load value is used to represent the predicted load information of the cell to be allocated at the next time point of the current time point.

[0054] Step 320: Determine a first type of cell and a second type of cell from the plurality of cells to be allocated; the predicted load value of the first type of cell is less than a threshold, and the predicted load value of the second type of cell is greater than the threshold; the first type of cell includes N first cells, and the second type of cell includes M second cells.

[0055] Where N and M are both positive integers.

[0056] Step 330: Obtain the M power demand values ​​of the M second cells.

[0057] Step 340: Determine the target second cell from the M second cells in descending order of power demand values.

[0058] In this embodiment, the M power demand values ​​of the M second cells can form a power adjustment entry list. The M power demand values ​​in the power adjustment entry list can be sorted in descending order of power demand. Taking a single target second cell as an example, the first second cell in the power adjustment entry list can be determined as the target second cell. For example, the sorted power adjustment entry list is as follows: Then the second cell at the top of the table can be... The second target community has been identified.

[0059] Step 350: Obtain the N idle power values ​​of the N first cells.

[0060] Wherein, K is a positive integer less than or equal to N, and the N idle power values ​​include the idle power value of each of the N first cells.

[0061] In one embodiment of this application, step 350, obtaining N idle power values ​​for the N first cells, includes: for the i-th first cell among the N first cells, obtaining a first allocation ratio and a first power utilization rate of the i-th first cell at the current time point; determining the idle power value of the i-th first cell by multiplying the first allocation ratio and the first power utilization rate; and obtaining N idle power values ​​based on the N first cells. Where i is a positive integer less than or equal to N.

[0062] In this embodiment of the application, based on the M power demand values, a power adjustment list as shown in the following formula can be obtained: ;in, Used to indicate the power adjustment list. Used to represent the idle power value of the i-th first cell, Used to represent the first power utilization rate of the i-th first cell. Used to represent the first allocation ratio of the i-th first cell. Used to represent the predicted load value of the i-th first cell, Used to represent the threshold.

[0063] The first allocation ratio of the i-th first cell is obtained based on the first target information of the i-th first cell. The first target information includes at least one of the first weight of the i-th first cell, the first power utilization rate, the idle load value of the i-th first cell at the current time point, and the first predicted load value of the i-th first cell at the next time point. The first weight of the i-th first cell can be a preset weight value, or the first weight of the i-th first cell can be obtained based on the low-order MCS ratio of the i-th second cell. For details on the updating of the first weight, please refer to the following section on the updating of the first weight.

[0064] For example, the first allocation ratio of the i-th first cell is obtained by the following formula: ; in, Used to represent the first allocation ratio. Used to represent the first weight, Used to represent the idle load value Used to represent the first power utilization rate This is used to represent the first predicted load value. The above formula shows that: the first allocation ratio is directly proportional to the spare load of the i-th first cell, the first allocation ratio is directly proportional to the first power utilization rate of the i-th first cell, and the first allocation ratio is inversely proportional to the first predicted load value of the i-th first cell.

[0065] Step 360: Select K first cells from the N first cells in descending order of idle power value, such that the sum of the idle power values ​​of the K first cells is greater than or equal to the power demand value of the target second cell, and the sum of the idle power values ​​of the first K-1 first cells among the K first cells is less than the power demand value.

[0066] In this embodiment of the application, the N idle power values ​​of the N second cells can be used to form a power adjustment list, denoted as The M idle power values ​​in the power adjustment list can be sorted in descending order of their idle power values. Cells 1, 2, ..., K can be sequentially identified from the power adjustment list such that: ; ; in, Used to represent the idle power values ​​of cells 1 to K-1 and cell K, respectively. Used to represent the power requirement value of the target second cell.

[0067] Step 370: Allocate the idle power of the K first cells to the target second cell.

[0068] In this embodiment, if the sum of the idle power values ​​of the K first cells equals the power requirement of the target second cell, then all the idle power of the K first cells can be allocated to the target second cell. If the sum of the idle power values ​​of the K first cells is greater than the power requirement of the target second cell, power equal to the power requirement can be selected from the idle power of the K first cells and allocated to the target second cell. This embodiment does not limit the selection scheme of this power; that is, a portion of power can be selected from each first cell and allocated to the target second cell, or all the idle power of the first K-1 first cells can be allocated to the target second cell, reserving a portion of the idle power of the Kth first cell.

[0069] For example, in one embodiment of this application, step 340, determining the target second cell from the M second cells, includes: determining the second cells in an unallocated state from the M second cells. Step 360, selecting K first cells from the N first cells, includes: selecting the K first cells in an unallocated state from the N first cells. Step 370, allocating the idle power of the K first cells to the target second cell, includes: if the sum of the idle power values ​​of the K first cells is greater than the power demand value, allocating all the idle power of the first K-1 first cells in descending order of idle power value to the target second cell, and allocating a portion of the idle power of the Kth first cell in the K first cells to the target second cell; marking both the target second cell and the first K-1 first cells as allocated; and updating the idle power value of the Kth first cell in the K first cells.

[0070] In this embodiment of the application, when the sum of the idle power values ​​of the K first cells is equal to the power demand value, the idle power of the K first cells can be directly allocated to the target second cell, and the target second cell and the K first cells can all be marked as allocated.

[0071] In this embodiment, any one of the N first cells is either in an unallocated state or an allocated state. Similarly, any one of the M second cells is either in an unallocated state or an allocated state. Before allocating idle power from the first type of cells to the second type of cells, both the N first cells and the M second cells are in an unallocated state by default.

[0072] The updated idle power value of the Kth first cell can be the difference between the sum of the idle power values ​​of the K first cells and the power demand value. Specifically, refer to the following formula: ; in, Used to represent the updated idle power value of the Kth first cell. Used to represent the original idle power values ​​of cells 1 to K-1 and cell K, respectively. The value used to represent the power demand of the target second cell is the original idle power value, which refers to the idle power value when no power allocation has been performed.

[0073] After updating the idle power value of the Kth first cell, since the first K-1 cells out of the K first cells have all been allocated to the target second cell, the first K-1 first cells can be marked as allocated and removed from the power adjustment-out list. Simultaneously, since the updated idle power value of the Kth first cell is the difference between the sum of the idle power values ​​of the K first cells and the power demand value, indicating that the power demand value of the target second cell has been met, the target second cell can be marked as allocated and removed from the power adjustment-in list. At this point, the power adjustment-out list and power adjustment-in list are obtained as shown in the following formula: ; ; in, Used to indicate that the power adjustment is included in the list. Used to indicate the power adjustment list. Used to represent the updated idle power value of the Kth first cell. Used to represent the idle power value of the (K+1)th first cell out of N first cells. This is used to represent the power demand value of the second second cell out of M second cells, ..., the power demand value of the Kth second cell.

[0074] In this embodiment of the application, steps 340-370 are used to implement power allocation for the target second cell. Steps 340-370 can be repeated to select the target second cell for a new round of power allocation from the power adjustment in list, and to implement power allocation for the target second cell in the same way until the power adjustment in list or the power adjustment out list is empty, indicating that the power demand values ​​of all second cells are met, or the idle power allocation of all first cells is completed, and the power allocation of the multiple cells to be allocated ends.

[0075] To facilitate understanding, the process of the new round of power allocation will be described below. Following the power allocation of the first of the M second cells in descending order of power demand, the power adjustment entry list can be obtained as shown in the following formula: The second cell at the top of the table can be selected as the second target cell for the new round. The second cell is shown. Based on the power demand value of this second cell, Q unallocated first cells are selected from the power regulation list, such that: ; ; Where Q is a positive integer less than or equal to N-K+1, and Q and K can be the same or different, without restriction here. This is used to represent the updated idle power value of the Kth first cell out of N first cells, ... the idle power value of the Q+K-2th first cell, and the idle power value of the Q+K-1th first cell, respectively. Used to represent the power demand value of the second target cell in the new round.

[0076] If the idle power value of the Q first cells is greater than the power demand value of the new round target second cell, the idle power of the first Q-1 first cells can be allocated to the new round target second cell in descending order of the original idle power value of the cells. The idle power of the Qth first cell in the Q first cells is then updated, and the first Q-1 first cells and the new round target second cell are both marked as allocated.

[0077] In this embodiment, the above process can be repeated until the power adjustment out list or the power adjustment in list is empty, that is, all N first cells are in an allocated state or all M second cells are in an allocated state. At this time, the power allocation of multiple cells to be allocated is completed. According to the allocation results of multiple cells to be allocated, the power of the cells to be allocated that participated in the above power allocation can be updated. Specifically, for the i-th first cell in the N first cells that is in an allocated state, the power of the i-th first cell can be updated using the following formula: ; For the j-th second cell among M second cells that is already allocated, the power of the j-th second cell can be updated using the following formula: ; in, Used to represent the updated power of the i-th first cell. Used to represent the original power of the i-th first cell, Used to represent the idle power value of the i-th first cell. Used to represent the updated power of the j-th second cell. Used to represent the original power of the j-th second cell, This is used to represent the power demand value of the i-th second cell. In addition, corresponding power updates can also be performed for other cells that participate in power allocation but are not in an allocated state. These cells may be first cells that have only allocated a portion of their idle power, or second cells that have not fully met their power demand values.

[0078] In one embodiment of this application, after allocating the idle power of the first type of cell to the second type of cell, the power allocation method, in addition to steps 310-370 described above, further includes: for the i-th first cell among the N first cells, obtaining the first low-order MCS ratio of the i-th first cell at the current time point and the second low-order MCS ratio at the next time point; updating the first weight of the i-th first cell based on the first low-order MCS ratio and the second low-order MCS ratio; for the j-th second cell among the M second cells, obtaining the third low-order MCS ratio of the j-th second cell at the current time point and the fourth low-order MCS ratio at the next time point; updating the second weight of the j-th second cell based on the third low-order MCS ratio and the fourth low-order MCS ratio. In this way, the first or second weight of the cell to be allocated can be updated according to the real-time low-order MCS ratio of the cell to be allocated. This dynamically updated weight increases the flexibility of power allocation, making the power allocation result more consistent with the real-time status of the cell to be allocated.

[0079] The low-order MCS ratio of a cell refers to the proportion of time or resources occupied by low-order MCS in the MCS strategy used by users within the cell when transmitting data. Low-order MCS can be, for example, using Quadrature Phase Shift Keying (QPSK) modulation or 16 Quadrature Amplitude Modulation (16QAM). The first weight of the i-th first cell is used to determine the idle power value of the i-th first cell, and the second weight of the j-th second cell is used to determine the power demand value of the j-th second cell. For example, the first weight of the i-th first cell is specifically used to determine the first allocation ratio of the i-th first cell, and the second weight of the j-th second cell is specifically used to determine the second allocation ratio of the j-th second cell. The specific determination process of the first and second allocation ratios can be referred to the previous section, and will not be elaborated here. By updating the first weight and the second weight in real time, the first allocation ratio and the second allocation ratio can be dynamically adjusted. Compared with the method of power allocation by sampling static parameters in related technologies, this dynamic adjustment method increases the flexibility of power allocation and is more real-time.

[0080] For example, updating the first weight of the i-th first cell based on the first low-order MCS ratio and the second low-order MCS ratio includes: updating the first weight of the i-th first cell based on the first low-order MCS ratio and the second low-order MCS ratio using the following formula: ; in, Used to represent the first weight of the i-th first cell Used to represent the proportion of the first low-order MCS Used to represent the proportion of the second low-order MCS.

[0081] Correspondingly, updating the second weight of the j-th second cell based on the proportion of the third low-order MCS and the proportion of the fourth low-order MCS includes: updating the second weight of the j-th second cell based on the proportion of the third low-order MCS and the proportion of the fourth low-order MCS using the following formula: ; in, The second weight used to represent the j-th second cell Used to represent the proportion of the third low-order MCS. Used to represent the proportion of the fourth low-order MCS.

[0082] Please see Figure 4 , Figure 4 A detailed flowchart of a power allocation method provided in an embodiment of this application is shown below. Figure 4 As shown, the method includes the following steps: Step 410: Obtain multiple predicted load values ​​for multiple cells to be allocated.

[0083] The plurality of cells to be allocated refers to multiple cells under the same base station. The plurality of predicted load values ​​include the predicted load value of each of the plurality of cells to be allocated, and the predicted load value is the predicted load value of the cell to be allocated at the next time point from the current time point. For any one of the plurality of cells to be allocated, the predicted load value of the cell to be allocated is obtained based on the target load value of the cell to be allocated at the next time point; the target load value of the cell to be allocated is the sum of a first ratio and a second ratio. The first ratio is the proportion of load occupied by users waiting for scheduling in the cell to be allocated at the current time point, and the second ratio is the proportion of waiting time of users using guaranteed bit rate services in the cell to be allocated at the current time point.

[0084] Step 420: Determine a first type of cell and a second type of cell from the plurality of cells to be allocated; the predicted load value of the first type of cell is less than a threshold, and the predicted load value of the second type of cell is greater than the threshold; the first type of cell includes N first cells, and the second type of cell includes M second cells.

[0085] Step 430: Obtain the M power demand values ​​of the M second cells.

[0086] In this embodiment of the application, step 430, obtaining the M power demand values ​​of the M second cells, includes: for the j-th second cell among the M second cells, obtaining the second allocation ratio of the j-th second cell and the second power utilization rate of the j-th second cell at the current time point; multiplying the second allocation ratio and the second power utilization rate to determine the power demand value of the j-th second cell; and obtaining the M power demand values ​​based on the M second cells. The second allocation ratio of the j-th second cell is obtained based on the second target information of the j-th second cell, which includes at least one of the second weight of the j-th second cell, the second power utilization rate, the second predicted load value of the j-th second cell at the next time point, the expected load value of the j-th second cell at the current time point, and the load difference of the j-th second cell at the current time point.

[0087] Step 440: Determine the target second cell in the unallocated state from the M second cells according to the power demand values ​​in descending order.

[0088] Step 450: Obtain the N idle power values ​​of the N first cells.

[0089] In this embodiment of the application, step 450, obtaining N idle power values ​​of the N first cells, includes: for the i-th first cell among the N first cells, obtaining a first allocation ratio and a first power utilization rate of the i-th first cell at the current time point; multiplying the first allocation ratio and the first power utilization rate to determine the idle power value of the i-th first cell; and obtaining N idle power values ​​based on the N first cells. The first allocation ratio of the i-th first cell is obtained based on first target information of the i-th first cell, and the first target information includes at least one of the first weight of the i-th first cell, the first power utilization rate, the idle load value of the i-th first cell at the current time point, and the first predicted load value of the i-th first cell at the next time point.

[0090] Step 460: Select K unallocated first cells from the N first cells in descending order of idle power value.

[0091] Specifically, in descending order of idle power value, the sum of the idle power values ​​of the K first cells is greater than or equal to the power demand value, and the sum of the idle power values ​​of the first K-1 first cells is less than the power demand value.

[0092] Step 470: If the sum of the idle power values ​​of the K first cells is greater than the power demand value, allocate all the idle power of the first K-1 first cells in the K first cells to the target second cell in descending order of idle power value, and allocate part of the idle power of the Kth first cell in the K first cells to the target second cell.

[0093] Step 480: Mark the target second cell and the first K-1 first cells as allocated; update the idle power value of the Kth first cell among the K first cells to the difference between the sum of the idle power values ​​of the K first cells and the power demand value.

[0094] In this embodiment, steps 440-480 are used to achieve power allocation for the target second cell. Steps 440-480 can be repeated until all N first cells or M second cells are in an allocated state, at which point power allocation for multiple cells to be allocated is completed. After power allocation for multiple cells to be allocated is completed, the power allocation method, in addition to steps 410-480, further includes: for the i-th first cell among the N first cells, obtaining the first low-order MCS ratio of the i-th first cell at the current time point and the second low-order MCS ratio at the next time point; updating the first weight of the i-th first cell based on the first low-order MCS ratio and the second low-order MCS ratio; for the j-th second cell among the M second cells, obtaining the third low-order MCS ratio of the j-th second cell at the current time point and the fourth low-order MCS ratio at the next time point; updating the second weight of the j-th second cell based on the third low-order MCS ratio and the fourth low-order MCS ratio. Wherein, the first weight of the i-th first cell is used to determine the idle power value of the i-th first cell, and the second weight of the j-th second cell is used to determine the power demand value of the j-th second cell.

[0095] In this embodiment, multiple predicted load values ​​of multiple cells to be allocated are obtained; the multiple cells to be allocated are multiple cells under the same base station; the multiple predicted load values ​​include the predicted load value of each of the multiple cells to be allocated, and the predicted load value is the predicted load value of the cell to be allocated at the next time point from the current time point; based on the multiple predicted load values, power allocation is performed on the multiple cells to be allocated. Thus, compared with related technologies that allocate power based on the current power utilization and bandwidth of the cells, the related technologies cannot predict the load situation of the cells at the next time point, resulting in a lag. However, this embodiment can allocate power to multiple cells to be allocated based on the predicted load information of the cells to be allocated at the next time point, eliminating the lag in power allocation and solving the problem of unsatisfactory power allocation results obtained in related technologies.

[0096] It is important to understand that Figures 1 to 4 The explanations of the same or corresponding steps can be cross-referenced. For example, Figure 1 The explanation of step 110 is applicable to Figure 2 Step 210 and Figure 3 Step 310 in the process.

[0097] Meanwhile, it should be understood that this application provides a dynamic power adjustment method based on load weight. First, based on historical TTI-level traffic changes, it predicts the cell load fluctuation at the next time point. Then, based on user throughput, capacity, and PRB utilization, it calculates the power outflow ratio (first allocation ratio) and the power inflow ratio (second allocation ratio) to achieve dynamic power allocation. This application can comprehensively consider the real-time PRB utilization and user throughput of the communication cell to construct a power adjustment model, thereby achieving dual optimization of energy consumption and perception. Specifically, this application provides a method for calculating expected load based on TTI-level load weight, and also provides a method for calculating the power allocation ratio of the communication cell based on load, GBR user perception, and user perception waiting for scheduling. Furthermore, the power allocation method provided by this application has the following beneficial effects: First, this application provides a more accurate TTI-level load calculation method for communication cells, comprehensively considering scheduling information, historical load information, and the predicted load value for the next TTI. Second, this application proposes a dynamic calculation method for the power outflow ratio and the power inflow ratio, which can perform real-time dynamic allocation based on each power allocation result.

[0098] Figure 5 This is a structural block diagram of a power distribution device provided in an embodiment of this application. (Refer to...) Figure 5 The power distribution device 500 provided in this application embodiment includes: an acquisition module 510 and a distribution module 520.

[0099] The acquisition module 510 is used to acquire multiple predicted load values ​​of multiple cells to be allocated; the multiple cells to be allocated are multiple cells under the same base station; the multiple predicted load values ​​include the predicted load value of each cell to be allocated, and the predicted load value is the predicted load value of the cell to be allocated at the next time point of the current time point. The processing module 520 is used to perform power allocation on the multiple cells to be allocated based on the multiple predicted load values.

[0100] In this embodiment, multiple predicted load values ​​of multiple cells to be allocated are obtained; the multiple cells to be allocated are multiple cells under the same base station; the multiple predicted load values ​​include the predicted load value of each of the multiple cells to be allocated, and the predicted load value is the predicted load value of the cell to be allocated at the next time point from the current time point; based on the multiple predicted load values, power allocation is performed on the multiple cells to be allocated. Thus, compared with related technologies that allocate power based on the current power utilization and bandwidth of the cells, the related technologies cannot predict the load situation of the cells at the next time point, resulting in a lag. However, this embodiment can allocate power to multiple cells to be allocated based on the predicted load information of the cells to be allocated at the next time point, eliminating the lag in power allocation and solving the problem of unsatisfactory power allocation results obtained in related technologies.

[0101] The power distribution device provided in this application embodiment can realize the various processes implemented in the above method embodiments, and will not be described again here to avoid repetition.

[0102] like Figure 6As shown in the illustration, this application also provides an electronic device 600, which can be an adapter or various types of computers, etc. The electronic device 600 includes a processor 610 and a memory 620. The memory 620 stores programs or instructions, which, when executed by the processor 610, implement the steps of any of the methods described above. For example, when the program is executed by the processor 610, it performs the following process: obtaining multiple predicted load values ​​for multiple cells to be allocated; the multiple cells to be allocated are multiple cells under the same base station; the multiple predicted load values ​​include the predicted load value of each of the multiple cells to be allocated, and the predicted load value is the predicted load value of the cell to be allocated at the next time point from the current time point; and performing power allocation on the multiple cells to be allocated based on the multiple predicted load values. Thus, compared with the related technologies that allocate power based on the current power utilization and bandwidth of the cell, the related technologies cannot predict the load of the cell at the next time point and have a lag. However, the embodiments of this application can allocate power to multiple cells to be allocated based on the predicted load information of the cells to be allocated at the next time point, so that the power allocation no longer has a lag and solves the problem of the poor power allocation results obtained by the related technologies.

[0103] This application also provides a readable storage medium storing a program or instructions that, when executed by a processor, implement the steps of various embodiments of the power allocation method and achieve the same technical effect. To avoid repetition, these will not be described again here.

[0104] The processor is the processor in the electronic device described in the above embodiments. The readable storage medium includes computer-readable storage media, such as computer read-only memory (ROM), random access memory (RAM), magnetic disk, or optical disk.

[0105] This application embodiment also provides a chip, which includes a processor and a communication interface. The communication interface is coupled to the processor. The processor is used to run programs or instructions to implement the various processes of the above method embodiments and achieve the same technical effect. To avoid repetition, it will not be described again here.

[0106] This application provides a computer program product, which is stored in a storage medium and executed by at least one processor to implement the various processes of the above method embodiments and achieve the same technical effects. To avoid repetition, it will not be described again here.

[0107] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element. Furthermore, it should be noted that the scope of the methods and apparatuses in the embodiments of this application is not limited to performing functions in the order shown or discussed, but may also include performing functions substantially simultaneously or in the reverse order, depending on the functions involved. For example, the described methods may be performed in a different order than described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.

[0108] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a computer software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0109] The embodiments of this application have been described above with reference to the accompanying drawings. However, this application is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of this application without departing from the spirit and scope of the claims, and all of these forms are within the protection scope of this application.

Claims

1. A power distribution method, characterized by, The method comprises: obtaining a plurality of predicted load values of a plurality of to-be-allocated cells; the plurality of to-be-allocated cells are a plurality of cells under a same base station; the plurality of predicted load values comprise a predicted load value of each to-be-allocated cell in the plurality of to-be-allocated cells, and the predicted load value is a predicted load value of the to-be-allocated cell at a next time point from a current time point; based on the plurality of predicted load values, power is allocated to the plurality of to-be-allocated cells.

2. The method of claim 1, wherein, For any to-be-allocated cell in the plurality of to-be-allocated cells, the predicted load value of the to-be-allocated cell is obtained based on a target load value of the to-be-allocated cell at the next time point; and the target load value of the to-be-allocated cell is a sum of a first ratio and a second ratio; wherein the first ratio is a load proportion occupied by a user waiting for scheduling in the to-be-allocated cell at the current time point, and the second ratio is a waiting time proportion of a user using a guaranteed bit rate service in the to-be-allocated cell at the current time point.

3. The method of claim 1, wherein, The power is allocated to the plurality of to-be-allocated cells based on the plurality of predicted load values, comprising: determining a first type of cell and a second type of cell from the plurality of to-be-allocated cells, the predicted load value of the first type of cell being less than a threshold value, and the predicted load value of the second type of cell being greater than the threshold value; allocating free power of the first type of cell to the second type of cell.

4. The method of claim 3, wherein, The first type of cell comprises N first cells, and the second type of cell comprises M second cells; the free power of the first type of cell is allocated to the second type of cell, comprising: obtaining M power demand values of the M second cells, the M power demand values comprising a power demand value of each second cell in the M second cells; determining a target second cell from the M second cells in a descending order of power demand value; based on the power demand value of the target second cell, determining K first cells from the N first cells; allocating free power of the K first cells to the target second cell; wherein N and M are positive integers, and K is a positive integer less than or equal to N.

5. The method of claim 4, wherein, The K first cells are determined from the N first cells based on the power demand value of the target second cell, comprising: obtaining N free power values of the N first cells, the N free power values comprising a free power value of each first cell in the N first cells; selecting K first cells from the N first cells in a descending order of free power value, so that a sum of the free power values of the K first cells is greater than or equal to the power demand value, and a sum of free power values of the first K-1 first cells in the K first cells is less than the power demand value.

6. The method of claim 5, wherein: the target second cell is determined from the M second cells, comprising a second cell in an unallocated state from the M second cells; the K first cells are selected from the N first cells, comprising K first cells in an unallocated state from the N first cells; and The allocating the idle power of the K first cells to the target second cell comprises: in a case where a sum of idle power values of the K first cells is greater than the power requirement value, allocating all idle power of a first K-1 first cell in the K first cells to the target second cell in a descending order of idle power values, and allocating part of idle power of a Kth first cell in the K first cells to the target second cell; marking the target second cell and the first K-1 first cells as allocated states; and updating the idle power value of the Kth first cell as a difference between the sum of the idle power values of the K first cells and the power requirement value.

7. The method of claim 5, wherein, The obtaining the N idle power values of the N first cells comprises: For an ith first cell in the N first cells, obtaining a first allocation ratio of the ith first cell and a first power utilization rate of the ith first cell at the current time point; and determining a product of the first allocation ratio and the first power utilization rate as an idle power value of the ith first cell. Based on the N first cells, obtaining N idle power values; The first allocation ratio of the ith first cell is obtained based on first target information of the ith first cell, and the first target information comprises at least one of a first weight of the ith first cell, the first power utilization rate, an idle load value of the ith first cell at the current time point, and a first predicted load value of the ith first cell at the next time point.

8. The method of claim 4, wherein, The obtaining the M power requirement values of the M second cells comprises: For a jth second cell in the M second cells, obtaining a second allocation ratio of the jth second cell and a second power utilization rate of the jth second cell at the current time point; and determining a product of the second allocation ratio and the second power utilization rate as a power requirement value of the jth second cell. Based on the M second cells, obtaining M power requirement values. The second allocation ratio of the jth second cell is obtained based on second target information of the jth second cell, and the second target information comprises at least one of a second weight of the jth second cell, the second power utilization rate, a second predicted load value of the jth second cell at the next time point, an expected load value of the jth second cell at the current time point, and a load difference value of the jth second cell at the current time point.

9. The method of claim 5, wherein, After the allocating the idle power of the first type of cells to the second type of cells, the method further comprises: For an ith first cell in the N first cells, obtaining a first low-order modulation and coding strategy proportion of the ith first cell at the current time point and a second low-order modulation and coding strategy proportion of the ith first cell at the next time point; Based on the first low-order modulation and coding strategy proportion and the second low-order modulation and coding strategy proportion, updating a first weight of the ith first cell; and Based on the first low-order modulation and coding strategy proportion and the second low-order modulation and coding strategy proportion, updating a first weight of the ith first cell. For a jthsecond cell in the M second cells, a third low order modulation and coding strategy proportion of the jthsecond cell at the current time point and a fourth low order modulation and coding strategy proportion of the jthsecond cell at the next time point are obtained; a second weight of the jthsecond cell is updated based on the third low order modulation and coding strategy proportion and the fourth low order modulation and coding strategy proportion; wherein the first weight of the ithfirst cell is used to determine an idle power value of the ithfirst cell, and the second weight of the jthsecond cell is used to determine a power demand value of the jthsecond cell.

10. An electronic device, comprising: A processor and a memory are included, the memory stores a program or instructions running on the processor, and the program or instructions are executed by the processor to implement the steps of the method according to any one of claims 1-9.

11. A readable storage medium, characterized by, A program or instructions are stored on the medium, and the program or instructions are executed to implement the steps of the method according to any one of claims 1-9.

12. A computer program product, characterised in that, A computer program is included, and the computer program is executed by a processor to implement the method according to any one of claims 1-9.

Images