Antenna node grouping method, apparatus, and network device

Abstract

The application provides an antenna node grouping method, device and network equipment, and relates to the technical field of communication. The method comprises the following steps: determining the isolation evaluation value between each two antenna nodes in a plurality of antenna nodes; determining the cost weight value of each two antenna nodes being allocated to the same group according to the isolation evaluation value between each two antenna nodes; and determining the grouping mode of the plurality of antenna nodes being allocated to K groups according to the cost weight value of each two antenna nodes being allocated to the same group; wherein K is an integer greater than or equal to 2. According to the isolation evaluation value between each two antenna nodes, the cost weight value of each two antenna nodes being allocated to the same group is determined, and the grouping mode of the plurality of antenna nodes is determined by optimization using the determined cost weight value, so that the automatic re-allocation of the antenna nodes can be realized.

Description

Technical Field

[0001] This application relates to the field of wireless technology, and in particular to an antenna node grouping method, apparatus, and network device. Background Technology

[0002] A distributed antenna system is a mobile communication network composed of multiple spatially separated antenna nodes within a predetermined space or building. When coordination is required between adjacent antenna nodes (such as for joint downlink transmission), the downlink reference signal (e.g., Channel State Information Reference Signal, CSIRS) ports of adjacent antenna nodes need to be staggered. This allows the terminal to effectively distinguish signals from different antenna nodes during measurement, enabling reasonable measurement and reporting. However, the deployment location of distributed systems is relatively flexible, and it is difficult to manually determine which adjacent antenna nodes need to have their resources staggered and which can reuse the same resources during the deployment phase. Currently, the specific locations of antenna nodes are not known during resource allocation, and antenna nodes are not grouped. If it is necessary to group Remote Radio Units (RRUs) and allocate different resources, the allocation can only be staggered based on RRU numbers.

[0003] Furthermore, the operation and maintenance of distributed antenna systems in existing solutions cannot guarantee the resource spacing between adjacent Remote Radio Units (RRUs), and cannot reallocate resources when adding or deleting antenna nodes. This can result in adjacent RRUs in the coverage area being assigned to the same group, causing terminals in that area to receive only some port CSIRS signals. Consequently, terminals cannot accurately obtain channel information from the downlink transmission port, which affects the measurement and reporting of Channel Quality Indication (CQI), Rank Indicator (RI), and Precoding Matrix Indicator (PMI), thus violating the original design intent of CSIRS measurement. Summary of the Invention

[0004] This application provides an antenna node grouping method, apparatus, and network device to solve the problem in distributed antenna systems where the resource spacing between adjacent RRUs cannot be guaranteed, and the antenna nodes cannot be reallocated when they are added or deleted. This results in adjacent RRUs in the coverage area being assigned to the same group, causing terminals in that area to receive only some port CSIRS signals, thus preventing the terminals from accurately obtaining the channel information of the downlink transmission port.

[0005] This application provides an antenna node grouping method, wherein the method includes:

[0006] Determine the isolation evaluation value between every two antenna nodes in a multi-antenna node system;

[0007] Based on the isolation evaluation value between every two antenna nodes in the plurality of antenna nodes, determine the cost weight for allocating every two antenna nodes to the same group in the plurality of antenna nodes;

[0008] Based on the cost weight of assigning each pair of antenna nodes to the same group, the grouping method of the multiple antenna nodes into K groups is determined; where K is an integer greater than or equal to 2.

[0009] Optionally, in the antenna node grouping method, determining the isolation evaluation value between every two antenna nodes in the plurality of antenna nodes includes:

[0010] Based on the target parameter measurements of each of the plurality of antenna nodes measured by the user, an isolation evaluation value is determined between every two antenna nodes; or

[0011] Based on the positional distance between each pair of antenna nodes, an isolation evaluation value is determined for each pair of antenna nodes.

[0012] Optionally, the antenna node grouping method further includes: reallocating the grouping of the plurality of antenna nodes into K groups when at least one of the following conditions is detected:

[0013] The number of the plurality of antenna nodes changes;

[0014] The positional changes of the plurality of antenna nodes;

[0015] The isolation evaluation value between every two antenna nodes in the plurality of antenna nodes is determined periodically, and the total weight value corresponding to the current grouping method is calculated. The total weight value calculated in this time is higher than the total weight value calculated in the previous time. The total weight value is the sum of the cost weight values ​​calculated in the current grouping method based on the cost weight value of every two antenna nodes belonging to the same group.

[0016] The uplink and downlink antenna node affiliation is determined for all users. The number of conflicting antenna nodes belonging to the same user is greater than a preset value.

[0017] Optionally, the antenna node grouping method, wherein determining the grouping method of the plurality of antenna nodes into K groups based on the cost weight of assigning every two antenna nodes to the same group includes:

[0018] The determined grouping method has the smallest total weight compared to other grouping methods; wherein, the total weight is the sum of all cost weights calculated based on the cost weight of each pair of antenna nodes belonging to the same group in the same grouping method.

[0019] Optionally, the antenna node grouping method, wherein determining the grouping method of the plurality of antenna nodes into K groups based on the cost weight of assigning every two antenna nodes to the same group includes:

[0020] List each of the K groups of the multiple antenna nodes;

[0021] For each grouping method, calculate the total weight value corresponding to each grouping method.

[0022] The grouping method with the smallest total weight among each of the K groups is selected as the determined grouping method.

[0023] Optionally, the antenna node grouping method, wherein determining the grouping method of the plurality of antenna nodes into K groups based on the cost weight of assigning every two antenna nodes to the same group includes:

[0024] Based on the cost weights of every two antenna nodes assigned to the same group among the plurality of antenna nodes, for each antenna node, the sum of each of the cost weights assigned to the same group with each other antenna node is calculated to obtain the total cost for each antenna node.

[0025] The plurality of antenna nodes are sorted according to the total cost;

[0026] Based on the sorted multiple antenna nodes, the group to which each antenna node belongs is sequentially set to obtain the group setting method;

[0027] The total weight value corresponding to each of the multiple set grouping methods is determined sequentially until the set grouping method with the smallest total weight value is obtained; the total weight value is the sum of the cost weight values ​​calculated for each set grouping method based on the cost weight value of each pair of antenna nodes belonging to the same group;

[0028] The grouping method with the minimum total weight is determined as the grouping method.

[0029] Optionally, the antenna node grouping method, wherein sorting the plurality of antenna nodes according to the total cost calculated for each antenna node includes:

[0030] Based on the total cost calculated for each of the multiple antenna nodes, the antenna node with the highest total cost is selected, written into the sorting queue, and used as the currently written antenna node.

[0031] Antenna nodes that are associated with the currently written antenna node are sequentially written into the sorting queue until every antenna node is written into the sorting queue, thus completing the sorting of the multiple antenna nodes.

[0032] Optionally, the antenna node grouping method, wherein writing antenna nodes associated with the currently written antenna node into a sorting queue in sequence includes:

[0033] When there is only one antenna node with an association relationship, the antenna node with the association relationship is written into the sorting queue, and the written antenna node is used as the currently written antenna node, and the next antenna node to be written into the sorting queue is further determined.

[0034] When there are at least two antenna nodes with a relationship, the first antenna node with a relationship with the currently written antenna node will be written into the sorting queue and used as the currently written antenna node.

[0035] The first antenna node is the antenna node with the largest cost weight among at least two antenna nodes that are associated with each other, and the antenna node that is currently being written.

[0036] Optionally, the antenna node grouping method further includes:

[0037] When there are at least two first antenna nodes, select the first antenna node with the smallest total cost among the at least two first antenna nodes, write it into the sorting queue, and use it as the antenna node to be written.

[0038] Optionally, the antenna node grouping method further includes:

[0039] When the number of the first antenna nodes is at least two, and the number of the first antenna nodes with the smallest total cost among the at least two first antenna nodes is also at least two, then the total number of samples used to obtain the isolation evaluation value by the at least two first antenna nodes with the smallest total cost is compared.

[0040] Write the first antenna node with the lowest total number of samples among at least two first antenna nodes into the sorting queue and use it as the currently written antenna node.

[0041] Optionally, the antenna node grouping method, wherein the step of sequentially setting the group to which each of the sorted antenna nodes belongs to obtain the set grouping method, includes:

[0042] Starting from the first antenna node of the sorted multiple antenna nodes, each antenna node in the sorted multiple antenna nodes is sequentially taken as the Nth antenna node. The group to which the Nth antenna node belongs is selected. Among the selected groups, the total cost corresponding to the Nth antenna node is the smallest sum of the total costs corresponding to the N-1 antenna nodes before the Nth antenna node.

[0043] Wherein, N is an integer greater than 1, and the Nth antenna node is one of the sorted antenna nodes.

[0044] Optionally, in the antenna node grouping method, determining the cost weight for assigning each pair of antenna nodes to the same group based on the isolation evaluation value between each pair of antenna nodes includes:

[0045] Using the pre-defined correspondence between isolation evaluation values ​​and cost weights, the cost weight for each pair of antenna nodes to be assigned to the same group is determined based on the isolation evaluation values ​​between each pair of antenna nodes.

[0046] In the aforementioned correspondence, the isolation evaluation values ​​for different range intervals correspond to different cost weights.

[0047] Optionally, in the antenna node grouping method, determining the isolation evaluation value between every two antenna nodes based on the target parameter measurement values ​​of each of the plurality of antenna nodes measured by the user includes:

[0048] Based on the target parameter measurement values ​​measured by the user for each of the plurality of antenna nodes within a first preset time period, an isolation sample is determined for every two antenna nodes; wherein, the isolation sample is equal to the absolute value of the difference between the target parameter measurement values ​​measured by the corresponding two antenna nodes within the first preset time period.

[0049] Calculate the average value of multiple isolation degree samples of every two antenna nodes within a second preset time period, and determine the average value as the isolation degree evaluation value between the corresponding two antenna nodes; wherein, the second preset time period is longer than the first preset time period.

