Method, apparatus, node and storage medium for determining a control node in a cluster of base stations

Abstract

The present disclosure provides a method, device, node and storage medium for determining a control node in a base station cluster, and relates to the technical field of wireless communication services. The method comprises: in the case that a first node is currently a control node in a base station cluster, obtaining first computing power information of each node in the base station cluster, determining a second node with the highest current computing power performance in the base station cluster based on the first computing power information, and then in the case that the second node is not a control node, controlling the second node to switch to a new control node in the base station cluster. Thus, the node with the highest current computing power performance in the base station cluster is used as the current control node, so that the control node always maintains optimal computing power, avoids the situation that the control node cannot timely adjust the energy-saving strategy when it is running under high load, and improves the efficiency of the base station cluster autonomy.

Description

Technical Field

[0001] This disclosure relates to the field of wireless communication service technology, and in particular to a method, apparatus, node and storage medium for determining control nodes in a base station cluster. Background Technology

[0002] With the continuous development of 5G networks, energy consumption has gradually become one of the major challenges restricting the sustainable development of 5G networks. In related technologies, network management platforms or fixed base stations are often used as control nodes to issue and execute energy-saving strategies. However, this method of determining the control node makes it prone to problems where the system's energy-saving strategies cannot be adjusted in a timely manner. Summary of the Invention

[0003] This disclosure aims to at least partially address one of the technical problems in the related art.

[0004] According to a first aspect of this disclosure, a method for determining a control node in a base station cluster is proposed. The method is executed by a first node and includes: when the first node is currently a control node in the base station cluster, obtaining the current first computing power information of each node in the base station cluster; based on each of the first computing power information, determining the second node with the highest current computing power performance in the base station cluster; and when the second node is not the control node, controlling the second node to switch to become a new control node in the base station cluster.

[0005] A second aspect of this disclosure provides a method for determining a control node in a base station cluster. The method is executed by a second node and includes: when the second node is currently a controlled node in the base station cluster, sending the second node's current first computing power information to the control node in the base station cluster; and, upon receiving a control permission switching instruction sent by the control node, controlling the second node to switch to become a new control node in the base station cluster.

[0006] A third aspect of this disclosure provides an apparatus for determining a control node in a base station cluster. The apparatus is equipped in a first node and includes: a first acquisition module, configured to acquire first computing power information of each node in the base station cluster when the first node is currently a control node in the base station cluster; a first determination module, configured to determine a second node with the highest current computing power performance in the base station cluster based on each of the first computing power information; and a first control module, configured to control the second node to switch to becoming a new control node in the base station cluster when the second node is not the control node.

[0007] A fourth aspect of this disclosure provides an apparatus for determining a control node in a base station cluster. The apparatus is equipped in a second node and includes: a first transmitting module, configured to transmit first computing power information of the second node to the control node in the base station cluster when the second node is currently a controlled node in the base station cluster; and a second control module, configured to control the second node to switch to a new control node in the base station cluster upon receiving a control permission switching instruction sent by the control node.

[0008] A fifth aspect of this disclosure provides a network node, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to implement a method for determining a control node in a base station cluster as proposed in an embodiment of this disclosure.

[0009] A sixth aspect of this disclosure provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements a method for determining control nodes in a base station cluster as proposed in embodiments of this disclosure.

[0010] A seventh aspect of this disclosure provides a computer program product including a computer program that, when executed by a processor, implements a method for determining control nodes in a base station cluster as proposed in embodiments of this disclosure.

[0011] The method, apparatus, node, and storage medium for determining control nodes in a base station cluster provided in this disclosure have the following beneficial effects:

[0012] In this embodiment, when the first node is currently the control node in the base station cluster, after acquiring the current first computing power information of each node in the base station cluster, the first node determines the second node with the highest current computing power performance within the base station cluster based on each first computing power information. Then, when the second node is not the control node, the first node controls the second node to switch to become the new control node in the base station cluster. Thus, by using the node with the highest current computing power performance in the base station cluster as the current control node, the control node is guaranteed to maintain optimal computing power at all times. This avoids the situation where the control node cannot adjust energy-saving strategies in a timely manner when operating under high load, thereby improving the efficiency of base station cluster autonomy.

[0013] Additional aspects and advantages of this disclosure will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of this disclosure. Attached Figure Description

[0014] The above and / or additional aspects and advantages of this disclosure will become apparent and readily understood from the following description of the embodiments taken in conjunction with the accompanying drawings, in which:

[0015] Figure 1 This is a flowchart illustrating a method for determining a control node in a base station cluster according to an embodiment of the present disclosure.

[0016] Figure 2 This is a schematic diagram of the full connectivity of the intra-cluster base station provided in this disclosure.

[0017] Figure 3 This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0018] Figure 4 This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0019] Figure 5 This is a schematic diagram of the node energy-saving strategy execution process provided in this disclosure.

[0020] Figure 6 This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0021] Figure 7 This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0022] Figure 8 This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0023] Figure 9 This is an interactive schematic diagram of a method for determining a control node in a base station cluster, provided in another embodiment of this disclosure.

[0024] Figure 10 This is an interactive schematic diagram of a method for determining a control node in a base station cluster, provided in another embodiment of this disclosure.

[0025] Figure 11 This is a schematic diagram of the structure of an apparatus for determining a control node in a base station cluster according to an embodiment of the present disclosure;

[0026] Figure 12 A schematic diagram of a device for determining a control node in a base station cluster, provided in another embodiment of this disclosure;

[0027] Figure 13 A block diagram is shown that is suitable for implementing an exemplary network node of the present disclosure. Detailed Implementation

[0028] Embodiments of this disclosure are described in detail below. Examples of these embodiments are illustrated in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and intended to explain this disclosure, and should not be construed as limiting this disclosure.

[0029] The method for determining the control node in a base station cluster in this disclosure can be executed by the apparatus for determining the control node in a base station cluster in this disclosure. This apparatus can be configured in either the first node or the second node, and this disclosure does not limit this. The first node or the second node can be any base station in the base station cluster.

[0030] The following description, with reference to the accompanying drawings, outlines a method, apparatus, node, and storage medium for determining a control node in a base station cluster according to embodiments of the present disclosure.

[0031] Figure 1 This is a flowchart illustrating a method for determining a control node in a base station cluster, as provided in an embodiment of this disclosure.

[0032] like Figure 1 As shown, the method for determining the control node in the base station cluster, executed by the first node, may include:

[0033] Step 101: If the first node is currently the control node in the base station cluster, obtain the current first computing power information of each node in the base station cluster.

[0034] The first node can be any base station in a base station cluster. A base station cluster refers to multiple interconnected base stations within a certain range. This range can be determined by maintenance personnel based on factors such as terrain and service distribution. For example, in a grid dimension, n base stations within L*M grids can be constructed into a base station cluster, where the values ​​of L, M, and n can be dynamically set as needed. This disclosure does not limit this value. The n base stations can be represented by identifiers such as N1, N2, N3…Nn. A control node refers to a base station in the base station cluster that can send energy-saving commands to other base stations.

[0035] The first computing power information may include information such as the utilization rate of the central processing unit (CPU) and the memory utilization rate, but this disclosure does not limit it.

[0036] In this disclosure, communication between base stations within a base station cluster can be achieved by modifying existing interfaces. For example, 5G base stations and 4G base stations can communicate based on the existing NG interface (with added relevant signaling procedures and fields), 4G base stations can communicate based on the existing X2 interface (with added relevant signaling procedures and fields), and 5G base stations can communicate based on the existing Xn interface (with added relevant signaling procedures and fields), thereby achieving full connectivity among base stations within the cluster and enabling information exchange and data transmission through this interface.

