CN-122028058-A - Centralized radio access network planning method and device

CN122028058ACN 122028058 ACN122028058 ACN 122028058ACN-122028058-A

Abstract

The application provides a method and a device for planning a centralized radio access network, wherein the method comprises the steps of taking base station network elements as vertexes, taking switching of users between the base station network elements as edges, establishing a weighted undirected graph, wherein vertex weights are traffic of the base station network elements, edge weights are switching request times of the users between the base station network elements, dividing the vertexes of the weighted undirected graph based on the edge weights to obtain a plurality of candidate division schemes, dividing the vertexes of the weighted undirected graph based on the candidate division schemes to obtain a plurality of groups, calculating vertex weight variances of all the groups, and determining the candidate division scheme corresponding to the minimum value in the vertex weight variances as the planning scheme of the centralized radio access network. The application improves the accuracy and efficiency of the planning of the centralized wireless access network.

Inventors

LI JUN
LIU YONGTAO
WANG FEI

Assignees

中国移动通信集团河南有限公司
中国移动通信集团有限公司

Dates

Publication Date: 20260512
Application Date: 20260129

Claims (9)

1. A method for planning a centralized radio access network, comprising: the method comprises the steps of taking base station network elements as vertexes, taking switching between the base station network elements as edges by users, and establishing a weighted undirected graph, wherein vertex weights are traffic of the base station network elements, and edge weights are switching request times of the users between the base station network elements; Dividing the vertexes of the weighted undirected graph based on the edge weights to obtain a plurality of candidate division schemes; Dividing the vertexes of the weighted undirected graph based on the candidate dividing scheme to obtain a plurality of groups, and calculating vertex weight variances of all the groups; and determining a candidate division scheme corresponding to the minimum value in the plurality of vertex weight variances as a planning scheme of the centralized wireless access network.
2. The method of claim 1, wherein partitioning vertices of the weighted undirected graph based on edge weights results in a plurality of candidate partitioning schemes, comprising: Step S1, determining a vertex as a group; s2, selecting a target vertex from any group, combining the group in which the target vertex is positioned with the group in which the adjacent vertex of the target vertex is positioned, and obtaining a plurality of combined groups; Step S3, determining that the total traffic of the combined packet does not exceed a preset threshold value and the module increment of the combined packet is the largest as the optimal combined packet; Step S4, determining a plurality of current groups with weight undirected graphs based on the optimal combined groups; s5, determining the sum of the modularity of all the current groups as a current Q value; Step S6, judging whether the current Q value is larger than the last Q value, if not, turning to step S2, otherwise, turning to step S7; And S7, determining the dividing mode of the current multiple groups as a candidate planning scheme.
3. The method of claim 2, wherein the step of calculating the module degree increment of the combined packet comprises: Calculating the modularity increment of the combined packets according to : Wherein, the Is the sum of the weights of the edges within the merged packet; Is the sum of the weights of the edges associated with the merged packet; Is the sum of the weights of the edges connected to the target vertex i within the merged group; is the sum of the weights of the connected edges to the target vertex i; is the sum of the weights of the sides of the weighted undirected graph.
4. The method of claim 2, wherein calculating a module degree sum of all current packets comprises: Calculating the module degree sum of all current groups according to the following ; Wherein, the For the number of packets to be counted, Is the sum of the weights of the edges within the packet, Is the sum of the weights of the edges associated with the packet, Is the sum of the weights of the sides of the weighted undirected graph.
5. The method of claim 1, wherein calculating vertex weight variances for all packets comprises: Computing packets Sum of weights of vertices of (2) ; Is the number of packets; Computing vertex weight variance for all groupings : 。
6. A centralized radio access network planning apparatus, comprising: The establishing unit is used for taking the base station network elements as vertexes and taking the switching of users between the base station network elements as edges to establish a weighted undirected graph, wherein the vertex weight is the traffic of the base station network elements and the edge weight is the switching request times of the users between the base station network elements; The optimizing unit is used for dividing the vertexes of the weighted undirected graph based on the edge weights to obtain a plurality of candidate dividing schemes; the computing unit is used for dividing the vertexes of the weighted undirected graph based on the candidate dividing scheme to obtain a plurality of groups, and computing vertex weight variances of all the groups; And the determining unit is used for determining the candidate division scheme corresponding to the minimum value in the plurality of vertex weight variances as a planning scheme of the centralized wireless access network.
7. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method according to any one of claims 1-5 when executing the computer program.
8. A computer readable storage medium storing computer instructions which, when executed by a processor, implement the method of any one of claims 1-5.
9. A computer program product comprising computer programs/instructions which, when executed by a processor, implement the method of any of claims 1-5.