[0050] This application also provides a network device, comprising:

[0051] A memory for storing computer programs; a transceiver for sending and receiving data under the control of the processor; and a processor for reading the computer programs from the memory and performing the following operations:

[0052] Determine the isolation evaluation value between every two antenna nodes in a multi-antenna node system;

[0053] Based on the isolation evaluation value between every two antenna nodes in the plurality of antenna nodes, determine the cost weight for allocating every two antenna nodes to the same group in the plurality of antenna nodes;

[0054] Based on the cost weight of assigning each pair of antenna nodes to the same group, the grouping method of the multiple antenna nodes into K groups is determined; where K is an integer greater than or equal to 2.

[0055] Optionally, in the network device, the processor determines an isolation evaluation value between every two antenna nodes in a plurality of antenna nodes, including:

[0056] Based on the target parameter measurements of each of the plurality of antenna nodes measured by the user, an isolation evaluation value is determined between every two antenna nodes; or

[0057] Based on the positional distance between each pair of antenna nodes, an isolation evaluation value is determined for each pair of antenna nodes.

[0058] Optionally, in the network device, the processor is further configured to: reallocate the grouping of the plurality of antenna nodes into K groups when at least one of the following conditions is detected:

[0059] The number of the plurality of antenna nodes changes;

[0060] The positional changes of the plurality of antenna nodes;

[0061] The isolation evaluation value between every two antenna nodes in the plurality of antenna nodes is determined periodically, and the total weight value corresponding to the current grouping method is calculated. The total weight value calculated in this time is higher than the total weight value calculated in the previous time. The total weight value is the sum of the cost weight values ​​calculated in the current grouping method based on the cost weight value of every two antenna nodes belonging to the same group.

[0062] The uplink and downlink antenna node affiliation is determined for all users. The number of conflicting antenna nodes belonging to the same user is greater than a preset value.

[0063] Optionally, in the network device, the processor determines the grouping method of the plurality of antenna nodes into K groups based on the cost weight of assigning every two antenna nodes to the same group, including:

[0064] The determined grouping method has the smallest total weight compared to other grouping methods; wherein, the total weight is the sum of all cost weights calculated based on the cost weight of each pair of antenna nodes belonging to the same group in the same grouping method.

[0065] Optionally, in the network device, the processor determines the grouping method of the plurality of antenna nodes into K groups based on the cost weight of assigning every two antenna nodes to the same group, including:

[0066] List each of the K groups of the multiple antenna nodes;

[0067] For each grouping method, calculate the total weight value corresponding to each grouping method.

[0068] The grouping method with the smallest total weight among each of the K groups is selected as the determined grouping method.

[0069] Optionally, in the network device, the processor determines the grouping method of the plurality of antenna nodes into K groups based on the cost weight of assigning every two antenna nodes to the same group, including:

[0070] Based on the cost weights of every two antenna nodes assigned to the same group among the plurality of antenna nodes, for each antenna node, the sum of each of the cost weights assigned to the same group with each other antenna node is calculated to obtain the total cost for each antenna node.

[0071] The plurality of antenna nodes are sorted according to the total cost;

[0072] Based on the sorted multiple antenna nodes, the group to which each antenna node belongs is sequentially set to obtain the group setting method;

[0073] The total weight value corresponding to each of the multiple set grouping methods is determined sequentially until the set grouping method with the smallest total weight value is obtained; the total weight value is the sum of the cost weight values ​​calculated for each set grouping method based on the cost weight value of each pair of antenna nodes belonging to the same group;

[0074] The grouping method with the minimum total weight is determined as the required grouping method.

[0075] Optionally, in the network device, the processor sorts the plurality of antenna nodes according to the total cost calculated for each antenna node, including:

[0076] Based on the total cost calculated for each of the multiple antenna nodes, the antenna node with the highest total cost is selected, written into the sorting queue, and used as the currently written antenna node.

[0077] Antenna nodes that are associated with the currently written antenna node are sequentially written into the sorting queue until every antenna node is written into the sorting queue, thus completing the sorting of the multiple antenna nodes.

[0078] Optionally, in the network device, the processor sequentially writes antenna nodes associated with the currently written antenna node into a sorting queue, including:

[0079] When there is only one antenna node with an association relationship, the antenna node with the association relationship is written into the sorting queue, and the written antenna node is used as the currently written antenna node, and the next antenna node to be written into the sorting queue is further determined.

[0080] When there are at least two antenna nodes with a relationship, the first antenna node with a relationship with the currently written antenna node will be written into the sorting queue and used as the currently written antenna node.

[0081] The first antenna node is the antenna node with the largest cost weight among at least two antenna nodes that are associated with each other, and the antenna node that is currently being written.

[0082] Optionally, in the network device, the processor is further configured to:

[0083] When there are at least two first antenna nodes, select the first antenna node with the smallest total cost among the at least two first antenna nodes, write it into the sorting queue, and use it as the antenna node to be written.

[0084] Optionally, in the network device, the processor is further configured to:

[0085] When the number of the first antenna nodes is at least two, and the number of the first antenna nodes with the smallest total cost among the at least two first antenna nodes is also at least two, then the total number of samples used to obtain the isolation evaluation value by the at least two first antenna nodes with the smallest total cost is compared.

[0086] Write the first antenna node with the lowest total number of samples among at least two first antenna nodes into the sorting queue and use it as the currently written antenna node.

[0087] Optionally, in the network device, the processor sequentially sets the group to which each of the sorted antenna nodes belongs, to obtain a set grouping method, including:

[0088] Starting from the first antenna node of the sorted multiple antenna nodes, each antenna node in the sorted multiple antenna nodes is sequentially taken as the Nth antenna node. The group to which the Nth antenna node belongs is selected. Among the selected groups, the total cost corresponding to the Nth antenna node is minimized by the sum of the total costs corresponding to the N-1 antenna nodes before the Nth antenna node.

[0089] Wherein, N is an integer greater than 1, and the Nth antenna node is one of the sorted antenna nodes.

[0090] Optionally, in the network device, the processor determines the cost weight for allocating each pair of antenna nodes to the same group based on the isolation evaluation value between each pair of antenna nodes, including:

[0091] Using the pre-defined correspondence between isolation evaluation values ​​and cost weights, the cost weight for each pair of antenna nodes to be assigned to the same group is determined based on the isolation evaluation values ​​between each pair of antenna nodes.

[0092] In the aforementioned correspondence, the isolation evaluation values ​​for different range intervals correspond to different cost weights.

[0093] Optionally, in the network device, the processor determines an isolation evaluation value between every two antenna nodes based on target parameter measurements of each of the plurality of antenna nodes measured by the user, including:

[0094] Based on the target parameter measurement values ​​measured by the user for each of the plurality of antenna nodes within a first preset time period, an isolation sample is determined for every two antenna nodes; wherein, the isolation sample is equal to the absolute value of the difference between the target parameter measurement values ​​measured by the corresponding two antenna nodes within the first preset time period.

[0095] Calculate the average value of multiple isolation degree samples of every two antenna nodes within a second preset time period, and determine the average value as the isolation degree evaluation value between the corresponding two antenna nodes; wherein, the second preset time period is longer than the first preset time period.

[0096] This application embodiment also provides an antenna node grouping device, wherein the device includes:

[0097] The isolation evaluation unit is used to determine the isolation evaluation value between every two antenna nodes in a plurality of antenna nodes;

[0098] The cost evaluation unit is used to determine the cost weight of each pair of antenna nodes assigned to the same group based on the isolation evaluation value between each pair of antenna nodes in the plurality of antenna nodes.

[0099] The grouping unit is used to determine the grouping method of the multiple antenna nodes into K groups based on the cost weight of each pair of antenna nodes being assigned to the same group; wherein K is an integer greater than or equal to 2.

[0100] This application embodiment also provides a processor-readable storage medium, wherein the processor-readable storage medium stores a computer program for causing the processor to execute the antenna node grouping method as described above.

[0101] At least one of the above-described technical solutions in the embodiments of this application has the following beneficial effects:

[0102] The antenna node grouping method described in this application determines the cost weight for allocating each pair of antenna nodes to the same group based on the isolation evaluation value between each pair of antenna nodes. Using the determined cost weight, the grouping method of multiple antenna nodes is determined through optimization, so as to realize the automatic reallocation of antenna nodes and avoid the problem that RRUs adjacent to the coverage area are assigned to the same group, causing the terminal in the area to only receive the CSIRS signal of some ports and the terminal cannot accurately obtain the channel information of the downlink transmission port. Attached Figure Description

[0103] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0104] Figure 1This is a flowchart illustrating an antenna node grouping method according to one embodiment of this application;

[0105] Figure 2 This is a flowchart illustrating step S110 in an embodiment of this application.

[0106] Figure 3 This is a flowchart illustrating one embodiment of step S130 in this application.

[0107] Figure 4 This is a flowchart illustrating another implementation of step S130 in this application embodiment;

[0108] Figure 5 This diagram illustrates the cost weights among multiple antenna nodes in one embodiment of the method described in this application.

[0109] Figure 6 express Figure 5 The diagram shown illustrates the initial grouping state in the embodiment illustrated.

[0110] Figure 7 A schematic diagram illustrating the grouping method determined using the method described in the embodiments of this application;

[0111] Figure 8 This is a schematic diagram of the structure of the network device described in the embodiments of this application;

[0112] Figure 9 This is a schematic diagram of the antenna node grouping device described in the embodiments of this application. Detailed Implementation

[0113] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0114] The terms “first,” “second,” etc., used in the specification and claims of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of the application described herein may be implemented in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0115] In this application's embodiments, the term "and / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. The character " / " generally indicates that the preceding and following related objects have an "or" relationship. In this application's embodiments, the term "multiple" refers to two or more, and other quantifiers are similar.