[0037] Figure 2 This is a schematic diagram of the full connectivity of base stations within a cluster, such as... Figure 2 As shown, there are 7 base stations within the cluster, and each base station can connect to its 6 other base stations via interfaces. Therefore, the first node can obtain the current computing power information of each node in the base station cluster through these interfaces.

[0038] In some possible implementations, the first node can send a computing power information collection request to each controlled node, and then receive the current first computing power information returned by each controlled node.

[0039] Among them, the controlled node refers to the other nodes in the base station cluster besides the control node.

[0040] In this embodiment of the disclosure, the first node may store the identifier and address information of each node in the node cluster, and interact with other nodes based on the address information of the nodes.

[0041] In this embodiment, the first node can periodically send computing power information collection requests to each controlled node, or it can send computing power information collection requests when the computing power of the first node drops below a preset threshold, etc., and this disclosure does not limit this. While receiving the current first computing power information returned by each controlled node, the first node can directly obtain its own first computing power information, thereby obtaining the current first computing power information of all nodes in the base station cluster.

[0042] In some possible implementations, the first node may send a computing power information collection request to each controlled node if the time interval between the current moment and the previous moment when the computing power information of each node was obtained is greater than or equal to a preset time interval.

[0043] The preset time interval can be a fixed value or a value that is dynamically set according to specific communication needs and other factors. This disclosure does not limit this.

[0044] In this embodiment, the timing information of each acquisition of computing power information of a node can be stored in each base station within the base station cluster. When the first node collects the computing power information of each controlled node for the first time, it can directly send a computing power collection request to each controlled node. Alternatively, when the first node collects the computing power information of each controlled node before the first time, it can calculate the time interval between the current time and the stored previous acquisition time. If the time interval is greater than or equal to a preset time interval, it sends a computing power information collection request to each controlled node. In other words, the control node can send a computing power information collection request to each controlled node at certain preset time intervals to obtain the current first computing power information returned by each controlled node. By periodically acquiring the computing power information of all nodes, the optimal computing power node within the base station cluster can be evaluated in real time, providing conditions for maintaining optimal computing power within the base station cluster.

[0045] Alternatively, a computing power information collection request can be sent to each controlled node if the current computing power information of the control node meets the triggering conditions.

[0046] The triggering condition could be that the node's computing power is lower than a preset threshold, etc., but this disclosure does not limit this.

[0047] In other words, a threshold can be preset in the base station cluster. This value can be fixed or it can vary according to the actual situation; this disclosure does not limit this. When the current computing power of the control node drops below this threshold, it can be considered that the computing power of the current control node may not be optimal in the base station cluster. Therefore, a computing power information collection request can be sent to each controlled node to obtain the current first computing power information of all nodes.

[0048] Step 102: Based on each first computing power information, determine the second node with the highest current computing power performance within the base station cluster.

[0049] In this embodiment of the disclosure, the first computing power information may include information in multiple dimensions. The first node can perform weighted calculations on the information in each dimension, and then compare the calculation results corresponding to each piece of first computing power information to determine the second node with the highest current computing power performance in the base station cluster.

[0050] In some possible implementations, the first node can determine the current utilization rate of computing resources in each dimension of each node based on each first computing power information, and then determine the current computing power performance parameters of each node according to the utilization rate and the weight value of each dimension, and determine the node with the highest corresponding computing power performance parameters as the second node.

[0051] The computing resources of each dimension in a node refer to the information of each dimension in the first computing power information, which may include CPU utilization, memory utilization, etc., and this disclosure does not limit this. The weight value of each dimension may be a fixed value or a value dynamically determined according to actual needs, and this disclosure does not limit this.

[0052] In this embodiment, the first node can utilize the current utilization rate and weight value of the computing power resources of each node in each dimension, and calculate the maximum value among the current computing power performance parameters according to the preset calculation formula of the highest computing power performance parameter. Then, the node corresponding to the maximum value among all computing power performance parameters is determined as the second node. The calculation formula of the highest computing power performance parameter in the base station cluster can be shown in the following formula (1):

[0053] max{(1-c i )*ω1+(1-m i )*ω2} (1)

[0054] Among them, c i This represents the CPU utilization of the i-th node in the base station cluster, m. i ω1 represents the current memory utilization rate of the i-th node in the base station cluster, where i = [1, n], n is the total number of base station nodes in the base station cluster, ω1 represents the weight of CPU utilization, and ω2 represents the weight of memory utilization.

[0055] Step 103: If the second node is not a control node, control the second node to switch to a new control node in the base station cluster.

[0056] In this embodiment of the disclosure, when the second node with the highest computing power performance parameter calculated by the above formula is not the same base station as the first node, in order to ensure that each node in the base station cluster can obtain the energy-saving strategy in a timely manner, it is necessary to ensure that the control node has the optimal computing power. Thus, the first node transfers the control authority to the second node, making the second node the new control node in the base station cluster.

[0057] In some possible implementations, the first node can send a control authority exchange request to the second node, and then receive a control authority switching response returned by the second node. If the control authority switching response indicates that the switching was successful, the second node is determined to be the new control node in the base station cluster, thereby realizing the dynamic switching of control nodes within the base station cluster.

[0058] In this disclosure, a cell information table within a base station cluster can be established and synchronously stored in all sites within the base station cluster. As shown in Table 1, the cell information table can include the names, address information, location information, node identifiers, etc. of n nodes within the base station cluster. The address information can include the Internet Protocol (IP) address information of all nodes within the cluster, the location information can be the latitude and longitude information of all nodes within the cluster, and the node identifier can be used to mark and distinguish between control nodes and controlled nodes within the cluster.

[0059] Table 1

[0060] Cluster nodes Address Information Node marker Location information N1 xxx.xxx.xxx.2 controlled 118.xxxx1;26.xxxx1 N2 xxx.xxx.xxx.3 control 118.xxxx2;26.xxxx2 N3 xxx.xxx.xxx.4 controlled 118.xxxx3; 26.xxxx3 ... ... controlled ... Nn xxx.xxx.xxx.x controlled 118.xxxxn; 26.xxxxn

[0061] As shown in Table 1, the names of the n nodes in the base station cluster are N1, N2, N3, ..., Nn. N2 is marked as a control node, while N1, N3, ..., Nn are marked as controlled nodes.

[0062] In some possible implementations, after the second node switches to become the new control node in the base station cluster, the flag of the second node can be updated from that of the controlled node to that of the control node, and the flag of the first node can be updated from that of the control node to that of the controlled node. Then, a first flag update request is sent to each third node in the base station cluster other than the second node, wherein the first flag update request is used to request at least one of the following: update the flag of the first node from that of the control node to that of the controlled node, and update the flag of the second node from that of the controlled node to that of the control node.

[0063] In this embodiment of the disclosure, each third node in the base station cluster can store the cell information table of the base station cluster. Since the cell information table may include the flag information of each node, after the second node switches to become the new control node in the base station cluster, it should send a first flag update request to each third node through the interface. After receiving the first flag update request, the third node updates the node flag field in the cell information table, updates the flag of the first node from control node to controlled node, and updates the flag of the second node from controlled node to control node.

[0064] In this embodiment, when the first node is currently the control node in the base station cluster, after acquiring the current first computing power information of each node in the base station cluster, the first node determines the second node with the highest current computing power performance within the base station cluster based on each first computing power information. Then, if the second node is not the first node, the first node controls the second node to switch to become the new control node in the base station cluster. Thus, by using the node with the highest current computing power performance in the base station cluster as the current control node, the control node is guaranteed to maintain optimal computing power at all times, avoiding situations where the control node cannot adjust energy-saving strategies in a timely manner due to high load operation, thereby improving the efficiency of base station cluster autonomy.

[0065] Figure 3 This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0066] like Figure 3 As shown, the method for determining the control node in the base station cluster, executed by the first node, may include:

[0067] Step 301: Receive a first computing power performance comparison request sent by any node, wherein the first computing power performance comparison request includes the second computing power information of any node.

[0068] In this context, any node can refer to any node in the base station cluster other than the first node.

[0069] In this disclosure, after constructing a base station cluster, the computing power performance of each base station in the cluster can be compared using an optimization algorithm, and the node with the best computing power performance can be determined as the first control node in the base station cluster.

[0070] Step 302: Without performing a comparison of computing power performance with other nodes, determine the node with higher computing power performance based on the second computing power information and the current third computing power information of the first node.

[0071] In this embodiment of the disclosure, without performing a comparison of computing power performance with other nodes, the first node can perform a comparison of computing power performance with any other node. This involves calculating the computing power performance parameters corresponding to the second computing power information and the first computing power information, respectively, and then comparing these parameters. The node with the larger computing power performance parameter is the node with higher computing power performance. The calculation method for the computing power performance parameters can be found in the detailed description in the above embodiments of this disclosure, and will not be repeated here.

[0072] Step 303: If the first node is a node with high computing power, determine the target node.

[0073] The target node can be any node in the base station cluster that has not undergone a computing power performance comparison operation.

[0074] In this embodiment of the disclosure, after completing the inter-node computing performance comparison operation, each node in the base station cluster can store the identifiers of the compared nodes. Furthermore, when sending a computing performance comparison operation request, it can simultaneously send the stored node identifiers. This avoids redundant comparison operations between nodes during the process of determining the node with the highest computing performance in the base station cluster, and quickly identifies the target node in the base station cluster that has not undergone a computing performance comparison operation. Therefore, when determining the target node, the first node can exclude not only nodes that the first node directly performed a computing performance comparison operation with, but also nodes that it indirectly compared with.

[0075] It should be noted that the first node can confirm one target node at a time, and the order of confirmation can be random, or it can be determined according to the order of node numbers, etc., or multiple target nodes can be confirmed at the same time. This disclosure does not limit this.

[0076] In some possible implementations, the target node can be one of the nodes in the base station cluster other than any of the nodes mentioned above and the first node.

[0077] In this embodiment of the disclosure, if any node has not performed a computing power performance comparison operation with other nodes, and only any node in the base station cluster and the first node have performed a computing power performance comparison, then the first node can determine one other node in the base station cluster other than any node and the first node as the target node.

[0078] Alternatively, the first computing power performance comparison request may include the identifier of at least one fourth node that has performed a computing power performance comparison, or a node in the base station cluster other than any of the above-mentioned nodes, the first node, and at least one fourth node may be identified as the target node.

[0079] The identifier of a node can be its IP address information, location information, etc., and this disclosure does not limit it.

[0080] In this embodiment of the disclosure, when any node has compared its computing power performance with at least one fourth node, the computing power performance of any node should be higher than the computing power performance of the fourth node respectively. Therefore, the first computing power performance comparison request sent by any node to the first node can include the identifier of the fourth node. Thus, when the computing power performance of the first node is higher than that of any node, it can also be obtained that the computing power performance of the first node is higher than the computing power performance of the fourth node respectively. Therefore, when the first node determines the next node to be compared in computing power performance, it can determine one other node in the base station cluster other than any of the above-mentioned nodes, the first node, and at least one fourth node as the target node.

[0081] In some possible implementations, if any node has high computing power, an indication message is sent to that node, where the indication message is used to indicate that any node has high computing power.

[0082] In this embodiment of the disclosure, after the first node performs a computing power performance comparison operation with any other node, based on the comparison result, if any other node has higher computing power performance, the first node can send a higher computing power performance indication to any other node, and then any other node can determine the target node for the next comparison.

[0083] Step 304: Send a second computing power performance comparison request to the target node, wherein the second computing power performance comparison request includes third computing power information.

[0084] In this embodiment of the disclosure, the first node may send the second computing power performance comparison request to the target nodes one by one, or it may send the second computing power performance comparison request to multiple target nodes at the same time. This disclosure does not limit this.

[0085] Step 305: If an indication message is received from the target node within a preset time period, return to the operation of determining the target node until no new indication message is received from the target node.

[0086] In this embodiment of the disclosure, after the first node receives the indication information sent by the target node, the first node can be determined as the node with the highest computing power performance among the nodes that have already undergone computing power performance comparison. Therefore, the first node can continue to perform the operation of determining the target node until it is determined that the computing power performance of the new target node is higher than that of the first node, or there is no new target node in the base station cluster.

[0087] In some possible implementations, if the first node determines that it is the current control node of the base station cluster, it sends a second flag update request to each controlled node in the base station cluster. The second flag update request is used to request that the flag of the first node be updated from that of a normal node to that of a control node.

[0088] In this embodiment of the disclosure, after comparing the computing power performance with all target nodes and receiving indication information sent by each target node, the first node can determine that it is the current control node of the base station cluster. Then, the first node can send a second flag update request to each controlled node, requesting that the identifier of the first node in the cell information table stored by each controlled node be updated from ordinary node to control node.

[0089] In this embodiment, the first node receives a first computing power performance comparison request sent by any node. This first computing power performance comparison request includes the second computing power information of any node. Then, without performing a computing power performance comparison operation with other nodes, based on the second computing power information and the first node's current third computing power information, it determines a node with higher computing power performance. If the first node is indeed a node with higher computing power performance, a target node is determined, and a second computing power performance comparison request is sent to the target node. If an indication message is received from the target node within a preset time period, the node returns to the operation of determining the target node, continuing until no new indication message is received from the target node. Thus, by traversing through the nodes in the base station cluster to compare computing power performance, the node with the best computing power performance is determined as the current control node within the base station cluster, thereby improving the reliability and determination efficiency of the control node.

[0090] Figure 4This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0091] like Figure 4 As shown, the method for determining the control node in the base station cluster, executed by the first node, may include:

[0092] Step 401: If the first node is currently the control node in the base station cluster, obtain the current service information of each node.

[0093] The business information may include the number of base station users, uplink physical resource block (PRB) utilization, downlink PRB utilization, uplink and downlink traffic, etc., and this disclosure does not limit this.

[0094] In this embodiment of the disclosure, the first node can directly retrieve its own current business information and obtain the current business information of all controlled nodes through the communication interface to obtain the current business information of each node.

[0095] In some possible implementations, the first node can first receive the business information sending request sent by the controlled node, then send the business information sending response to the controlled node, then receive the business information sent by the controlled node, and then send the business information receiving completion indication to the controlled node.

[0096] In this embodiment of the disclosure, since the control node may have many processing tasks and cannot receive all the service information of the controlled nodes at once, it can first receive the service information sending request sent by the controlled node, and after determining that there is enough memory to receive the service information, send a service information sending response to the controlled node, receive the service information sent by the controlled node, and send a service information receiving completion indication to the controlled node to end the process of obtaining the service information of the controlled node.

[0097] Step 402: Determine the current energy-saving strategy for each node based on the current business information of each node.

[0098] The energy-saving strategy can consist of energy-saving methods and their corresponding energy-saving time periods. The energy-saving methods can be symbol shutdown, channel shutdown, carrier shutdown, or deep sleep, etc. The energy-saving time is at various time granularities within a day, such as 1 minute, 15 minutes, or hour, etc. It can be a fixed value or dynamically set according to demand. This disclosure does not limit this.

[0099] In this embodiment of the disclosure, the first node can analyze the current business information of each node, perform energy-saving strategy orchestration, and determine the current energy-saving strategy of each node.

[0100] In this embodiment, since the power-saving methods of symbol shutdown and channel shutdown (the number of channels of the Radio Remote Unit (RRU) is greater than 1) do not affect the service of the node, they can be directly enabled. Therefore, it is only necessary to determine whether the carrier shutdown and deep sleep function are enabled in the current power-saving strategy of each node based on the current service information. The determination formula can be as follows (2):