Description

Centralized radio access network planning method and device Technical Field The present application relates to the field of wireless communications technologies, and in particular, to a method and an apparatus for planning a centralized radio access network. Background The existing C-RAN networking planning scheme is mainly used for performing unquantized experience judgment through factors such as physical distance between base stations, transmission route structure, on-site actual road network environment and the like. The method mainly comprises the following steps of non-quantitative empirical C-RAN networking planning of business compliance engineering, namely acquiring sites with good machine room conditions and convenient power supply and optical fiber arrangement as target machine rooms through investigation of an existing machine room, and uniformly fusing about 5-10 sites around the sites into the target machine rooms to form the C-RAN networking. The prior art mainly has the following defects: the current C-RAN networking takes engineering realization as a main part and gives consideration to service performance, and stations with better machine room conditions and convenient power supply and optical fiber arrangement are obtained as target machine rooms through investigation of the existing network machine rooms, and 5-10 surrounding stations are unified and fused into the target machine rooms to form a C-RAN networking cluster; The non-quantitative planning is that the C-RAN networking has no standard quantitative model, only takes engineering realization as constraint, such as the capacity of a playable cabinet of a C-RAN machine room, the capacity of an optical fiber, the capacity of a storage battery and the like as constraint, and qualitatively combines sites which can be accommodated in the periphery into the C-RAN networking cluster subjectively according to the principle of convenient transmission routing; The traditional method has lower efficiency, and the traditional C-RAN planning method has the defects that station-by-station investigation is needed, the experience of workers is depended, and manpower and material resources are very consumed due to the lack of a unified model. Disclosure of Invention In view of the above, the present application provides a method and apparatus for planning a centralized radio access network to solve the above-mentioned technical problems. In a first aspect, an embodiment of the present application provides a method for planning a centralized radio access network, including: the method comprises the steps of taking base station network elements as vertexes, taking switching between the base station network elements as edges by users, and establishing a weighted undirected graph, wherein vertex weights are traffic of the base station network elements, and edge weights are switching request times of the users between the base station network elements; Dividing the vertexes of the weighted undirected graph based on the edge weights to obtain a plurality of candidate division schemes; Dividing the vertexes of the weighted undirected graph based on the candidate dividing scheme to obtain a plurality of groups, and calculating vertex weight variances of all the groups; and determining a candidate division scheme corresponding to the minimum value in the plurality of vertex weight variances as a planning scheme of the centralized wireless access network. In one possible implementation, the method for dividing the vertex of the weighted undirected graph based on the edge weight to obtain a plurality of candidate division schemes comprises: Step S1, determining a vertex as a group; s2, selecting a target vertex from any group, combining the group in which the target vertex is positioned with the group in which the adjacent vertex of the target vertex is positioned, and obtaining a plurality of combined groups; Step S3, determining that the total traffic of the combined packet does not exceed a preset threshold value and the module increment of the combined packet is the largest as the optimal combined packet; Step S4, determining a plurality of current groups with weight undirected graphs based on the optimal combined groups; s5, determining the sum of the modularity of all the current groups as a current Q value; Step S6, judging whether the current Q value is larger than the last Q value, if not, turning to step S2, otherwise, turning to step S7; and S7, determining the dividing mode of the current plurality of groups as a candidate dividing scheme. In one possible implementation, the step of calculating the module increment of the combined packet includes: Calculating the modularity increment of the combined packets according to : Wherein, the Is the sum of the weights of the edges within the merged packet; Is the sum of the weights of the edges associated with the merged packet; Is the sum of the weights of the edges connected to the target vertex i with