[0116] In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of the terms "exemplary" or "for example" is intended to present the relevant concepts in a specific manner.

[0117] The embodiments of this application are described below with reference to the accompanying drawings. The antenna node grouping method provided in the embodiments of this application can be applied to a wireless communication system. This wireless communication system can be a system using fifth-generation (5G) mobile communication technology (hereinafter referred to as a 5G system). Those skilled in the art will understand that the 5G NR system is merely an example and not a limitation.

[0118] To address the issue in distributed antenna systems where the resource spacing between adjacent RRUs cannot be guaranteed, and where reallocation is impossible when adding or deleting antenna nodes, potentially causing adjacent RRUs in the coverage area to be assigned to the same group, resulting in terminals in that area only receiving CSIRS signals from a portion of the ports and thus failing to accurately obtain channel information for the downlink transmission port, this application provides an antenna node grouping method. Based on the isolation evaluation value between every two antenna nodes, a cost weight is determined for assigning each pair of antenna nodes to the same group. Using the determined cost weight, an optimization method is employed to determine the grouping pattern of multiple antenna nodes, enabling the reallocation of antenna nodes and preventing adjacent RRUs in the coverage area from being assigned to the same group, thus avoiding the problem of terminals in that area only receiving CSIRS signals from a portion of the ports and failing to accurately obtain channel information for the downlink transmission port.

[0119] One embodiment of this application provides an antenna node grouping method, such as... Figure 1 As shown, the method includes:

[0120] S110, determine the isolation evaluation value between every two antenna nodes in a plurality of antenna nodes;

[0121] S120, based on the isolation evaluation value between every two antenna nodes in the plurality of antenna nodes, determine the cost weight for allocating every two antenna nodes to the same group in the plurality of antenna nodes;

[0122] S130, based on the cost weight of each pair of antenna nodes being assigned to the same group, determine the grouping method of the multiple antenna nodes into K groups; wherein, K is an integer greater than or equal to 2.

[0123] The antenna node grouping method described in this application uses the isolation evaluation value between every two antenna nodes to determine the cost weight of each pair of antenna nodes assigned to the same group, and determines the grouping method of multiple antenna nodes into K groups based on the determined cost weight, thereby realizing the automated analysis and execution of grouping between multiple antenna nodes and the automatic reallocation of multiple antenna node groups.

[0124] Optionally, in the antenna node grouping method described in this application embodiment, when determining the grouping method of multiple antenna nodes into K groups based on the determined cost weight, an optimization method is used to assign adjacent nodes to different groups. By analyzing the cost weight of each pair of antenna nodes assigned to the same group, the total cost of nodes with group conflicts is reduced to the minimum, and the final grouping method is obtained, thus avoiding the assignment of adjacent RRUs in the coverage area to the same group.

[0125] Optionally, in step S130, based on the cost weight of assigning every two antenna nodes to the same group, the grouping method of assigning the multiple antenna nodes into K groups is determined, including:

[0126] The determined grouping method has the smallest total weight compared to other grouping methods; wherein, the total weight is the sum of all cost weights calculated based on the cost weight of each pair of antenna nodes belonging to the same group in the same grouping method.

[0127] The antenna node grouping method described in this application uses the cost weight of allocating every two antenna nodes to the same group. When dividing the groups, the sum of the cost weights of the antenna nodes belonging to the same group in the divided grouping method is calculated, that is, the total weight is calculated. The grouping method with the smallest total weight is determined as the final grouping method of allocating multiple antenna nodes into K groups.

[0128] The specific implementation structure of the antenna node grouping method described in the embodiments of this application will be described in detail below.

[0129] Optionally, step S110 involves determining the isolation evaluation value between every two antenna nodes in the plurality of antenna nodes, including:

[0130] Based on the target parameter measurements of each of the plurality of antenna nodes measured by the user, an isolation evaluation value is determined between every two antenna nodes; or

[0131] Based on the positional distance between each pair of antenna nodes, an isolation evaluation value is determined for each pair of antenna nodes.

[0132] In this embodiment of the application, multiple antenna nodes can be multiple RRUs. It should be noted that the antenna nodes are not limited to RRUs, and can refer to any processing node in the data transmission process.

[0133] In addition, the isolation evaluation value is used to represent the distance between antenna nodes. Optionally, the isolation evaluation value between each pair of antenna nodes can be determined using the target parameter measurements of the antenna nodes measured by the user. For example, the isolation evaluation value between each pair of antenna nodes can be calculated using the measured reference signal receiving power (RSRP), signal-to-noise ratio (SNR) difference, and power difference. Alternatively, the location distance between each pair of antenna nodes can be used, such as based on the antenna node positioning information, to determine the isolation evaluation value between each pair of antenna nodes.

[0134] Optionally, in one embodiment, determining an isolation evaluation value between every two antenna nodes based on the target parameter measurement values ​​of each of the plurality of antenna nodes measured by the user includes:

[0135] Based on the target parameter measurement values ​​measured by the user for each of the plurality of antenna nodes within a first preset time period, an isolation sample is determined for every two antenna nodes; wherein, the isolation sample is equal to the absolute value of the difference between the target parameter measurement values ​​measured by the corresponding two antenna nodes within the first preset time period.

[0136] Calculate the average value of multiple isolation degree samples of every two antenna nodes within a second preset time period, and determine the average value as the isolation degree evaluation value between the corresponding two antenna nodes; wherein, the second preset time period is longer than the first preset time period.

[0137] Taking the target parameter measurement values ​​including SRS and RSRP as an example, the specific implementation method for determining the isolation evaluation value between every two antenna nodes in this application embodiment will be described.

[0138] like Figure 2 As shown in this embodiment, the isolation evaluation value between every two antenna nodes is determined based on the target parameter measurement values ​​of each of the multiple antenna nodes measured by the user, including the following steps:

[0139] S201, Isolation sample collection, that is, based on the target parameter measurement values ​​measured by the user for each antenna node within the first preset time period, determine an isolation sample for every two antenna nodes.

[0140] Taking a scenario where multiple antenna nodes are set up, including m RRUs, and the first preset duration T1 is 1 second as an example, in this embodiment of the application, the difference between the average values ​​of SRS and RSRP of two corresponding antenna nodes measured by the user within the first preset duration T1 is taken as a measurement sample, that is, as an isolation sample; based on this, the difference between the average values ​​of SRS and RSRP between each pair of antenna nodes is measured respectively to obtain multiple isolation samples between each pair of antenna nodes.

[0141] For example, suppose a user can measure the SRS and RSRP of m RRUs within a time period T1. The i-th antenna node RRU i The average value of SRS and RSRP over one second is denoted as RSRP. i From which can be extracted The isolation samples between each pair of RRUs (i.e., the difference in measured RSRP) are then used to determine the isolation of the i-th antenna node RRU. i With the j-th antenna node RRU j The nth sample of the isolation between them is denoted as

[0142]

[0143] Step S202, average isolation sample, that is, calculate the average value of multiple isolation samples of every two antenna nodes within the second preset time period, and determine the average value as the isolation evaluation value between the corresponding two antenna nodes.

[0144] Through this implementation step, with a second preset duration as a statistical period (greater than the first preset duration, such as 1 day), the average value of multiple isolation degree samples between every two antenna nodes within the second preset duration is calculated to obtain the corresponding isolation degree evaluation value between the two antenna nodes.

[0145] For example, within a second preset time period, for the i-th antenna node RRU i With the j-th antenna node RRU j The isolation degree between them is N i,j For each isolation degree sample, N i,j The average value of each isolation degree sample is used to obtain the RRU of the i-th antenna node. i With the j-th antenna node RRU j The isolation evaluation value between them is evaluated in the following way:

[0146]

[0147] Thus, by employing the above implementation method and processing procedure, and by statistically analyzing the target parameter measurement values ​​of different antenna nodes measured by the user within a second preset time period, an isolation evaluation value between every two antenna nodes is obtained, such as I.i,j .

[0148] Optionally, in this embodiment of the application, step S120, determining the cost weight for allocating each pair of antenna nodes to the same group based on the isolation evaluation value between each pair of antenna nodes, includes:

[0149] Using the pre-defined correspondence between isolation evaluation values ​​and cost weights, the cost weight for each pair of antenna nodes to be assigned to the same group is determined based on the isolation evaluation values ​​between each pair of antenna nodes.

[0150] In the aforementioned correspondence, the isolation evaluation values ​​for different range intervals correspond to different cost weights.

[0151] It should be noted that, in the embodiments of this application, the basic principle for defining the cost weight is: the cost weight between adjacent antenna nodes (i.e., those with lower isolation evaluation values) is higher; conversely, the cost weight between antenna nodes that are farther apart (i.e., those with higher isolation evaluation values) is lower.

[0152] Based on this principle, the correspondence between isolation evaluation value and cost weight can be pre-defined. According to the defined correspondence, the cost weight of each pair of antenna nodes assigned to the same group can be determined based on the isolation evaluation value between each pair of antenna nodes calculated in the above manner.

[0153] For example, the isolation evaluation value can be divided into multiple segments. The division method can be either uniform or non-uniform, and a cost weight W corresponding to each segment range of the isolation evaluation value can be set. i,j As shown in the table below:

[0154]

[0155] It should be noted that the cost weights corresponding to each segment of the isolation evaluation value in the table above are only illustrative examples and are not limited to this. Moreover, the isolation evaluation values ​​within the same segment may be different under different design requirements, and can be set according to actual requirements.

[0156] In one embodiment of the antenna node grouping method described in this application, optionally, in step S130, as... Figure 3 As shown, based on the cost weight of assigning every two antenna nodes to the same group, the grouping method for assigning the multiple antenna nodes into K groups is determined, including:

[0157] S1301, listing each grouping method of the plurality of antenna nodes into K groups;

[0158] S1302, iterate through each of the grouping methods and calculate the total weight value for each;