[0101]

[0102] Among them, RRC i_X Let X be the number of users at the i-th node within the base station cluster at the X-th time granularity. The weight value corresponding to the average number of users is Threshold1, which is the threshold value corresponding to the number of users who enable energy saving and turn off the power.

[0103] Alternatively, the formula for determining whether carrier shutdown and deep sleep functions are enabled can also be shown in the following formula (3):

[0104]

[0105] Among them, YLPRB i_X Let be the uplink PRB utilization of the i-th node within the base station cluster at the X-th time granularity. Threshold2 is the weight value corresponding to the average uplink PRB utilization rate indicator, and Threshold2 is the threshold value corresponding to the average uplink PRB utilization rate when energy saving shutdown is enabled.

[0106] Alternatively, the formula for determining whether carrier shutdown and deep sleep functions are enabled can also be shown in the following formula (4):

[0107]

[0108] Among them, DLPRB i_X Let X be the downlink PRB utilization of the i-th node in the base station cluster at the X-th time granularity. Threshold3 is the weight value corresponding to the average downlink PRB utilization rate indicator, and Threshold3 is the threshold value corresponding to the average uplink PRB utilization rate when energy saving is enabled.

[0109] Alternatively, the formula for determining whether carrier shutdown and deep sleep functions are enabled can also be shown in the following formula (5):

[0110]

[0111] Among them, TH_PUT i_X Let X represent the uplink and downlink traffic of the i-th node within the base station cluster at the X-th time granularity. Threshold4 is the weight value corresponding to the average uplink and downlink traffic indicators, and Threshold4 is the threshold value corresponding to the average uplink and downlink traffic when energy saving shutdown is enabled.

[0112] In other words, if the weighted average of any one of the following service information items—the current number of base station users, uplink PRB utilization, downlink PRB utilization, and uplink / downlink traffic—is greater than the corresponding threshold, the node can be considered to have enabled carrier shutdown and deep sleep functions. Therefore, the node's current energy-saving strategy is determined to be symbol shutdown, channel shutdown, carrier shutdown, or deep sleep. Alternatively, if the formula for determining each of the above service information items does not satisfy the condition that the weighted average is greater than the corresponding threshold, then the node cannot enable carrier shutdown and deep sleep functions. In this case, the node's current energy-saving strategy is symbol shutdown and channel shutdown.

[0113] Step 403: Control the working state of the first node based on the current first energy-saving strategy of the first node.

[0114] In this embodiment of the disclosure, the first node can activate the corresponding energy-saving function according to the current first energy-saving strategy, thereby controlling the working state of the first node.

[0115] In some possible implementations, the first node can be divided into two parts: a strategy unit and an execution unit. Therefore, after the strategy unit generates the current first energy-saving strategy of the first node, it can send the first energy-saving strategy to the execution unit in the first node so that the execution unit can execute the first energy-saving strategy.

[0116] In this embodiment of the disclosure, all nodes within the base station cluster can be divided into two parts: a strategy unit and an execution unit. The following describes the process in conjunction with... Figure 5 The specific process for implementing energy-saving strategies between nodes is explained. Figure 5 This is a schematic diagram of the node energy-saving strategy execution process. For example... Figure 5 As shown, the control node is the first node. The strategy unit of the first node can issue the current first energy-saving strategy command to the execution unit within the first node. The execution unit then receives the first energy-saving strategy and controls the working state of the first node according to its instructions. After execution, the execution unit can feed back the execution result to the strategy unit of the first node. If execution fails, the execution unit can report the reason for the failure to the strategy unit and attempt to re-execute. When the number of re-executions exceeds the penalty count k, it waits to execute a new energy-saving strategy.

[0117] Step 404: Send the current second energy-saving strategy of each controlled node to each controlled node.

[0118] In this embodiment of the disclosure, the first node can send the generated second energy-saving strategies to the corresponding controlled nodes through the communication interface.

[0119] In some possible implementations, all controlled nodes can also be divided into policy units and execution units. Therefore, the first node can send the current second energy-saving policy of each controlled node to the policy unit of each controlled node.

[0120] In this embodiment of the disclosure, the strategy unit of the first node can send the current second energy-saving strategy of each controlled node to the strategy unit of the corresponding controlled node, thereby realizing the distribution of the second energy-saving strategy scheme. This allows each controlled node to control its working state according to the current second energy-saving strategy, achieving the purpose of energy saving.

[0121] In this embodiment, when the first node is currently the control node in the base station cluster, the current service information of each node is first obtained. Then, based on the current service information of each node, the current energy-saving strategy of each node is determined. Next, based on the first node's current first energy-saving strategy, the working state of the first node is controlled, and the current second energy-saving strategy of each controlled node is sent to each controlled node. Thus, by obtaining the current service information of each node in the base station cluster and generating the corresponding current energy-saving strategy, the energy-saving strategy of each node can be adjusted in a timely manner, further improving the efficiency of autonomous energy-saving areas within the base station cluster. This allows for greater exploration of energy-saving potential while satisfying user experience.

[0122] Figure 6 This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0123] like Figure 6 As shown, the method for determining the control node in the base station cluster, executed by the second node, may include:

[0124] Step 601: If the second node is currently a controlled node in the base station cluster, send the first computing power information of the second node to the control node in the base station cluster.

[0125] The second node can be any node in the base station cluster except for the control node.

[0126] In this embodiment of the disclosure, the second node can send the current first computing power information to the control node after receiving a computing power information collection request sent by the control node. Alternatively, it can send the current first computing power information to the control node at regular intervals.

[0127] In some possible implementations, the second node can send the first computing power information to the control node upon receiving a computing power information collection request from the control node.

[0128] Alternatively, a computing power information reporting request can be sent to the control node at preset time intervals, and upon receiving a computing power information reporting response from the control node, the first computing power information can be sent to the control node.

[0129] In this embodiment of the disclosure, before the second node sends the first computing power information to the control node each time, it can first send a computing power information reporting request to the control node. After receiving the computing power information reporting response, it then sends the first computing power information to the control node. This can avoid multiple controlled nodes sending the first computing power information at the same time, thus avoiding the transmission or processing burden on the control node.

[0130] Step 602: Upon receiving a control permission switching instruction sent by the control node, the second control node is switched to become the new control node in the base station cluster.

[0131] In this embodiment of the disclosure, when the computing power performance parameter value corresponding to the current first computing power information of the second node is the highest value among the computing power performance parameters of all nodes in the base station cluster, the second node can receive the control permission switching instruction sent by the current control node, thereby switching to become the new control node in the base station cluster.

[0132] In some possible implementations, the second node can send a control permission switching response to the control node. The switching response indicates whether the second node has successfully switched to the new control node, so that the original control node can determine that the control node switching operation has been completed.

[0133] In some possible implementations, when the second node is switched to a new control node, the flag of the second node can be updated from the controlled node to the control node, and the flag of the control node can be updated from the control node to the controlled node. Then, a first flag update request is sent to each third node in the base station cluster other than the control node. The first flag update request is used to request at least one of the following: update the flag of the control node from the control node to the controlled node, and update the flag of the second node from the controlled node to the control node.

[0134] In this embodiment, when the second node is currently a controlled node in the base station cluster, it first sends its current computing power information to the control node in the base station cluster. Then, upon receiving a control permission switching instruction from the control node, it controls the second node to switch to become the new control node in the base station cluster. This achieves the switching of control rights among nodes in the base station cluster, enabling timely replacement of control nodes and ensuring that the computing power performance within the base station cluster remains at a high level. This provides conditions for timely adjustments to energy-saving strategies.

[0135] Figure 7This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0136] like Figure 7 As shown, the method for determining the control node in the base station cluster, executed by the second node, may include:

[0137] Step 701: After confirming that the base station cluster has been successfully created, a first computing power performance comparison request is sent to any node in the base station cluster. The first computing power performance comparison request includes the second computing power information of the second node.

[0138] In this embodiment of the disclosure, when any one base station establishes a communication interface connection with all other base stations within a certain range, the base station cluster can be determined to have been successfully created. Before any inter-node computing power performance comparison is performed, a second node can send a first computing power performance comparison request to all other nodes in the base station cluster. For example, if there are five nodes in the base station cluster, N1, N2, N3, N4, and N5, N1 can first send the first computing power performance comparison request to N2, N3, N4, and N5 respectively. N1 will then receive four comparison results. If the computing power performance of N2, N3, and N4 is higher than that of N1, then N2, N3, and N4 need to be compared. Therefore, N2 can send computing power performance comparison requests to N3 and N4 respectively, and so on. Alternatively, a node can be designated, and all second nodes can send the first computing power performance comparison request to that node. This designated node determines the control node in the base station cluster based on all received computing power information.

[0139] Step 702: Upon receiving the indication information returned by any node, update the flag of any node to a controlled node, and send a second computing power performance comparison request to one other node in the base station cluster other than any node and the second node, wherein the second computing power performance comparison request includes second computing power information.

[0140] In this embodiment of the disclosure, after the second node receives the indication information returned by any node, it can determine that the computing power performance of the second node is better than that of any node. Then, the flag of any node in the cell information table can be updated to a controlled node, and the second node can continue to initiate computing power performance comparison requests to other nodes that have not been compared.

[0141] In some possible implementations, the second computing power performance comparison request may also include the identifier of any node. This would synchronize the identifier of the node that has already performed the computing power performance comparison to each next node, enabling the next node to identify nodes in the base station cluster that have not been compared, thus avoiding repeated comparisons of nodes and reducing unnecessary burdens on data transportation and processing.

[0142] In some possible implementations, if no indication is received from any node, and the second node is identified as a controlled node, then any node with higher computing power performance can send a second computing power performance comparison request to another node in the base station cluster other than any node and the second node.

[0143] Step 703: If an instruction message is received from another node within a preset time period, return to the operation of sending the second computing power information to another node until no more instruction messages are received.

[0144] For a detailed description of any embodiment of this disclosure, the specific implementation of step 603 above can be found here, and will not be repeated here.

[0145] In this embodiment, after confirming the successful creation of the base station cluster, the second node first sends a first computing power performance comparison request to any node in the base station cluster. Then, upon receiving an indication from any node, it updates the flag of that node to a controlled node and sends a second computing power performance comparison request to one other node in the base station cluster besides that node and the second node. Subsequently, within a preset time period, if it receives an indication from another node, it returns to the operation of sending second computing power information to that other node, until no more indications are received. Thus, by traversing through the nodes in the base station cluster to compare computing power performance, the node with the best computing power performance is determined as the current control node within the base station cluster, improving the reliability and efficiency of the control node determination.

[0146] Figure 8 This is a flowchart illustrating a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0147] like Figure 8 As shown, the method for determining the control node in the base station cluster, executed by the second node, may include:

[0148] Step 801: Send the current service information of the second node to the control node.

[0149] In some possible implementations, the second node can send a service information transmission request to the control node, and then, upon receiving a service information transmission response from the control node, send the second node's current service information to the control node.

[0150] In this embodiment of the disclosure, after the second node sends the current service information, it may receive a service information reception completion indication sent by the control node.

[0151] Step 802: Receive the second energy-saving strategy sent by the control node.

[0152] In some possible implementations, each node in the base station cluster can be divided into a policy unit and an execution unit. Therefore, the policy unit of the second node can receive the second energy-saving policy sent by the policy unit of the control node.

[0153] Step 803: Implement the second energy-saving strategy.

[0154] In some possible implementations, the strategy unit of the second node can control the execution unit in the second node to execute the second energy-saving strategy.

[0155] In this embodiment of the disclosure, as described above Figure 5 As shown, the ordinary node is the second node. The strategy unit of the second node receives the second energy-saving strategy sent by the strategy unit of the control node and can send it to the execution unit. The execution unit controls the working state of the controlled node according to the content indicated by the second energy-saving strategy and can feed back the result after execution to the strategy unit of the second node. If the execution fails, it can also feed back the reason for the failure to the strategy unit and try to re-execute. When the number of re-executions exceeds the penalty number k, it waits to execute a new energy-saving strategy. The strategy unit of the second node can feed back the result to the strategy unit of the control node to realize the monitoring of the effect of the energy-saving strategy.

[0156] The specific implementation of steps 801-803 above can be found in the detailed description of any embodiment of this disclosure, and will not be repeated here.

[0157] In this embodiment, the second node sends its current service information to the control node, then receives a second energy-saving strategy from the control node, and subsequently executes the second energy-saving strategy. Thus, based on the current service information, an appropriate energy-saving strategy is determined, making the executed energy-saving strategy better meet current service needs, improving the reliability of base station energy-saving strategy selection, and exploring energy-saving potential to a greater extent while satisfying user experience.

[0158] Figure 9 This is an interactive schematic diagram of a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0159] like Figure 9 As shown, the method for determining the control node in a base station cluster may include:

[0160] Step 901: After confirming that the base station cluster has been successfully created, the second node sends a first computing power performance comparison request to the first node in the base station cluster. The first computing power performance comparison request includes the second computing power information of the second node.

[0161] Step 902: The first node receives the first computing power performance comparison request sent by the second node, and determines the node with higher computing power performance based on the second computing power information and the first node's current third computing power information.

[0162] Step 903: If the second node has high computing power, the first node sends an indication message to the second node, wherein the indication message is used to indicate that the second node has high computing power.

[0163] Step 904: Upon receiving the indication information returned by the first node, the second node updates the first node's flag to a controlled node and sends a second computing power performance comparison request to one other node in the base station cluster besides the first and second nodes. The second computing power performance comparison request includes second computing power information.

[0164] Step 905: Return to step 902 and continue until the computing power performance comparison operation of all nodes in the base station cluster is completed, and the control node is determined.

[0165] The specific implementation of steps 901-905 above can be found in the detailed description of any embodiment of this disclosure, and will not be repeated here.

[0166] For example, if base station N1 is the second node and base station N2 is the first node, N1 sends the second computing power information to N2 through the communication interface. Then, N2 compares the computing power performance of N1 and N2 based on the computing power information. Since the computing power performance of N1 is better than that of N2, N2 can send a higher computing power performance indication to N1. Then, N1 sends a computing power performance comparison request containing N1's computing power information to other nodes such as N3. The node identifier of N2 can be included in the computing power performance comparison request. This process continues. After each computing power performance comparison operation, the node with higher computing power performance sends a computing power performance comparison request to the next other node until all nodes in the base station cluster have performed the computing power performance comparison operation. The node with the best computing power performance is then determined as the control node of the base station cluster.

[0167] In this embodiment, the computing power performance of all nodes in the newly created base station cluster is compared one by one, and the node with the best computing power performance is determined as the control node, thereby ensuring that the control node has the best computing power and improving the reliability and determination efficiency of the control node.

[0168] Figure 10 This is an interactive schematic diagram of a method for determining a control node in a base station cluster, provided as another embodiment of this disclosure.

[0169] like Figure 10 As shown, the method for determining the control node in a base station cluster may include:

[0170] Step 1001: The control node sends a computing power information collection request to each controlled node.

[0171] Step 1002: Upon receiving a computing power information collection request from the control node, each controlled node sends the first computing power information to the control node.

[0172] Step 1003: Based on the first computing power information, the control node determines the node with the best current computing power in the base station cluster and sends a control permission switching request to it.

[0173] Step 1004: The node with the best computing power receives the control permission switching request and sends a control permission switching response to the control node.

[0174] Step 1005: If the node with the best computing power is switched to the new control node, send a request to update the node flag information to all nodes.

[0175] Step 1006: All nodes receive the request to update node flag information and send a node flag update response to the new control node.

[0176] The specific implementation of steps 1001-1006 above can be found in the detailed description of any embodiment of this disclosure, and will not be repeated here.

[0177] In this embodiment, the node with the highest computing power in the base station cluster is selected as the current control node, thereby ensuring that the control node always maintains optimal computing power. This avoids the situation where the control node cannot adjust the energy-saving strategy in time when it is under high load, thus improving the efficiency of base station cluster autonomy.

[0178] To implement the above embodiments, this disclosure also proposes an apparatus for determining control nodes in a base station cluster.

[0179] Figure 11 This is a schematic diagram of the apparatus for determining control nodes in a base station cluster provided in an embodiment of this disclosure.

[0180] like Figure 11 As shown, when the device 1100 for determining the control node in the base station cluster is configured in the first node, it includes:

[0181] The first acquisition module 1101 is used to acquire the current first computing power information of each node in the base station cluster when the first node is currently the control node in the base station cluster.

[0182] The first determining module 1102 is used to determine the second node with the highest current computing power performance within the base station cluster based on each first computing power information.

[0183] The first control module 1103 is used to control the second node to switch to become a new control node in the base station cluster when the second node is not a control node.

[0184] In some embodiments, the first determining module 1102 described above can also be used for:

[0185] Based on each first computing power information, determine the current utilization rate of computing power resources in each dimension of each node;

[0186] Based on the current utilization rate of computing resources in each dimension of each node and the weight value of each dimension, determine the current computing performance parameters of each node;

[0187] The node with the highest corresponding computing power performance parameter is designated as the second node.

[0188] In some embodiments, the first control module 1103 described above can also be used for:

[0189] Send a control permission switch request to the second node;

[0190] Receive the control permission switching response returned by the second node;

[0191] If the control authority switching response indicates a successful switch, the second node is determined to be the new control node in the base station cluster.

[0192] In some embodiments, the first control module 1103 described above can also be used for:

[0193] If it is determined that the second node has been switched to the new control node, the flag of the second node is updated from the controlled node to the control node, and the flag of the first node is updated from the control node to the controlled node.

[0194] Send a first flag update request to each third node in the base station cluster except for the second node, wherein the first flag update request is used to request at least one of the following: update the flag of the first node from the control node to the controlled node, and update the flag of the second node from the controlled node to the control node.

[0195] In some embodiments, the first control module 1103 described above can also be used for:

[0196] If the time interval between the current moment and the previous moment when the computing power information of each node was obtained is greater than or equal to a preset time interval, a computing power information collection request is sent to each controlled node; or,

[0197] If the current computing power information of the control node meets the triggering conditions, a computing power information collection request is sent to each controlled node.

[0198] In some embodiments, the apparatus 1100 for determining the control node in the base station cluster described above can also be used for:

[0199] Receive a first computing power performance comparison request sent by any node, wherein the first computing power performance comparison request includes the second computing power information of any node;

[0200] Without performing a comparison of computing power performance with other nodes, the node with higher computing power performance is determined based on the second computing power information and the current third computing power information of the first node.

[0201] If any node has high computing power, an indication message is sent to that node, whereby the indication message indicates that any node has high computing power.

[0202] In some embodiments, the apparatus 1100 for determining the control node in the base station cluster described above can also be used for:

[0203] If the first node is a node with high computing power, then the target node is determined.

[0204] Send a second computing power performance comparison request to the target node, wherein the second computing power performance comparison request includes third computing power information;

[0205] If an instruction message is received from the target node within a preset time period, the process returns to perform the operation of determining the target node until no new instruction messages are received from the target node.

[0206] In some embodiments, the apparatus 1100 for determining the control node in the base station cluster described above can also be used for:

[0207] The target node is determined from all nodes in the base station cluster except for any node and the first node; or...

[0208] The first computing power performance comparison request includes the identifier of at least one fourth node that has performed a computing power performance comparison, and identifies one other node in the base station cluster other than any node, the first node, and at least one fourth node as the target node.

[0209] In some embodiments, the apparatus 1100 for determining the control node in the base station cluster described above can also be used for:

[0210] If the first node determines that it is the current control node of the base station cluster, it sends a second flag update request to each controlled node in the base station cluster. The second flag update request is used to request that the flag of the first node be updated from that of a normal node to that of a control node.

[0211] In some embodiments, the apparatus 1100 for determining the control node in the base station cluster described above can also be used for:

[0212] If the first node is currently the control node in the base station cluster, obtain the current service information of each node;

[0213] Determine the current energy-saving strategy for each node based on its current business information;

[0214] Based on the current first energy-saving strategy of the first node, control the working state of the first node;

[0215] Send the current second energy-saving strategy of each controlled node to each controlled node.

[0216] In some embodiments, the apparatus 1100 for determining the control node in the base station cluster described above can also be used for:

[0217] Send the first energy-saving strategy to the execution unit in the first node, so that the execution unit can execute the first energy-saving strategy;

[0218] Send the current second energy-saving strategy of each controlled node to each controlled node, including:

[0219] The current second energy-saving strategy of each controlled node is sent to the strategy unit in each controlled node.

[0220] In some embodiments, the apparatus 1100 for determining the control node in the base station cluster described above can also be used for:

[0221] Receive service information transmission requests from the controlled node;

[0222] Send business information and responses to the controlled nodes;

[0223] Receive service information sent by the controlled node;

[0224] Send a service information reception completion indication to the controlled node.

[0225] It should be noted that the foregoing explanation of the method embodiment for determining the control node in the base station cluster also applies to the apparatus for determining the control node in the base station cluster in this embodiment, and will not be repeated here.

[0226] In this embodiment, when the first node is currently the control node in the base station cluster, the first node first obtains the current first computing power information of each node in the base station cluster. Then, based on the first computing power information of each node, it determines the second node with the highest current computing power performance in the base station cluster. Subsequently, when the second node is not the control node, it controls the second node to switch to become the new control node in the base station cluster. Thus, based on the computing power information, the node with the highest current computing power performance in the base station cluster is selected as the control node, thereby ensuring that the base station cluster always maintains optimal computing power. This avoids the situation where the computing power decreases under high load due to a fixed master base station, making it impossible to adjust energy-saving strategies in a timely manner, and improves the efficiency of autonomy within the base station cluster.

[0227] Figure 12 This is a schematic diagram of the apparatus for determining a control node in a base station cluster, provided in another embodiment of this disclosure.

[0228] like Figure 12 As shown, when the device 1200 for determining the control node in the base station cluster is configured in the second node, it includes:

[0229] The first sending module 1201 is used to send the first computing power information of the second node to the control node in the base station cluster when the second node is currently a controlled node in the base station cluster.

[0230] The second control module 1202 is used to control the second node to switch to the new control node in the base station cluster when it receives a control permission switching instruction sent by the control node.

[0231] In some embodiments, the second control module 1202 described above can also be used for:

[0232] Send a control permission switch response to the control node, where the switch response indicates whether the second node has successfully switched to the new control node.

[0233] In some embodiments, the apparatus 1200 for determining the control node in the base station cluster described above can also be used for:

[0234] When the second node is switched to the new control node, the flag of the second node is updated from the controlled node to the control node, and the flag of the control node is updated from the control node to the controlled node.

[0235] Send a first flag update request to each third node in the base station cluster other than the control node, wherein the first flag update request is used to request at least one of the following: update the flag of the control node from the control node to the controlled node, and update the flag of the second node from the controlled node to the control node.

[0236] In some embodiments, the first transmitting module 1201 described above can also be used for:

[0237] Upon receiving a request to collect computing power information from the control node, send the first computing power information to the control node; or,