[0159] S1303, Select the grouping method with the smallest total weight among each grouping method of the K groups as the determined grouping method.

[0160] In this implementation method, multiple antenna nodes are assigned to K groups for each grouping method. By traversing and optimizing, the total weight value of each grouping method is calculated. The grouping method with the smallest total weight value among the multiple grouping methods is selected as the required grouping method.

[0161] For example, when assigning m RRUs to k groups, the grouping methods can include at most k^m possibilities. Each grouping method can be iterated through sequentially, the total weight can be calculated for each method, and the grouping method with the lowest total weight can be selected as the required grouping method.

[0162] It should be noted that, in the embodiments of this application, the total weight of the grouping method is the sum of the cost weights of every two antenna nodes belonging to the same group in the same grouping method; that is, the sum of the cost weights calculated based on the cost weights of every two antenna nodes belonging to the same group in the same grouping method.

[0163] Using this implementation method, for example, when assigning m RRUs to k groups, for the same grouping method, the k groups divided from the m RRUs need to be categorized. Each category corresponds to one group, and each group includes at least one RRU. For each RRU included in each category, the cost weight between every two RRUs is obtained. Finally, the sum of the cost weights between every two RRUs obtained for each of the k groups is calculated to obtain the total weight. Based on this, the total weight is calculated for each grouping method, and the grouping method with the smallest total weight among the multiple grouping methods is selected as the required grouping method.

[0164] By adopting the above implementation method, by analyzing the cost weight between each pair of RRUs, the grouping method with the smallest total weight among multiple grouping methods is selected as the required grouping method. This ensures that adjacent RRUs are allocated to different groups as much as possible, and the total weight of the cost weight of all RRUs with grouping conflicts is reduced to the minimum. This ensures that subsequent resource allocation can achieve staggered allocation of resources according to the grouping method determined by this method.

[0165] In another embodiment of the antenna node grouping method described in this application, optionally, in step S130, as... Figure 4As shown, based on the cost weight of assigning every two antenna nodes to the same group, the grouping method for assigning the multiple antenna nodes into K groups is determined, including:

[0166] S131, based on the cost weights of every two antenna nodes in the plurality of antenna nodes assigned to the same group, for each antenna node, calculate the sum of each of the cost weights of the other antenna nodes assigned to the same group, to obtain the total cost for each antenna node.

[0167] S132, Sort the plurality of antenna nodes according to the total cost;

[0168] S133, Based on the sorted multiple antenna nodes, sequentially set the group to which each antenna node belongs in the sorted multiple antenna nodes to obtain the set grouping method;

[0169] S134, sequentially determine the total weight value corresponding to each of the multiple set grouping methods until the set grouping method with the smallest total weight value is obtained; the total weight value is the sum of each cost weight value calculated according to the cost weight value of each pair of antenna nodes belonging to the same group in each set grouping method.

[0170] S135, determine the grouping method with the minimum total weight as the required grouping method.

[0171] Optionally, in step S131, cost weight statistics are performed sequentially for each antenna node. For each antenna node, the sum of the cost weights assigned to the same group as each other antenna node is calculated to obtain the total cost W. m .

[0172] For example, for the i-th antenna node RRU1, calculate the RRU values ​​with each other antenna node. j The total cost W is obtained by summing the cost weights assigned to each group. m Specifically:

[0173]

[0174] Using this implementation method, the total cost W of each antenna node is calculated. m It can reflect the degree of overlap and coverage between each corresponding antenna node and the surrounding antenna nodes.

[0175] Optionally, the method described in this application calculates the total number of samples N for each antenna node among all antenna nodes. m This is to reflect the service concentration situation under each corresponding antenna node.

[0176] For example, for the i-th antenna node RRU i For each antenna node, calculate the RRU with each other antenna node separately. j The number of samples between them, and the statistics of each antenna node RRU. j The total number of samples N is obtained by summing the sample sizes between each pair. m Specifically:

[0177]

[0178] In this embodiment of the application, optionally, in step S132, the plurality of antenna nodes are sorted according to the total cost calculated for each of the plurality of antenna nodes, including:

[0179] Based on the total cost calculated for each of the multiple antenna nodes, the antenna node with the highest total cost is selected, written into the sorting queue, and used as the currently written antenna node.

[0180] Antenna nodes that are associated with the currently written antenna node are sequentially written into the sorting queue until every antenna node is written into the sorting queue, thus completing the sorting of the multiple antenna nodes.

[0181] Optionally, antenna nodes that are associated with the currently written antenna node are written sequentially into the sorting queue, including:

[0182] When there is only one antenna node with an association relationship, the antenna node with the association relationship is written into the sorting queue, and the written antenna node is used as the currently written antenna node, and the next antenna node to be written into the sorting queue is further determined.

[0183] When there are at least two antenna nodes with a relationship, the first antenna node with a relationship with the currently written antenna node will be written into the sorting queue and used as the currently written antenna node.

[0184] The first antenna node is the antenna node with the largest cost weight among at least two antenna nodes that are associated with each other, and the antenna node that is currently being written.

[0185] Optionally, the method further includes:

[0186] When there are at least two first antenna nodes, select the first antenna node with the smallest total cost among the at least two first antenna nodes, write it into the sorting queue, and use it as the antenna node to be written.

[0187] Optionally, the antenna node grouping method further includes:

[0188] When the number of first antenna nodes is at least two, and the number of first antenna nodes with the smallest total cost among the at least two first antenna nodes is also at least two, then the number of samples used to obtain the isolation evaluation value by the at least two first antenna nodes with the smallest total cost is compared.

[0189] Write the first antenna node with the lowest sample count among at least two first antenna nodes into the sorting queue and use it as the currently written antenna node.

[0190] For example, step S132 involves sorting the multiple antenna nodes according to the total cost calculated for each antenna node, specifically including:

[0191] 1) Calculate the total cost W for each RRU separately. m Choose the total cost W m The highest-ranking RRU is written into the sorting queue as the first node and is then used as the currently written RRU.

[0192] 2) Select an RRU that is associated with the currently written RRU and write it into the sorting queue, and use it as the currently written RRU; 3) Repeat step 2) above, sequentially select an RRU that is associated with each currently written RRU and write it into the sorting queue, until each RRU is written into the sorting queue, and complete the sorting of multiple RRUs.

[0193] Optionally, steps 2) and 3) above, which involve writing RRUs associated with the currently written RRU into the sorting queue, include:

[0194] When there is only one associated RRU, write the associated RRU into the sorting queue, and use the written RRU as the currently written RRU, and further determine the next RRU to be written into the sorting queue.

[0195] When there are at least two RRUs with a relationship, the first RRU that is associated with the currently written RRU is written into the sorting queue and used as the currently written RRU.

[0196] The first RRU is the RRU with the largest cost weight among at least two RRUs that are related to each other, and the RRU that is currently being written to.

[0197] Specifically, the currently written RRU is set as the i-th RRU, which is also called the RRU. i In relation to RRU i Among multiple RRUs with related relationships, the cost weight W i,j Largest RRU jIt is written into the sorting queue as the first RRU.

[0198] Optionally, when at least two first RRUs are at their maximum values, that is, when the cost weight W corresponding to at least two first RRUs is... i,j When the values ​​are maximum and equal, the total cost W corresponding to at least two first RRUs is... m Sort the results from lowest to highest and select the corresponding total cost W. m The smallest first RRU is written into the sorted queue; optionally, in the total cost W m The minimum number of first RRUs is at least two, which means the total cost W of at least two first RRUs. m When the values ​​are minimum and equal, then the total number of samples N used to obtain the isolation evaluation value is determined for at least the two first RRUs with the largest total cost. m Sort by N from lowest to highest. m The ascending order will write at least two first RRUs into the sorting queue.

[0199] In this embodiment of the application, optionally, the total number of samples N is compared. m This can reflect whether the services under the current RRU are centralized.

[0200] In this embodiment of the application, in step S133, based on the sorted plurality of antenna nodes, the group to which each of the plurality of antenna nodes belongs is sequentially set to obtain the group setting method, including:

[0201] Starting from the first antenna node of the sorted multiple antenna nodes, each antenna node in the sorted multiple antenna nodes is sequentially taken as the Nth antenna node. The group to which the Nth antenna node belongs is selected. Among the selected groups, the total cost corresponding to the Nth antenna node is the smallest sum of the total costs corresponding to the N-1 antenna nodes before the Nth antenna node.

[0202] Wherein, N is an integer greater than 1, and the Nth antenna node is one of the sorted antenna nodes.

[0203] In this embodiment of the application, optionally, through the above implementation method, the grouping method of multiple antenna nodes into K groups is determined by iterative optimization, with the aim of minimizing the total cost weight of the current grouping state.

[0204] Specifically, the process of sequentially assigning a group to each antenna node based on the sorted multiple antenna nodes to obtain the grouping method can include:

[0205] 1) Calculate the total weight of multiple antenna nodes in the initial grouping state (belonging to one of the grouping settings), that is, the total weight W of RRU pairs with the same grouping. Sum_ALL The total weight is the sum of the cost weights of every two RRUs belonging to the same group in each grouping configuration.

[0206] 2) Starting from the first RRU in the sorted queue, taking the allocation of two groups as an example, each RRU attempts to allocate to group 1 and group 2 respectively, and calculates the total weight W from the beginning of the queue to the current RRU. Sum_ALL Select the group with the lower total weight and assign it to the current RRU. i ;

[0207] 3) Repeat the above process of traversing all RRUs in the queue. RRUs that have already been grouped will not be changed to new groups; only the current RRU will be updated.

[0208] 4) After traversing all RRUs, recalculate the total weight W in the current state. Sum_ALL ;

[0209] 5) The total weight W under the current grouping method is... Sum_ALL The total weight W determined by the previous iteration result Sum_ALL The comparison is performed. If the total weight decreases, the result of the current grouping method is adopted; otherwise, the result of the previous iteration grouping is adopted, and the iteration is terminated.

[0210] 6) Repeat steps 2) to 5) above until the determined grouping method is achieved. Sum_ALL The grouping method will not be lowered further; the last determined grouping method will be set as the final grouping method.

[0211] By employing the antenna node grouping method described in the embodiments of this application, based on the above implementation process, resources among RRUs in a distributed system can be automatically allocated to optimize network configuration and improve network performance.

[0212] Optionally, the antenna node grouping method described in this application embodiment further includes reallocating the grouping of multiple antenna nodes into K groups when at least one of the following conditions is detected:

[0213] The number of multiple antenna nodes changes;

[0214] The positions of multiple antenna nodes change;

[0215] The isolation evaluation value between every two antenna nodes in the plurality of antenna nodes is determined periodically, and the total weight value corresponding to the current grouping method is calculated. The total weight value calculated in this time is higher than the total weight value calculated in the previous time. The total weight value is the sum of the cost weight values ​​calculated in the current grouping method based on the cost weight value of every two antenna nodes belonging to the same group.

[0216] The uplink and downlink antenna node affiliation is determined for all users. The number of conflicting antenna nodes belonging to the same user is greater than a preset value.

[0217] Using the above implementation method, when the network deployment or user distribution changes, periodic maintenance of RRU node groups can be initiated, and the triggering condition for periodic maintenance is at least one of the above conditions.

[0218] Optionally, the periodic maintenance of RRU node groups and the reallocation of resources can be scheduled during periods of low traffic, such as nighttime, to ensure the continuity of user services.

[0219] The following example illustrates the grouping method of assigning multiple antenna nodes into K groups in the antenna node grouping method described in the embodiments of this application.

[0220] See Figure 5 As shown, the number of antenna nodes is set to 8, namely RRU1, RRU2, RRU3, RRU4, RRU5, RRU6, RRU7 and RRU8. Among these 8 RRUs, the cost weight between two horizontally and vertically adjacent RRUs is set to 10, and the cost weight between two diagonally adjacent RRUs is set to 4.

[0221] Furthermore, taking the division of 8 RRUs (RRU1 to RRU8) into 2 groups as an example, the initial grouping method is as follows: Figure 6 As shown, in the initial grouping, RRU1, RRU3, RRU5 and RRU7 belong to group 1, and RRU2, RRU4, RRU6 and RRU8 belong to group 2.

[0222] Using the antenna node grouping method described in the embodiments of this application, the cost weight between each pair of RRUs can be represented by the following Table 1:

[0223] Table 1

[0224] RRU1 RRU2 RRU3 RRU4 RRU5 RRU6 RRU7 RRU8 RRU1 0 10 0 0 10 4 0 0 RRU2 10 0 10 0 4 10 4 0 RRU3 0 10 0 10 0 4 10 4 RRU4 0 0 10 0 0 0 4 10 RRU5 10 4 0 0 0 10 0 0 RRU6 4 10 4 0 10 0 10 0 RRU7 0 4 10 4 0 10 0 10 RRU8 0 0 4 10 0 0 10 0

[0225] Based on the cost weights between each pair of RRUs, an iterative optimization method is used to determine how to group these RRUs into two groups, specifically as follows:

[0226] The cost weights are calculated sequentially for each RRU. For each antenna node, the sum of the cost weights of each antenna node assigned to the same group as the other antenna nodes is calculated to obtain the total cost W. m Specifically, the total cost W for each RRU is determined. m It can be represented by Table 2 as follows:

[0227] Table 2

[0228] RRU1 RRU2 RRU3 RRU4 RRU5 RRU6 RRU7 RRU8 24 38 38 24 24 38 38 24

[0229] The total cost W is calculated for each RRU. m The multiple RRUs are sorted, and the specific sorting method is as follows:

[0230] Choose the total cost W m The highest-ranking RRU is selected as the first node and written into the queue; in this embodiment, W is selected. m In this embodiment of the application, RRU2 can be selected as the first node among the highest-ranking RRUs.

[0231] The RRUs associated with RRUs are selected and written into the sorting queue. In this embodiment, the RRUs associated with RRU2 include RRU1, RRU3, RRU5, RRU6, and RRU7. Since there are multiple associated RRUs, the RRU with the highest cost weight among them is selected and written into the sorting queue. In this embodiment, RRU2 has the highest cost weight among RRU1, RRU3, and RRU6. Based on this, since there are at least two RRUs with the highest cost value, the total cost W corresponding to each is further calculated. m The components are sorted from low to high and written into the sorting queue in sequence. In this embodiment, RRU1, RRU3 and RRU6 are selected and written into the sorting queue in sequence.

[0232] Furthermore, RRU6 is selected as the RRU currently being written to, and RRUs associated with RRU6 are selected and written to the sorting queue in sequence. The specific method is the same as the steps described above, and will not be described again here.

[0233] Based on the above implementation method, the sorting method for the 8 RRUs can be determined as follows:

[0234] RRU2, RRU1, RRU3, RRU6, RRU5, RRU4, RRU7, RRU8.

[0235] according to Figure 5 Based on Table 1, the sum of the cost weights of every two RRUs belonging to the same group under the initial grouping state can be calculated, which is the total weight W. Sum_ALL It is 80.

[0236] In addition, based on the sorting method of the 8 RRUs determined above, the group to which each antenna node belongs is set in sequence to obtain the group setting method. The specific method is as follows: starting from the first antenna node of the sorted multiple antenna nodes, each antenna node is taken as the Nth antenna node in sequence, and the group to which the Nth antenna node belongs is selected. Among them, when the selected group belongs to the Nth antenna node, the sum of the total cost corresponding to the Nth antenna node and the total cost corresponding to the N-1 antenna nodes before the Nth antenna node is the smallest.

[0237] Furthermore, the total weight value corresponding to the determined grouping method is compared with the total weight value W in the initial grouping state. Sum_ALL If the total weight value corresponding to the set grouping method decreases compared to the total weight value in the initial grouping state, then the determined set grouping method is set as the current grouping method, and the above process is repeated to determine the set grouping method again. The total weight value comparison process is repeated until a grouping method that no longer decreases is obtained. If the total weight value corresponding to the set grouping method increases compared to the total weight value in the initial grouping state, then the initial grouping method is still set as the current grouping method, and the above process is repeated to determine the set grouping method again. The total weight value comparison process is repeated until a grouping method that no longer decreases is obtained.

[0238] In this embodiment of the application, based on the above iterative process, the grouping method with the minimum total weight is the required grouping method. Optionally, as follows: Figure 7 The grouping method shown can be:

[0239] RRU2, RRU4, RRU5 and RRU7 belong to group 1, and RRU1, RRU3, RRU6 and RRU8 belong to group 2.

[0240] The antenna node grouping method described in this application determines the cost weight for allocating each pair of antenna nodes to the same group based on the isolation evaluation value between each pair of antenna nodes. Using the determined cost weight, the grouping method of multiple antenna nodes is determined through optimization, so as to realize the automatic reallocation of antenna nodes and the automatic allocation of resources among RRUs in the distributed system, thereby optimizing network configuration and improving network performance.

[0241] like Figure 8 As shown, this application embodiment also provides a network device, including a processor 800, a transceiver 810, a memory 820, and a program stored in the memory 820 and executable on the processor 800; wherein the transceiver 810 is connected to the processor 800 and the memory 820 via a bus interface, and the processor 800 is used to read the program stored in the memory and execute any step in the following process:

[0242] Determine the isolation evaluation value between every two antenna nodes in a multi-antenna node system;

[0243] Based on the isolation evaluation value between every two antenna nodes in the plurality of antenna nodes, determine the cost weight for allocating every two antenna nodes to the same group in the plurality of antenna nodes;

[0244] Based on the cost weight of assigning each pair of antenna nodes to the same group, the grouping method of the multiple antenna nodes into K groups is determined; where K is an integer greater than or equal to 2.

[0245] Optionally, in the network device, the processor 800 determines an isolation evaluation value between every two antenna nodes in a plurality of antenna nodes, including:

[0246] Based on the target parameter measurements of each of the multiple antenna nodes measured by the user, determine the isolation evaluation value between every two antenna nodes; or

[0247] Based on the positional distance between each pair of antenna nodes, an isolation evaluation value is determined for each pair of antenna nodes.

[0248] Optionally, in the network device, the processor 800 is further configured to: reallocate the grouping of the plurality of antenna nodes into K groups when at least one of the following conditions is detected:

[0249] The number of the plurality of antenna nodes changes;

[0250] The positional changes of the plurality of antenna nodes;

[0251] The isolation evaluation value between every two antenna nodes in the plurality of antenna nodes is determined periodically, and the total weight value corresponding to the current grouping method is calculated. The total weight value calculated in this time is higher than the total weight value calculated in the previous time. The total weight value is the sum of the cost weight values ​​calculated in the current grouping method based on the cost weight value of every two antenna nodes belonging to the same group.

[0252] The uplink and downlink antenna node affiliation is determined for all users. The number of conflicting antenna nodes belonging to the same user is greater than a preset value.

[0253] Optionally, in the network device, the processor 800 determines the grouping method of the plurality of antenna nodes into K groups based on the cost weight of allocating every two antenna nodes to the same group, including:

[0254] The determined grouping method has the smallest total weight compared to other grouping methods; wherein, the total weight is the sum of all cost weights calculated based on the cost weight of each pair of antenna nodes belonging to the same group in the same grouping method.

[0255] Optionally, in the network device, the processor 800 determines the grouping method of the plurality of antenna nodes into K groups based on the cost weight of allocating every two antenna nodes to the same group, including:

[0256] List each of the K groups of the multiple antenna nodes;

[0257] For each grouping method, calculate the total weight value corresponding to each grouping method.

[0258] The grouping method with the smallest total weight among each of the K groups is selected as the determined grouping method.