[0238] The system sends computing power information reporting requests to the control node at preset time intervals, and sends first computing power information to the control node upon receiving a computing power information reporting response from the control node.

[0239] In some embodiments, the apparatus 1200 for determining the control node in the base station cluster described above can also be used for:

[0240] After confirming that the base station cluster has been successfully created, a first computing power performance comparison request is sent to any node in the base station cluster. The first computing power performance comparison request includes the second computing power information of the second node.

[0241] If no indication is received from any node, the second node is identified as a controlled node.

[0242] In some embodiments, the apparatus 1200 for determining the control node in the base station cluster described above can also be used for:

[0243] Upon receiving an indication from any node, the flag of any node is updated to a controlled node, and a second computing power performance comparison request is sent to one other node in the base station cluster, excluding any node and the second node. The second computing power performance comparison request includes second computing power information.

[0244] If an instruction message is received from another node within a preset time period, the operation of sending a second computing power message to another node will be executed until no more instruction messages are received.

[0245] In some embodiments, the apparatus 1200 for determining control nodes in a base station cluster further includes an identifier of any node in the second computing power performance comparison request:

[0246] In some embodiments, the apparatus 1200 for determining the control node in the base station cluster described above can also be used for:

[0247] Send the current business information of the second node to the control node;

[0248] Receive the second energy-saving strategy sent by the control node;

[0249] Implement the second energy-saving strategy.

[0250] In some embodiments, the apparatus 1200 for determining the control node in the base station cluster described above can also be used for:

[0251] Receive the second energy-saving strategy sent by the strategy unit of the control node;

[0252] Implementing the second energy-saving strategy includes:

[0253] Control the execution unit in the second node to execute the second energy-saving strategy.

[0254] In some embodiments, the apparatus 1200 for determining the control node in the base station cluster described above can also be used for:

[0255] Send a service information sending request to the control node;

[0256] Upon receiving a response from the control node regarding the service information sent by the control node, the second node sends its current service information to the control node.

[0257] It should be noted that the foregoing explanation of the method embodiment for determining the control node in the base station cluster also applies to the apparatus for determining the control node in the base station cluster in this embodiment, and will not be repeated here.

[0258] In this embodiment, when the second node is currently a controlled node in the base station cluster, it first sends the second node's current computing power information to the control node in the base station cluster. Then, upon receiving a control permission switching instruction from the control node, it controls the second node to switch to become the new control node in the base station cluster. This achieves the switching of control rights among nodes in the base station cluster, enabling timely replacement of control nodes and ensuring that the computing power performance within the base station cluster remains at a high level. This provides conditions for timely adjustments to energy-saving strategies.

[0259] According to embodiments of this disclosure, this disclosure also provides a network node, a readable storage medium, and a computer program product.

[0260] Figure 13 A schematic block diagram of an example network node 1300 that can be used to implement embodiments of the present disclosure is shown. The network node is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0261] like Figure 13As shown, the network node 1300 may include a computing unit 1301, which can perform various appropriate actions and processes based on a computer program stored in read-only memory (ROM) 1302 or a computer program loaded from storage unit 1308 into random access memory (RAM) 1303. The RAM 1303 may also store various programs and data required for the operation of the device 1300. The computing unit 1301, ROM 1302, and RAM 1303 are interconnected via bus 1304. An input / output (I / O) interface 1305 is also connected to bus 1304.

[0262] Multiple components in device 1300 are connected to I / O interface 1305, including: input unit 1306, such as keyboard, mouse, etc.; output unit 1307, such as various types of monitors, speakers, etc.; storage unit 1308, such as disk, optical disk, etc.; and communication unit 1309, such as network card, modem, wireless transceiver, etc. Communication unit 1309 allows device 1300 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0263] The computing unit 1301 can be various general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the computing unit 1301 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 1301 performs the various methods and processes described above, such as the template generation method. For example, in some embodiments, the template generation method may be implemented as a computer software program tangibly contained in a machine-readable medium, such as storage unit 1308. In some embodiments, part or all of the computer program may be loaded and / or installed on device 1300 via ROM 1302 and / or communication unit 1309. When the computer program is loaded into RAM 1303 and executed by the computing unit 1301, one or more steps of the template generation method described above may be performed. Alternatively, in other embodiments, the computing unit 1301 may be configured to perform a template generation method by any other suitable means (e.g., by means of firmware).

[0264] Various embodiments of the apparatuses and techniques described above herein can be implemented in digital electronic circuit devices, integrated circuit devices, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), device-on-a-chip (SoC) devices, complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable device including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage device, at least one input device, and at least one output device, and transmitting data and instructions to the storage device, the at least one input device, and the at least one output device.

[0265] The program code used to implement the methods of this disclosure may be written in any combination of one or more programming languages. This program code may be provided to a processor or controller of a general-purpose computer, special-purpose computer, or other programmable data processing apparatus, such that when executed by the processor or controller, the program code causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code may be executed entirely on a machine, partially on a machine, as a standalone software package partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0266] In the context of this disclosure, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution apparatus, device, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can be, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor device, device, or device, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0267] To provide interaction with a user, the apparatus and techniques described herein can be implemented on a computer having: a display device for displaying information to the user (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor); and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the computer. Other types of apparatus can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0268] The apparatus and techniques described herein can be implemented in computing devices that include backend components (e.g., as a data server), or computing devices that include middleware components (e.g., an application server), or computing devices that include frontend components (e.g., a user computer with a graphical user interface or web browser through which a user can interact with embodiments of the apparatus and techniques described herein), or computing devices that include any combination of such backend, middleware, or frontend components. The components of the apparatus can be interconnected via digital data communication of any form or medium (e.g., a communication network). Examples of communication networks include local area networks (LANs), wide area networks (WANs), the Internet, and blockchain networks.

[0269] Computer devices can include clients and servers. Clients and servers are generally located far apart and typically interact via communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. A server can be a cloud server, also known as a cloud service server or cloud host, a hosting product within the cloud service ecosystem, designed to address the shortcomings of traditional physical hosts and VPS (Virtual Private Server) services, such as high management difficulty and weak business scalability. A server can be a cloud server, a distributed server, or a server incorporating blockchain technology.

[0270] It should be understood that the various forms of processes shown above can be used to reorder, add, or delete steps. For example, the steps described in this disclosure can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution disclosed in this disclosure can be achieved, and this is not limited herein.

[0271] The specific embodiments described above do not constitute a limitation on the scope of protection of this disclosure. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this disclosure should be included within the scope of protection of this disclosure.

Claims

1. A method for determining control nodes in a base station cluster, characterized in that, Executed by the first node, the method includes: If the first node is currently the control node in the base station cluster, obtain the current first computing power information of each node in the base station cluster; Based on each of the first computing power information, determine the current utilization rate of computing power resources in each dimension of each node; Based on the current utilization rate of computing resources in each dimension of each node and the weight value of each dimension, the current computing performance parameters of each node are determined. The node with the highest corresponding computing power performance parameter is designated as the second node; If the second node is not the control node, control the second node to switch to the new control node in the base station cluster.

2. The method as described in claim 1, characterized in that, The control of switching the second node to a new control node in the base station cluster includes: Send a control permission switch request to the second node; Receive the control permission switching response returned by the second node; If the control authority switching response indicates a successful switch, the second node is determined to be the new control node in the base station cluster.

3. The method as described in claim 1, characterized in that, After the control node is switched to become the new control node in the base station cluster, the method further includes: If it is determined that the second node has been switched to the new control node, the flag of the second node is updated from the controlled node to the control node, and the flag of the first node is updated from the control node to the controlled node. Send a first flag update request to each third node in the base station cluster other than the second node, wherein the first flag update request is used to request at least one of the following: update the flag of the first node from the control node to the controlled node, and update the flag of the second node from the controlled node to the control node.