[0259] Optionally, in the network device, the processor 800 determines the grouping method of the plurality of antenna nodes into K groups based on the cost weight of allocating every two antenna nodes to the same group, including:

[0260] Based on the cost weights of every two antenna nodes assigned to the same group among the plurality of antenna nodes, for each antenna node, the sum of each of the cost weights assigned to the same group with each other antenna node is calculated to obtain the total cost for each antenna node.

[0261] The plurality of antenna nodes are sorted according to the total cost;

[0262] Based on the sorted multiple antenna nodes, the group to which each antenna node belongs is sequentially set to obtain the group setting method;

[0263] The total weight value corresponding to each of the multiple set grouping methods is determined sequentially until the set grouping method with the smallest total weight value is obtained; the total weight value is the sum of the cost weight values ​​calculated for each set grouping method based on the cost weight value of each pair of antenna nodes belonging to the same group;

[0264] The grouping method with the minimum total weight is determined as the required grouping method.

[0265] Optionally, in the network device, the processor 800 sorts the plurality of antenna nodes according to the total cost calculated for each antenna node, including:

[0266] Based on the total cost calculated for each of the multiple antenna nodes, the antenna node with the highest total cost is selected, written into the sorting queue, and used as the currently written antenna node.

[0267] Antenna nodes that are associated with the currently written antenna node are sequentially written into the sorting queue until every antenna node is written into the sorting queue, thus completing the sorting of the multiple antenna nodes.

[0268] Optionally, in the network device, the processor 800 sequentially writes antenna nodes associated with the currently written antenna node into a sorting queue, including:

[0269] When there is only one antenna node with an association relationship, the antenna node with the association relationship is written into the sorting queue, and the written antenna node is used as the currently written antenna node, and the next antenna node to be written into the sorting queue is further determined.

[0270] When there are at least two antenna nodes with a relationship, the first antenna node with a relationship with the currently written antenna node will be written into the sorting queue and used as the currently written antenna node.

[0271] The first antenna node is the antenna node with the largest cost weight among at least two antenna nodes that are associated with each other, and the antenna node that is currently being written.

[0272] Optionally, in the network device, the processor 800 is further configured to:

[0273] When there are at least two first antenna nodes, select the first antenna node with the smallest total cost among the at least two first antenna nodes, write it into the sorting queue, and use it as the antenna node to be written.

[0274] Optionally, in the network device, the processor 800 is further configured to:

[0275] When the number of the first antenna nodes is at least two, and the number of the first antenna nodes with the smallest total cost among the at least two first antenna nodes is also at least two, then the total number of samples used to obtain the isolation evaluation value by the at least two first antenna nodes with the smallest total cost is compared.

[0276] Write the first antenna node with the lowest total number of samples among at least two first antenna nodes into the sorting queue and use it as the currently written antenna node.

[0277] Optionally, in the network device, the processor 800 sequentially sets the group to which each of the sorted antenna nodes belongs, thereby obtaining a set grouping method, including:

[0278] Starting from the first antenna node of the sorted multiple antenna nodes, each antenna node in the sorted multiple antenna nodes is sequentially taken as the Nth antenna node. The group to which the Nth antenna node belongs is selected. Among the selected groups, the total cost corresponding to the Nth antenna node is minimized by the sum of the total costs corresponding to the N-1 antenna nodes before the Nth antenna node.

[0279] Wherein, N is an integer greater than 1, and the Nth antenna node is one of the sorted antenna nodes.

[0280] Optionally, in the network device, the processor 800 determines the cost weight for allocating each pair of antenna nodes to the same group based on the isolation evaluation value between each pair of antenna nodes, including:

[0281] Using the pre-defined correspondence between isolation evaluation values ​​and cost weights, the cost weight for each pair of antenna nodes assigned to the same group is determined based on the isolation evaluation values ​​between each pair of antenna nodes.

[0282] In the aforementioned correspondence, the isolation evaluation values ​​for different range intervals correspond to different cost weights.

[0283] Optionally, in the network device, the processor 800 determines an isolation evaluation value between every two antenna nodes based on the target parameter measurement values ​​of each of the multiple antenna nodes measured by the user, including:

[0284] Based on the target parameter measurement values ​​measured by the user for each antenna node within a first preset time period, an isolation sample is determined for every two antenna nodes among the plurality of antenna nodes; wherein, the isolation sample is equal to the absolute value of the difference between the target parameter measurement values ​​measured by the corresponding two antenna nodes within the first preset time period;

[0285] Calculate the average value of multiple isolation degree samples of every two antenna nodes within a second preset time period, and determine the average value as the isolation degree evaluation value between the corresponding two antenna nodes; wherein, the second preset time period is longer than the first preset time period.

[0286] In this embodiment, the transceiver 810 is used to receive and send data under the control of the processor 800.

[0287] Among them, Figure 8 In this context, the bus architecture can include any number of interconnected buses and bridges, specifically linking various circuits together, represented by one or more processors (processor 800) and memory (memory 820). The bus architecture can also link various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. The bus interface provides an interface. The transceiver 810 can be multiple elements, including transmitters and receivers, providing a unit for communicating with various other devices over transmission media, including wireless channels, wired channels, optical fibers, etc. The processor 800 is responsible for managing the bus architecture and general processing, and the memory 800 can store data used by the processor 800 during operation.

[0288] The processor 800 can be a central processing unit (CPU), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a complex programmable logic device (CPLD). The processor can also adopt a multi-core architecture.

[0289] It should be noted that the network device provided in this application embodiment can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. Here, the parts that are the same as those in the method embodiment and the beneficial effects will not be described in detail.

[0290] Another embodiment of this application also provides an antenna node grouping device, such as... Figure 9 As shown, the antenna node grouping device 900 includes:

[0291] The isolation evaluation unit 910 is used to determine the isolation evaluation value between every two antenna nodes in a plurality of antenna nodes;

[0292] The cost evaluation unit 920 is used to determine the cost weight of each pair of antenna nodes assigned to the same group based on the isolation evaluation value between each pair of antenna nodes in the plurality of antenna nodes.

[0293] Grouping unit 930 is used to determine the grouping method of the multiple antenna nodes into K groups based on the cost weight of each pair of antenna nodes being assigned to the same group; wherein K is an integer greater than or equal to 2.

[0294] Optionally, in the antenna node grouping device, the isolation evaluation unit 910 determines the isolation evaluation value between every two antenna nodes in the plurality of antenna nodes, including:

[0295] Based on the target parameter measurements of each of the plurality of antenna nodes measured by the user, an isolation evaluation value is determined between every two antenna nodes; or

[0296] Based on the positional distance between each pair of antenna nodes, an isolation evaluation value is determined for each pair of antenna nodes.

[0297] Optionally, in the antenna node grouping device, the grouping unit 930 is further configured to: reallocate the grouping of the plurality of antenna nodes into K groups when at least one of the following conditions is detected:

[0298] The number of the plurality of antenna nodes changes;

[0299] The positional changes of the plurality of antenna nodes;

[0300] The isolation evaluation value between every two antenna nodes in the plurality of antenna nodes is determined periodically, and the total weight value corresponding to the current grouping method is calculated. The total weight value calculated in this time is higher than the total weight value calculated in the previous time. The total weight value is the sum of the cost weight values ​​calculated in the current grouping method based on the cost weight value of every two antenna nodes belonging to the same group.

[0301] The uplink and downlink antenna node affiliation is determined for all users. The number of conflicting antenna nodes belonging to the same user is greater than a preset value.

[0302] Optionally, in the antenna node grouping device, the grouping unit 930 determines the grouping method of the plurality of antenna nodes into K groups based on the cost weight of assigning every two antenna nodes to the same group, including:

[0303] The determined grouping method has the smallest total weight compared to other grouping methods; wherein, the total weight is the sum of all cost weights calculated based on the cost weight of each pair of antenna nodes belonging to the same group in the same grouping method.

[0304] Optionally, in the antenna node grouping device, the grouping unit 930 determines the grouping method of the plurality of antenna nodes into K groups based on the cost weight of assigning every two antenna nodes to the same group, including:

[0305] List each of the K groups of the multiple antenna nodes;

[0306] For each grouping method, calculate the total weight value corresponding to each grouping method.

[0307] The grouping method with the smallest total weight among each of the K groups is selected as the determined grouping method.

[0308] Optionally, in the antenna node grouping device, the grouping unit 930 determines the grouping method of the plurality of antenna nodes into K groups based on the cost weight of assigning every two antenna nodes to the same group, including:

[0309] Based on the cost weights of every two antenna nodes assigned to the same group among the plurality of antenna nodes, for each antenna node, the sum of each of the cost weights assigned to the same group with each other antenna node is calculated to obtain the total cost for each antenna node.

[0310] The multiple antenna nodes are sorted according to the total cost calculated for each antenna node.

[0311] Based on the sorted multiple antenna nodes, the group to which each antenna node belongs is sequentially set to obtain the group setting method;

[0312] The total weight value corresponding to each of the multiple set grouping methods is determined sequentially until the set grouping method with the smallest total weight value is obtained; the total weight value is the sum of the cost weight values ​​calculated for each set grouping method based on the cost weight value of each pair of antenna nodes belonging to the same group;

[0313] The grouping method with the minimum total weight is determined as the grouping method.

[0314] Optionally, in the antenna node grouping device, the grouping unit 930 sorts the plurality of antenna nodes according to the total cost calculated for each antenna node, including:

[0315] Based on the total cost calculated for each of the multiple antenna nodes, the antenna node with the highest total cost is selected, written into the sorting queue, and used as the currently written antenna node.

[0316] Antenna nodes that are associated with the currently written antenna node are sequentially written into the sorting queue until every antenna node is written into the sorting queue, thus completing the sorting of the multiple antenna nodes.

[0317] Optionally, in the antenna node grouping device, the grouping unit 930 sequentially writes antenna nodes associated with the currently written antenna node into a sorting queue, including:

[0318] When there is only one antenna node with an association relationship, the antenna node with the association relationship is written into the sorting queue, and the written antenna node is used as the currently written antenna node, and the next antenna node to be written into the sorting queue is further determined.

[0319] When there are at least two antenna nodes with a relationship, the first antenna node with a relationship with the currently written antenna node will be written into the sorting queue and used as the currently written antenna node.

[0320] The first antenna node is the antenna node with the largest cost weight among at least two antenna nodes that are associated with each other, and the antenna node that is currently being written.

[0321] Optionally, in the antenna node grouping device, the grouping unit 930 is further configured to:

[0322] When there are at least two first antenna nodes, select the first antenna node with the smallest total cost among the at least two first antenna nodes, write it into the sorting queue, and use it as the antenna node to be written.

[0323] Optionally, in the antenna node grouping device, the grouping unit 930 is further configured to:

[0324] When the number of the first antenna nodes is at least two, and the number of the first antenna nodes with the smallest total cost among the at least two first antenna nodes is also at least two, then the total number of samples used to obtain the isolation evaluation value by the at least two first antenna nodes with the smallest total cost is compared.

[0325] Write the first antenna node with the lowest total number of samples among at least two first antenna nodes into the sorting queue and use it as the currently written antenna node.

[0326] Optionally, in the antenna node grouping device, the grouping unit 930 sequentially sets the group to which each of the sorted antenna nodes belongs, thereby obtaining a set grouping method, including:

[0327] Starting from the first antenna node of the sorted multiple antenna nodes, each antenna node in the sorted multiple antenna nodes is sequentially taken as the Nth antenna node. The group to which the Nth antenna node belongs is selected. Among the selected groups, the total cost corresponding to the Nth antenna node is the smallest sum of the total costs corresponding to the N-1 antenna nodes before the Nth antenna node.

[0328] Wherein, N is an integer greater than 1, and the Nth antenna node is one of the sorted antenna nodes.

[0329] Optionally, in the antenna node grouping device, the cost evaluation unit 920 determines the cost weight for each pair of antenna nodes to be assigned to the same group based on the isolation evaluation value between each pair of antenna nodes, including:

[0330] Using the pre-defined correspondence between isolation evaluation values ​​and cost weights, the cost weight for each pair of antenna nodes to be assigned to the same group is determined based on the isolation evaluation values ​​between each pair of antenna nodes.

[0331] In the aforementioned correspondence, the isolation evaluation values ​​for different range intervals correspond to different cost weights.

[0332] Optionally, in the antenna node grouping device, the isolation evaluation unit 910 determines the isolation evaluation value between every two antenna nodes based on the target parameter measurement values ​​of each of the plurality of antenna nodes measured by the user, including:

[0333] Based on the target parameter measurement values ​​measured by the user for each of the plurality of antenna nodes within a first preset time period, an isolation sample is determined for every two antenna nodes; wherein, the isolation sample is equal to the absolute value of the difference between the target parameter measurement values ​​measured by the corresponding two antenna nodes within the first preset time period.

[0334] Calculate the average value of multiple isolation degree samples of every two antenna nodes within a second preset time period, and determine the average value as the isolation degree evaluation value between the corresponding two antenna nodes; wherein, the second preset time period is longer than the first preset time period.

[0335] It should be noted that in the embodiments of this application, the method and apparatus are based on the same application concept. Since the methods and apparatus solve problems in similar ways, the implementation of the apparatus and methods can refer to each other, and the repeated parts will not be described again.

[0336] This application also provides a processor-readable storage medium storing a computer program thereon, wherein the computer program, when executed by a processor, implements the steps of an antenna node grouping method applied to a network device.

[0337] The processor-readable storage medium can be any available medium or data storage device that the processor can access, including but not limited to magnetic memory (e.g., floppy disk, hard disk, magnetic tape, magneto-optical disk (MO)), optical memory (e.g., CD, DVD, BD, HVD), and semiconductor memory (e.g., ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state drive (SSD)).

[0338] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products, etc. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage and optical storage) containing computer-usable program code.

[0339] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer-executable instructions. These computer-executable instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0340] These processor-executable instructions may also be stored in a processor-readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the processor-readable memory produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0341] These processors can execute instructions that can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable device for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0342] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the scope of protection of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A method of grouping antenna nodes, c h a r a c t e r i s e d by, The method comprises: determining an isolation evaluation value between each two of the plurality of antenna nodes; determining a cost weight value of each two of the plurality of antenna nodes being allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes; determining a grouping mode of the plurality of antenna nodes being allocated into K groups according to the cost weight value of each two of the plurality of antenna nodes being allocated to the same group; wherein the K is an integer greater than or equal to 2; the determining the grouping mode of the plurality of antenna nodes being allocated into K groups according to the cost weight value of each two of the plurality of antenna nodes being allocated to the same group comprises: calculating a total cost for each antenna node according to the cost weight value of each two of the plurality of antenna nodes being allocated to the same group respectively; sorting the plurality of antenna nodes according to the total cost; setting a group to which each antenna node in the sorted plurality of antenna nodes belongs in sequence according to the sorted plurality of antenna nodes, and obtaining a set grouping mode; determining a total weight value corresponding to each set grouping mode in the plurality of set grouping modes in sequence until a set grouping mode with the minimum total weight value is obtained; the total weight value is a sum of the cost weight values calculated according to the cost weight value of each two of the plurality of antenna nodes belonging to the same group in each set grouping mode; determining the set grouping mode with the minimum total weight value as the determined grouping mode.

2. The antenna node grouping method of claim 1, wherein, the determining the isolation evaluation value between each two of the plurality of antenna nodes comprises: determining the isolation evaluation value between each two of the plurality of antenna nodes according to a target parameter measurement value of each antenna node in the plurality of antenna nodes measured by a user; or determining the isolation evaluation value between each two of the plurality of antenna nodes according to a position distance between each two of the plurality of antenna nodes.

3. The method of claim 1, wherein, The method further comprises: when at least one of the following conditions is monitored, reallocating the grouping mode of the plurality of antenna nodes being allocated into K groups: the number of the plurality of antenna nodes changes; the position of the plurality of antenna nodes changes; periodically determining the isolation evaluation value between each two of the plurality of antenna nodes, and calculating a total weight value corresponding to the current grouping mode, when the total weight value calculated this time is greater than the total weight value calculated last time; wherein the total weight value is a sum of the cost weight values calculated according to the cost weight value of each two of the plurality of antenna nodes belonging to the same group in the current grouping mode; the number of conflicts between the antenna nodes belonging to the same user determined by the uplink and downlink antenna node attribution judgment of all users is greater than a preset value.

4. The method of claim 1, wherein, the sorting the plurality of antenna nodes according to the total cost calculated for each antenna node in the plurality of antenna nodes comprises: selecting, according to the total cost respectively calculated for each of the plurality of antenna nodes, an antenna node with the highest total cost, writing the antenna node into the sorting queue, and taking the antenna node as a currently written antenna node; sequentially writing antenna nodes having a correlation with the currently written antenna node into the sorting queue until each of the antenna nodes is written into the sorting queue, and completing sorting of the plurality of antenna nodes.

5. The method of claim 4, wherein, sequentially writing antenna nodes having a correlation with the currently written antenna node into the sorting queue, including: when the antenna nodes having the correlation are one, writing the antenna nodes having the correlation into the sorting queue, taking the written antenna node as the currently written antenna node, and further determining a next antenna node to be written into the sorting queue; when the antenna nodes having the correlation are at least two, writing a first antenna node having the correlation with the currently written antenna node into the sorting queue, and taking the first antenna node as the currently written antenna node; wherein the first antenna node is an antenna node with the maximum cost weight between the currently written antenna node and the at least two antenna nodes having the correlation.

6. The method of claim 5, wherein, The method further includes: when the number of the first antenna nodes is at least two, selecting a first antenna node with the minimum total cost from the at least two first antenna nodes, writing the first antenna node into the sorting queue, and taking the first antenna node as the currently written antenna node.

7. The method of claim 6, wherein, The method further includes: when the number of the first antenna nodes is at least two, and the number of the first antenna nodes with the minimum total cost is also at least two, comparing total sample numbers of the at least two first antenna nodes used to obtain the isolation evaluation value; writing a first antenna node with the lowest total sample number from the at least two first antenna nodes into the sorting queue, and taking the first antenna node as the currently written antenna node.

8. The method of claim 1, wherein, The method further includes: selecting, according to the total cost respectively calculated for each of the plurality of antenna nodes, an antenna node with the highest total cost, writing the antenna node into the sorting queue, and taking the antenna node as a currently written antenna node; sequentially writing antenna nodes having a correlation with the currently written antenna node into the sorting queue until each of the antenna nodes is written into the sorting queue, and completing sorting of the plurality of antenna nodes.