4. The method according to any one of claims 1-3, characterized in that, The step of obtaining the current first computing power information of each node in the base station cluster includes: Send a computing power information collection request to each controlled node; Receive the current first computing power information returned by each of the controlled nodes.

5. The method as described in claim 4, characterized in that, Sending a computing power information collection request to each controlled node includes: If the time interval between the current moment and the previous moment when the computing power information of each node was obtained is greater than or equal to a preset time interval, a computing power information collection request is sent to each controlled node; or, If the current computing power information of the control node meets the triggering conditions, a computing power information collection request is sent to each controlled node.

6. The method according to any one of claims 1-3, characterized in that, Also includes: Receive a first computing power performance comparison request sent by any node, wherein the first computing power performance comparison request includes the second computing power information of the any node; Without performing a comparison of computing power performance with other nodes, based on the second computing power information and the current third computing power information of the first node, the computing power performance of any node and the first node is compared to determine the node with higher computing power performance between any node and the first node. If any of the nodes has higher computing power, an indication message is sent to that node, wherein the indication message is used to indicate that the computing power of that node is higher.

7. The method as described in claim 6, characterized in that, After determining the node with higher computing power performance among the chosen node and the first node, the method further includes: If the first node is the node with higher computing power performance, then the target node is determined; Send a second computing power performance comparison request to the target node, wherein the second computing power performance comparison request includes the third computing power information; If, within a preset time period, an instruction message is received from the target node, the operation of determining the target node is returned to continue until no further instruction messages from the target node are received.

8. The method as described in claim 7, characterized in that, The determination of the target node includes: The target node is determined by identifying one other node in the base station cluster besides the aforementioned node and the first node; or... The first computing power performance comparison request includes the identifier of at least one fourth node that has performed a computing power performance comparison, and identifies one other node in the base station cluster other than any of the nodes, the first node and at least one of the fourth nodes as the target node.

9. The method as described in claim 7, characterized in that, Also includes: If the first node determines that it is the current control node of the base station cluster, a second flag update request is sent to each controlled node in the base station cluster. The second flag update request is used to request that the flag of the first node be updated from that of a normal node to that of a control node.

10. The method according to any one of claims 1-3, characterized in that, Also includes: If the first node is currently the control node in the base station cluster, obtain the current service information of each node; Based on the current business information of each node, determine the current energy-saving strategy for each node; Based on the first energy-saving strategy of the first node, control the working state of the first node; The current second energy-saving strategy of each controlled node is sent to each controlled node.

11. The method as described in claim 10, characterized in that, The control of the operating state of the first node based on the current energy-saving strategy includes: Send a first energy-saving strategy to the execution unit in the first node, so that the execution unit executes the first energy-saving strategy; Sending the current second energy-saving strategy of each controlled node to each controlled node includes: The current second energy-saving strategy of each controlled node is sent to the strategy unit in each controlled node.

12. The method as described in claim 10, characterized in that, The step of obtaining the current business information of each node includes: Receive service information transmission requests from the controlled node; Send service information and send a response to the controlled node; Receive service information sent by the controlled node; Send a service information reception completion indication to the controlled node.

13. A method for determining control nodes in a base station cluster, characterized in that, Executed by the second node, the method includes: When the second node is currently a controlled node in the base station cluster, the first computing power information of the second node is sent to the control node in the base station cluster, wherein the second node is the node with the highest corresponding computing power performance parameter determined by the method according to any one of claims 1-12; Upon receiving a control permission switching instruction sent by the control node, the second node is controlled to switch to become the new control node in the base station cluster.

14. The method as described in claim 13, characterized in that, After the control node is switched to become the new control node in the base station cluster, the method further includes: A control permission switching response is sent to the control node, wherein the switching response is used to indicate whether the second node has successfully switched to the new control node.

15. The method as described in claim 13, characterized in that, Also includes: When the second node is switched to the new control node, the flag of the second node is updated from the controlled node to the control node, and the flag of the control node is updated from the control node to the controlled node. Send a first flag update request to each third node in the base station cluster other than the control node, wherein the first flag update request is used to request at least one of the following: update the flag of the control node from the control node to the controlled node, and update the flag of the second node from the controlled node to the control node.

16. The method as described in claim 13, characterized in that, Sending the first computing power information of the second node to the control node in the base station cluster includes: Upon receiving a computing power information collection request from the control node, the first computing power information is sent to the control node; or, The system sends a computing power information reporting request to the control node at preset time intervals, and sends the first computing power information to the control node upon receiving a computing power information reporting response from the control node.

17. The method according to any one of claims 13-16, characterized in that, Also includes: After confirming that the base station cluster has been successfully created, a first computing power performance comparison request is sent to any node in the base station cluster, wherein the first computing power performance comparison request includes the second computing power information of the second node; If no indication is received from either of the nodes, the second node is identified as a controlled node.

18. The method as described in claim 17, characterized in that, After sending the first computing power performance comparison request to any node in the base station cluster, the method further includes: Upon receiving the indication information returned by any of the nodes, the flag of any of the nodes is updated to a controlled node, and a second computing power performance comparison request is sent to one other node in the base station cluster other than any of the nodes and the second node, wherein the second computing power performance comparison request includes the second computing power information; If, within a preset time period, an indication message is received from another node, the operation of sending the second computing power information to another node in the base station cluster other than either of the first node and the second node is returned, until no further indication messages are received.

19. The method as described in claim 18, characterized in that, The second computing power performance comparison request also includes the identifier of any of the nodes.

20. The method according to any one of claims 13-16, characterized in that, Also includes: Send the current service information of the second node to the control node; Receive the second energy-saving strategy sent by the control node; Implement the second energy-saving strategy.

21. The method as described in claim 20, characterized in that, The second energy-saving strategy received from the control node includes: Receive the second energy-saving strategy sent by the strategy unit of the control node; The execution of the second energy-saving strategy includes: Control the execution unit in the second node to execute the second energy-saving strategy.

22. The method as described in claim 20, characterized in that, Sending the current service information of the second node to the control node includes: Send a service information sending request to the control node; Upon receiving a service information transmission response from the control node, the second node sends its current service information to the control node.

23. An apparatus for determining control nodes in a base station cluster, characterized in that, The device is configured at the first node and includes: The first acquisition module is used to acquire the current first computing power information of each node in the base station cluster when the first node is currently a control node in the base station cluster. The first determining module is used to determine the current utilization rate of computing resources in each dimension of each node based on each of the first computing power information. The second determining module is used to determine the current computing power performance parameters of each node based on the current utilization rate of computing power resources in each dimension of each node and the weight value of each dimension. The third determination module is used to determine the node with the highest corresponding computing power performance parameter as the second node; The first control module is used to control the second node to switch to a new control node in the base station cluster when the second node is not the control node.

24. An apparatus for determining control nodes in a base station cluster, characterized in that, The device is configured at the second node and includes: The first sending module is configured to send the current first computing power information of the second node to the control node in the base station cluster when the second node is currently a controlled node in the base station cluster, wherein the second node is the node with the highest corresponding computing power performance parameter determined by the device according to claim 23. The second control module is used to control the second node to switch to the new control node in the base station cluster when it receives a control permission switching instruction sent by the control node.

25. A network node, characterized in that, include At least one processor; as well as A memory communicatively connected to the at least one processor; wherein, The memory stores instructions executable by the at least one processor, which, when executed by the at least one processor, enables the at least one processor to perform the method for determining a control node in a base station cluster as described in any one of claims 1-22.

26. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it implements the method for determining control nodes in a base station cluster as described in any one of claims 1-22.

27. A computer program product comprising a computer program that, when executed by a processor, implements the method for determining a control node in a base station cluster as described in any one of claims 1-22.

Images