9. The method of claim 1, wherein, sequentially writing antenna nodes having a correlation with the currently written antenna node into the sorting queue, including: when the antenna nodes having the correlation are one, writing the antenna nodes having the correlation into the sorting queue, taking the written antenna node as the currently written antenna node, and further determining a next antenna node to be written into the sorting queue; when the antenna nodes having the correlation are at least two, writing a first antenna node having the correlation with the currently written antenna node into the sorting queue, and taking the first antenna node as the currently written antenna node; wherein the first antenna node is an antenna node with the maximum cost weight between the currently written antenna node and the at least two antenna nodes having the correlation. The method further includes: when the number of the first antenna nodes is at least two, selecting a first antenna node with the minimum total cost from the at least two first antenna nodes, writing the first antenna node into the sorting queue, and taking the first antenna node as the currently written antenna node. The method further includes: when the number of the first antenna nodes is at least two, and the number of the first antenna nodes with the minimum total cost is also at least two, comparing total sample numbers of the at least two first antenna nodes used to obtain the isolation evaluation value; writing a first antenna node with the lowest total sample number from the at least two first antenna nodes into the sorting queue, and taking the first antenna node as the currently written antenna node. The method further includes: selecting, according to the total cost respectively calculated for each of the plurality of antenna nodes, an antenna node with the highest total cost, writing the antenna node into the sorting queue, and taking the antenna node as a currently written antenna node; sequentially writing antenna nodes having a correlation with the currently written antenna node into the sorting queue until each of the antenna nodes is written into the sorting queue, and completing sorting of the plurality of antenna nodes. sequentially writing antenna nodes having a correlation with the currently written antenna node into the sorting queue, including: when the antenna nodes having the correlation are one, writing the antenna nodes having the correlation into the sorting queue, taking the written antenna node as the currently written antenna node, and further determining a next antenna node to be written into the sorting queue; when the antenna nodes having the correlation are at least two, writing a first antenna node having the correlation with the currently written antenna node into the sorting queue, and taking the first antenna node as the currently written antenna node; wherein the first antenna node is an antenna node with the maximum cost weight between the currently written antenna node and the at least two antenna nodes having the correlation. The method further includes: when the number of the first antenna nodes is at least two, selecting a first antenna node with the minimum total cost from the at least two first antenna nodes, writing the first antenna node into the sorting queue, and taking the first antenna node as the currently written antenna node. The method further includes: when the number of the first antenna nodes is at least two, and the number of the first antenna nodes with the minimum total cost is also at least two, comparing total sample numbers of the at least two first antenna nodes used to obtain the isolation evaluation value; writing a first antenna node with the lowest total sample number from the at least two first antenna nodes into the sorting queue, and taking the first antenna node as the currently written antenna node. Correspondingly, in the correspondence, the isolation evaluation values of different range intervals correspond to different cost weight values.

10. The method of claim 2, wherein, The processor is configured to: determine an isolation evaluation value between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user; and determine a cost weight value of each two of the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes. The processor is configured to: determine an isolation sample between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user within a first preset time length; and determine an average value of a plurality of isolation samples between each two of the plurality of antenna nodes within a second preset time length, and determine the average value as an isolation evaluation value between the corresponding two of the plurality of antenna nodes. The processor is configured to: determine an isolation evaluation value between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user; and determine a cost weight value of each two of the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes.

11. A network device, comprising: The memory is configured to store a computer program. The transceiver is configured to transceive data under the control of the processor. The processor is configured to read the computer program in the memory and perform the following operations: determine an isolation evaluation value between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user; and determine a cost weight value of each two of the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes. The processor is configured to: determine an isolation evaluation value between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user; and determine a cost weight value of each two of the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes. The K is an integer greater than or equal to 2. The processor is configured to: determine an isolation evaluation value between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user; and determine a cost weight value of each two of the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes. The processor is configured to: determine an isolation evaluation value between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user; and determine a cost weight value of each two of the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes. The processor is configured to: determine an isolation evaluation value between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user; and determine a cost weight value of each two of the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes. The processor is configured to: determine an isolation evaluation value between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user; and determine a cost weight value of each two of the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes. The processor is configured to: determine an isolation evaluation value between each two of the plurality of antenna nodes according to the target parameter measurement value of each antenna node measured by the user; and determine a cost weight value of each two of the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two of the plurality of antenna nodes. ​ ​ 12. The network device of claim 11, wherein, ​ ​ Determine an isolation evaluation value between each two of the plurality of antenna nodes according to a location distance between each two of the plurality of antenna nodes.

13. The network device of claim 11, wherein, The processor is further configured to re-allocate a grouping manner of grouping the plurality of antenna nodes into K groups when at least one of the following conditions is monitored: The number of the plurality of antenna nodes changes; The location of the plurality of antenna nodes changes; Periodically determine an isolation evaluation value between each two of the plurality of antenna nodes, and calculate a total weight corresponding to the current grouping manner, when the total weight calculated this time is greater than the total weight calculated last time; wherein the total weight is a sum of each cost weight calculated according to a cost weight of each two of the antenna nodes belonging to the same group in the current grouping manner; The number of the antenna nodes belonging to the same user and determined to exist conflict is greater than a preset value.

14. The network device of claim 11, wherein, The processor sorts the plurality of antenna nodes according to the total cost calculated for each of the plurality of antenna nodes, including: Selecting an antenna node with the highest total cost according to the total cost calculated for each of the plurality of antenna nodes, writing the antenna node into a sorting queue, and taking the antenna node as a currently written antenna node; Writing antenna nodes having an association relationship with the currently written antenna node into the sorting queue in sequence until each of the antenna nodes is written into the sorting queue, and completing the sorting of the plurality of antenna nodes.

15. The network device of claim 14, wherein, The processor writes antenna nodes having an association relationship with the currently written antenna node into the sorting queue in sequence, including: When the antenna nodes having the association relationship are one, writing the antenna nodes having the association relationship into the sorting queue, and taking the written antenna node as the currently written antenna node, and further determining a next antenna node to be written into the sorting queue; When the antenna nodes having the association relationship are at least two, writing a first antenna node having the association relationship with the currently written antenna node into the sorting queue, and taking the first antenna node as the currently written antenna node; The first antenna node is an antenna node having the largest cost weight with the currently written antenna node among the at least two antenna nodes having the association relationship.

16. The network device of claim 15, wherein, The processor is further configured to: When the number of the first antenna nodes is at least two, selecting a first antenna node with the smallest corresponding total cost among the at least two first antenna nodes, writing the first antenna node into the sorting queue, and taking the first antenna node as the currently written antenna node.

17. The network device of claim 16, wherein, The processor is further configured to: When the number of the first antenna nodes is at least two, and the number of the first antenna nodes with the smallest corresponding total cost among the at least two first antenna nodes is also at least two, comparing total sample numbers obtained by the at least two first antenna nodes with the smallest corresponding total cost; Writing a first antenna node with the lowest total sample number among the at least two first antenna nodes into the sorting queue, and taking the first antenna node as the currently written antenna node.

18. The network device of claim 11, wherein, The processor sets a group to which each antenna node in the plurality of antenna nodes belongs in sequence according to the plurality of antenna nodes in sequence, to obtain a setting group mode, comprising: starting from a first antenna node in the plurality of antenna nodes in sequence, each antenna node in the plurality of antenna nodes in sequence is selected as an Nth antenna node, and a group to which the Nth antenna node belongs is selected, wherein, compared with other groups, a total cost corresponding to the Nth antenna node is the smallest when the selected group to which the Nth antenna node belongs is compared with other groups, and the total cost is the sum of total costs corresponding to N-1 antenna nodes before the Nth antenna node. Wherein, the N is an integer greater than 1, and the Nth antenna node is one of the plurality of antenna nodes in sequence.

19. The network device of claim 11, wherein, The processor determines a cost weight value of each two antenna nodes in the plurality of antenna nodes allocated to the same group according to an isolation evaluation value between each two antenna nodes in the plurality of antenna nodes, comprising: using a preset corresponding relationship between the isolation evaluation value and the cost weight value, the cost weight value of each two antenna nodes in the plurality of antenna nodes allocated to the same group is determined according to the isolation evaluation value between each two antenna nodes in the plurality of antenna nodes; Wherein, in the corresponding relationship, different range intervals of the isolation evaluation value correspond to different cost weight values.

20. The network device of claim 12, wherein, The processor determines an isolation evaluation value between each two antenna nodes in the plurality of antenna nodes according to a target parameter measurement value of each antenna node in the plurality of antenna nodes measured by a user, comprising: determining one isolation sample of each two antenna nodes in the plurality of antenna nodes according to target parameter measurement values respectively measured by the user within a first preset time length; wherein, the isolation sample is equal to the absolute value of the difference between the target parameter measurement values measured within the first preset time length by the corresponding two antenna nodes; calculating an average value of a plurality of isolation samples of each two antenna nodes in the plurality of antenna nodes within a second preset time length, and determining the average value as the isolation evaluation value between the corresponding two antenna nodes; wherein, the second preset time length is greater than the first preset time length.

21. An apparatus for grouping antenna nodes, the apparatus comprising: The device comprises: an isolation evaluation unit, configured to determine an isolation evaluation value between each two antenna nodes in the plurality of antenna nodes; a cost evaluation unit, configured to determine a cost weight value of each two antenna nodes in the plurality of antenna nodes allocated to the same group according to the isolation evaluation value between each two antenna nodes in the plurality of antenna nodes; a grouping unit, configured to determine a grouping mode of the plurality of antenna nodes allocated as K groups according to the cost weight value of each two antenna nodes in the plurality of antenna nodes allocated to the same group; wherein, the K is an integer greater than or equal to 2; the grouping unit determines the grouping mode of the plurality of antenna nodes allocated as K groups according to the cost weight value of each two antenna nodes in the plurality of antenna nodes allocated to the same group, comprising: According to the cost weight values of each two antenna nodes in the multiple antenna nodes being allocated to the same group, a total cost for each antenna node is calculated by summing up each cost weight value of other antenna nodes being allocated to the same group, respectively; According to the total cost calculated for each antenna node, the multiple antenna nodes are sorted; According to the sorted multiple antenna nodes, a group to which each antenna node belongs in the sorted multiple antenna nodes is sequentially set, and a set grouping mode is obtained; A total weight value corresponding to each set grouping mode in the multiple set grouping modes is sequentially determined until a set grouping mode with the minimum total weight value is obtained; the total weight value is a sum of each cost weight value calculated according to the cost weight value of each two antenna nodes belonging to the same group in each set grouping mode; The set grouping mode with the minimum total weight value is determined as a determined grouping mode.

22. A processor-readable storage medium, comprising: The processor readable storage medium stores a computer program for causing the processor to execute the antenna node grouping method according to any one of claims 1 to 10.

Images