PCI planning methods, devices, electronic equipment, and storage media

Abstract

This invention provides a PCI planning method, apparatus, electronic device, and storage medium, belonging to the field of communication technology. The method includes: triangulating a target area to determine the topology of base stations; selecting an unplanned base station and adding it to a first-in-first-out (FIFO) queue; designating the first base station in the FIFO queue as the target base station; determining the degree of influence between the cells to be planned under the target base station and each neighboring cell based on the topology; determining the PCI of the cells to be planned based on each degree of influence; after determining the PCI of all cells under the target base station, adding the unplanned base stations adjacent to the target base station to the FIFO queue in sequence, and returning to the step of designating the first base station in the FIFO queue as the target base station, until the FIFO queue is empty. This invention can realize batch PCI planning of contiguous base stations within a region, improving PCI planning efficiency.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a PCI planning method, apparatus, electronic device, and storage medium. Background Technology

[0002] The Physical Cell Identifier (PCI) is a parameter used to uniquely identify a cell in a mobile communication network. PCI is widely used in LTE (Long Term Evolution) and 5G NR (New Radio) networks, primarily for cell identification, synchronization, and signal transmission. PCI planning is a crucial aspect of mobile communication network optimization. Its purpose is to rationally allocate PCIs to each cell of a base station, ensuring that downlink signals from cells with the same frequency and PCI do not interfere with each other, thereby guaranteeing that mobile phones can correctly synchronize and decode the pilot channels of the serving cell.

[0003] Currently, data such as cell coverage and signal strength are typically collected using drive testing tools. Based on this data, PCI is manually assigned to each cell to avoid PCI modulo 3, modulo 6, and modulo 30 interference, thus achieving PCI deployment planning for new base stations. This method suffers from low PCI planning efficiency, and due to the large computational load, manual planning is prone to errors.

[0004] Therefore, improving PCI planning efficiency and reducing PCI planning error rate has become an urgent technical problem to be solved. Summary of the Invention

[0005] This invention provides a PCI planning method, apparatus, electronic device, and storage medium to address the shortcomings of low efficiency and high error rate in existing PCI planning technologies.

[0006] This invention provides a PCI planning method, comprising the following steps:

[0007] The target area is triangulated, and the topological relationship of the base stations in the target area is determined based on the triangulation results;

[0008] Select an unplanned base station from the target area and add it to the first-in-first-out queue;

[0009] The first base station in the first-in-first-out queue is taken as the target base station;

[0010] Based on the topology, the degree of influence between the cells to be planned under the target base station and each neighboring cell is determined, wherein the neighboring cell is a cell under a base station adjacent to the target base station;

[0011] Based on the degree of each of the aforementioned impacts, the PCI of the cell to be planned is determined;

[0012] After determining the PCI of all cells under the target base station, the unplanned base stations adjacent to the target base station are added to the first-in-first-out queue in sequence, and the process returns to the step of taking the first base station in the first-in-first-out queue as the target base station, until the first-in-first-out queue is empty.

[0013] According to a PCI planning method provided by the present invention, the step of triangulating a target area and determining the topological relationship of base stations in the target area based on the triangulation results includes:

[0014] The base stations in the target area are triangulated using the De Röne triangulation algorithm to obtain a set of triangles. Each element in the set of triangles is a triangle, and each vertex of the triangle is a base station.

[0015] Obtain the edges of each triangle in the triangle set, remove duplicates, and combine them to obtain the adjacency topology set of the target region. Each element in the adjacency topology set is a pair of adjacency relationships.

[0016] According to a PCI planning method provided by the present invention, determining the degree of influence between the cell to be planned under the target base station and each neighboring cell based on the topology relationship includes:

[0017] Obtain all first-type elements in the adjacency topology relationship set, and take the base stations other than the target base station in the first-type elements as first-type neighboring stations. The first-type elements are elements that include the target base station.

[0018] Obtain all second-type elements in the triangle set, and take the base stations in the second-type elements other than the first-type neighboring stations as second-type neighboring stations. The second-type elements are triangles that contain two first-type neighboring stations but do not contain the target base station.

[0019] Determine the degree of influence between the cells to be planned under the target base station and the cells under each of the first-class neighboring stations, and determine the degree of influence between the cells to be planned under the target base station and the cells under each of the second-class neighboring stations.

[0020] According to a PCI planning method provided by the present invention, determining the PCI of the cell to be planned based on the degree of each of the aforementioned influences includes:

[0021] Cells with an impact level greater than a preset threshold are selected as affected neighboring cells, and all affected neighboring cells are combined into an affected neighboring cell set.

[0022] For any cell to be planned, the PCI values ​​in the preset specifications are traversed sequentially. If the PCI modulus of the current PCI does not conflict with the PCI modulus of any of the affected neighboring cells, then the current PCI is used as the PCI of the cell to be planned.

[0023] According to a PCI planning method provided by the present invention, determining the PCI of the cell to be planned based on the degree of each of the aforementioned influences includes:

[0024] Determine the set of PCI moduli that affect the neighboring cell set;

[0025] The PCI module with the smallest total influence in the set of PCI modules is taken as the reference PCI module;

[0026] For any cell to be planned, the PCI values ​​in the preset specifications are traversed sequentially. If the PCI modulus of the current PCI is equal to the reference PCI modulus, and the current PCI is not equal to any reference PCI, then the current PCI is taken as the PCI of the cell to be planned. The reference PCI is the PCI of the neighboring cells with the PCI modulus in the set of neighboring cells.

[0027] According to a PCI planning method provided by the present invention, the degree of influence between the cell to be planned and the neighboring cells is determined based on the following steps:

[0028] The coverage areas of the cell to be planned and the neighboring cells are constructed in circles to obtain a first circle and a second circle. The first circle is the coverage shape of the cell to be planned, and the second circle is the coverage shape of the neighboring cells.

[0029] After adding the first radius and the second radius, subtracting the center distance, the degree of influence between the planned cell and the neighboring cell is obtained. The first radius is the radius of the first circle, the second radius is the radius of the second circle, and the center distance is the distance between the center of the first circle and the center of the second circle.

[0030] The present invention also provides a PCI planning device, comprising the following modules:

[0031] The triangulation module is used to: triangulate the target area and determine the topological relationship of the base stations in the target area based on the triangulation results;

[0032] The base station selection module is used to: select an unplanned base station from the target area and add it to the first-in-first-out queue;

[0033] The target acquisition module is used to: identify the first base station in the first-in-first-out queue as the target base station;

[0034] The impact calculation module is used to: determine the degree of influence between the cells to be planned under the target base station and each neighboring cell based on the topology relationship, wherein the neighboring cells are cells under the base station adjacent to the target base station;

[0035] The PCI determination module is used to: determine the PCI of the cell to be planned based on the degree of each of the aforementioned impacts;

[0036] The queue update module is used to: after determining the PCI of all cells under the target base station, add the unplanned base stations adjacent to the target base station to the first-in-first-out queue in sequence, and return to the step of taking the first base station in the first-in-first-out queue as the target base station, until the first-in-first-out queue is empty.

[0037] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement any of the PCI planning methods described above.

[0038] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the PCI planning method as described above.

[0039] The present invention also provides a computer program product, including a computer program that, when executed by a processor, implements any of the PCI planning methods described above.

[0040] The PCI planning method, apparatus, electronic device, and storage medium provided by this invention perform triangulation on a target area, determine the topological relationship of base stations in the target area based on the triangulation results, and provide data basis for subsequently determining the interference situation between cells under the base station; select an unplanned base station from the target area and add it to a first-in-first-out (FIFO) queue; designate the first base station in the FIFO queue as the target base station; and determine the degree of influence between the cells to be planned under the target base station and each neighboring cell based on the topological relationship, where the neighboring cells are cells under the base stations adjacent to the target base station. Quantitatively assessing the interference between cells is a prerequisite for subsequent PCI planning. Based on the degree of impact, the PCI of the cell to be planned is determined. After determining the PCI of all cells under the target base station, the unplanned base stations adjacent to the target base station are added sequentially to the first-in-first-out (FIFO) queue. The process returns to the step of setting the first base station in the FIFO queue as the target base station, until the FIFO queue is empty. By adding adjacent unplanned base stations sequentially to the FIFO queue, batch planning of base station PCI in the target area is achieved, significantly improving the efficiency of base station PCI planning. In summary, compared to manual PCI planning, this scheme can accurately determine the PCI of the cell to be planned based on the degree of impact between cells, reducing the error rate of PCI planning; by using the FIFO queue to manage the base stations to be planned in the target area in an orderly manner, batch planning of PCI for contiguous base stations in the area is achieved, improving the efficiency of PCI planning. Attached Figure Description

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

[0042] Figure 1 This is a flowchart illustrating the PCI planning method provided by the present invention;

[0043] Figure 2 This is a schematic diagram of the adjacency topology of the base station provided by the present invention;

[0044] Figure 3 This is a schematic diagram of adjacent base stations provided by the present invention;

[0045] Figure 4 This is a schematic diagram of the base station planning sequence provided by the present invention;

[0046] Figure 5 This is a schematic diagram illustrating the degree of influence between cells provided by the present invention;

[0047] Figure 6 This is a schematic diagram of the PCI planning device provided by the present invention.

[0048] Figure 7 This is a schematic diagram of the structure of the electronic device provided by the present invention. Detailed Implementation

[0049] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.

[0050] It should be noted that in the description of the embodiments of the present invention, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element. The terms "upper," "lower," etc., indicating orientation or positional relationships based on the orientation or positional relationships shown in the accompanying drawings, are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of the present invention. Unless otherwise expressly specified and limited, the terms "installed," "connected," and "linked" should be interpreted broadly, for example, they can refer to a fixed connection, a detachable connection, or an integral connection; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium; they can refer to the internal communication of two elements. Those skilled in the art can understand the specific meaning of the above terms in this invention according to the specific circumstances.

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

[0052] The following is combined Figures 1-7 This invention describes the PCI planning method, apparatus, electronic device, and storage medium provided in embodiments of the present invention.

[0053] Figure 1 This is a flowchart illustrating the PCI planning method provided by the present invention, as shown below. Figure 1 As shown, the method includes the following:

[0054] S110, perform triangulation on the target area, and determine the topological relationship of the base stations in the target area based on the triangulation results;

[0055] S120, Select an unplanned base station from the target area and add it to the first-in-first-out queue;

[0056] S130, the first base station in the first-in-first-out queue is taken as the target base station;

[0057] S140, Based on the topology, determine the degree of influence between the cells to be planned under the target base station and each neighboring cell, wherein the neighboring cell is a cell under a base station adjacent to the target base station;

[0058] S150, Based on the degree of each of the aforementioned impacts, determine the PCI of the cell to be planned;

[0059] S160, after determining the PCI of all cells under the target base station, add the unplanned base stations adjacent to the target base station to the first-in-first-out queue in sequence, and return to the step of taking the first base station in the first-in-first-out queue as the target base station, until the first-in-first-out queue is empty.

[0060] It should be noted that the execution subject of the task construction method provided in the embodiments of the present invention can be a server or computer device, such as a mobile phone, tablet computer, laptop computer, handheld computer, ultra-mobile personal computer (UMPC), netbook, or personal digital assistant (PDA), etc.

[0061] Optionally, prior to S110, the PCI planning method further includes: performing relevant preprocessing on the engineering parameter data. Specifically:

[0062] Obtain the original 4G / 5G cell engineering parameter data. After processing the engineering parameter data, it includes the following fields: cell ID, base station ID, base station longitude, base station latitude, cell azimuth, cell frequency, and cell PCI. Among them, the cell azimuth refers to the direction of the antenna main beam on the horizontal plane, and the cell frequency refers to the specific frequency value used by the cell.

[0063] Collect engineering parameter data of the area to be planned and the surrounding planned areas, and merge them into a contiguous target area, where cells with empty PCI are cells or base stations to be planned.

[0064] Verify the quality of engineering parameter data, delete duplicate cell data, and ensure that the latitude and longitude of base stations are unique;

[0065] The geographic coordinate system expressed in latitude and longitude is converted into a plane rectangular coordinate system in meters. The specific conversion algorithm used is not restricted. For example, the Mercator projection algorithm can be used.

[0066] The final output parameters are shown in Table 1 below.

[0067] Table 1. Parameter Field Table

[0068]

[0069] In S110, base station-level data, including base station ID, base station accuracy, and progress dimension, is extracted from the engineering parameter data. Based on the base station-level engineering parameter data, the target area is triangulated to obtain the adjacency topology of the base stations.

[0070] In S110, the target area is triangulated, that is, the target area is decomposed into several triangular areas with base stations as vertices. Based on these triangles, the adjacency topology of each base station is determined.

[0071] In S140, neighboring cells are cells belonging to base stations adjacent to the target base station that may affect the signal of the cell to be planned.

[0072] Optionally, concentric circles are constructed with the target base station as the center and a preset radius. Neighboring cells are cells belonging to the base station within the nth concentric circle from the inside out, where n is a positive integer. For example, a neighboring cell is a cell belonging to the base station within the second concentric circle. By selecting a reasonable value for n, the impact on the signal of all base stations that may affect the cell to be planned is calculated.

[0073] It should be noted that the specific method for calculating the degree of impact is not limited here. For example, the overlapping area between the signal coverage areas of the cell to be planned and the signal coverage areas of the neighboring cell can be used as the degree of impact between the two, or the degree of impact can be determined based on the distance between the cell to be planned and the neighboring cell.

[0074] In S160, the base station adjacent to the target base station is the base station immediately next to the target base station. For example, when constructing concentric circles with the target base station as the center, the base station adjacent to the target base station is the base station within the first concentric circle.

[0075] In S160, after planning PCI for all cells under the target base station, the unplanned base stations adjacent to the target base station are added to a First-In-First-Out (FIFO) queue in sequence. This can be in clockwise or counterclockwise order, or based on their distance from the target base station. By adding adjacent unplanned base stations to the FIFO queue in sequence, PCI planning is performed layer by layer for unplanned base stations. This breadth-first traversal method achieves batch planning of base stations within the target area and obtains a better PCI reuse distance.

[0076] In summary, the PCI planning method provided by this invention performs triangulation on a target area, determines the topological relationship of base stations in the target area based on the triangulation results, and provides data for subsequently determining the interference between cells belonging to a base station; selects an unplanned base station from the target area and adds it to a first-in-first-out (FIFO) queue; designates the first base station in the FIFO queue as the target base station; and, based on the topological relationship, determines the degree of influence between the cells to be planned belonging to the target base station and each neighboring cell, where the neighboring cells are cells belonging to base stations adjacent to the target base station, thus achieving... Quantitatively assessing the interference between cells is a prerequisite for subsequent PCI planning. Based on the degree of impact, the PCI of the cell to be planned is determined. After determining the PCI of all cells under the target base station, the unplanned base stations adjacent to the target base station are added sequentially to the first-in-first-out (FIFO) queue. The process returns to the step of setting the first base station in the FIFO queue as the target base station, until the FIFO queue is empty. By adding adjacent unplanned base stations sequentially to the FIFO queue, batch planning of base station PCI in the target area is achieved, significantly improving the efficiency of base station PCI planning. In summary, compared to manual PCI planning, this scheme can accurately determine the PCI of the cell to be planned based on the degree of impact between cells, reducing the error rate of PCI planning; by using the FIFO queue to manage the base stations to be planned in the target area in an orderly manner, batch planning of PCI for contiguous base stations in the area is achieved, improving the efficiency of PCI planning.

[0077] In an optional embodiment, the step of triangulating the target area and determining the topological relationship of base stations in the target area based on the triangulation results includes:

[0078] The base stations in the target area are triangulated using the De Röne triangulation algorithm to obtain a set of triangles. Each element in the set of triangles is a triangle, and each vertex of the triangle is a base station.

[0079] Obtain the edges of each triangle in the triangle set, remove duplicates, and combine them to obtain the adjacency topology set of the target region. Each element in the adjacency topology set is a pair of adjacency relationships.

[0080] Figure 2 This is a schematic diagram of the adjacency topology of the base station provided by the present invention, as shown below. Figure 2 As shown, each point represents a base station. After performing the De Röne triangulation algorithm on the base stations in the target area, the target area is decomposed into several densely spaced, non-overlapping triangular regions with base stations as vertices, resulting in a set of triangles: {(base station A, base station B, base station C), (base station A, base station B, base station D), ...}, where each element in the set represents a triangle, represented by three vertex base stations.

[0081] like Figure 2 As shown, since the three vertices that make up a triangle are adjacent to each other (if two nodes are directly connected by an edge, then the two nodes are adjacent), by traversing the set of triangles, recording and deduplicating the edges of all triangles, we obtain the regional base station adjacency relationships, i.e., the set of adjacency topology relationships: {(base station A, base station B), (base station A, base station C), (base station B, base station C), (base station A, base station D), (base station B, base station D), ...}, where each element in the set is a pair of adjacency relationships.

[0082] In an optional embodiment, determining the degree of influence between the cells to be planned under the target base station and each neighboring cell based on the topology relationship includes:

[0083] Obtain all first-type elements in the adjacency topology relationship set, and take the base stations other than the target base station in the first-type elements as first-type neighboring stations. The first-type elements are elements that include the target base station.

[0084] Obtain all second-type elements in the triangle set, and take the base stations in the second-type elements other than the first-type neighboring stations as second-type neighboring stations. The second-type elements are triangles that contain two first-type neighboring stations but do not contain the target base station.

[0085] Determine the degree of influence between the cells to be planned under the target base station and the cells under each of the first-class neighboring stations, and determine the degree of influence between the cells to be planned under the target base station and the cells under each of the second-class neighboring stations.

[0086] Figure 3 This is a schematic diagram of adjacent base stations provided by the present invention;

[0087] Figure 4 This is a schematic diagram of the base station planning sequence provided by the present invention;

[0088] like Figure 3 As shown, the first type of elements is selected from the adjacency topology set, namely, adjacency relationships containing the current target base station. All base stations in these adjacency relationships other than the target base station are first-type neighboring stations, forming the first circle of neighboring stations. The shared-edge triangle algorithm is used to obtain the second type of neighboring stations. Specifically, a triangle containing two first-type neighboring stations but not the current target base station is selected from the triangle set. All vertices are extracted, and the first-type neighboring stations are removed. After deduplication, the second-type neighboring stations are obtained, forming the second circle of neighboring stations. For example, as shown... Figure 4 As shown, for target base station 1, the first type of elements includes (base station 1, base station 2), (base station 1, base station 3), (base station 1, base station 4), (base station 1, base station 5), (base station 1, base station 6), and (base station 1, base station 7). Then, base stations 2, 3, 4, 5, 6, and 7 are all first-type neighboring stations, forming the first circle of neighboring stations. The corresponding second type of elements in the triangle set includes (base station 8, base station 2, base station 7), (base station 8, base station 9, base station 2), (base station 9, base station 2, base station 10), (base station 2, base station 10), (base station 3, base station 4), (base station 5, base station 6), and (base station 1, base station 7). 10, base station 11), (base station 3, base station 4, base station 11), (base station 4, base station 11, base station 12), (base station 4, base station 12, base station 13), (base station 4, base station 5, base station 13), (base station 5, base station 13, base station 14), (base station 5, base station 6, base station 14), (base station 6, base station 14, base station 15), (base station 6, base station 15, base station 8) and (base station 6, base station 7, base station 8), then base station 8, base station 9, base station 10, base station 11, base station 12, base station 13, base station 14, and base station 15 are all second-class neighboring stations, forming the second circle of neighboring stations.

[0089] Furthermore, in S160, after the PCI planning of all cells under the target base station 1 is completed, the first type of neighboring stations are added to the first-in-first-out queue in sequence. Taking clockwise order as an example, base stations 2, 3, 4, 5, 6, and 7 are added to the first-in-first-out queue in sequence. The process returns to the step of taking the first base station in the first-in-first-out queue as the target base station, that is, taking base station 2 as the target base station, and continues to execute the subsequent steps until the first-in-first-out queue is empty, realizing breadth-first traversal and completing the PCI planning of the target area.

[0090] The PCI planning method provided in this embodiment of the invention obtains the first-layer direct adjacency relationship of the base station to be planned based on the De Röne triangulation, and obtains the second-layer adjacency topology relationship based on the common-edge triangle algorithm. The topology relationship is used to accurately obtain the neighboring stations with significant overlapping coverage impact of the target base station, which is a prerequisite for subsequent PCI planning.

[0091] In an optional embodiment, the degree of influence between the cell to be planned and the neighboring cells is determined based on the following steps:

[0092] The coverage areas of the cell to be planned and the neighboring cells are constructed in circles to obtain a first circle and a second circle. The first circle is the coverage shape of the cell to be planned, and the second circle is the coverage shape of the neighboring cells.

[0093] After adding the first radius and the second radius, subtracting the center distance, the degree of influence between the planned cell and the neighboring cell is obtained. The first radius is the radius of the first circle, the second radius is the radius of the second circle, and the center distance is the distance between the center of the first circle and the center of the second circle.

[0094] Figure 5 This is a schematic diagram of the degree of influence between cells provided by the present invention, such as... Figure 5 As shown, for the planned cell A and the neighboring cell B, the azimuth angles of the planned cell A and the neighboring cell B with line segment AB are α and β, respectively. The distance between the planned cell A and the neighboring cell B is d. The cell coverage shape is modeled as a circle. The coverage radius of the planned cell A is the first radius r1, and the coverage radius of the neighboring cell B is the second radius r2. The distance between the coverage center of the planned cell A (the center of the first circle) and the coverage center of the neighboring cell B (the center of the second circle) is 1. Then, the degree of influence k between the planned cell A and the neighboring cell B is: k = r1 + r2 - 1.

[0095] in, ;

[0096] ;

[0097] .

[0098] The PCI planning method provided in this invention reasonably models the effective coverage area of ​​a cell as a circle, calculates the gradient, and the calculated impact degree k value is positively correlated with the area of ​​the overlapping coverage area of ​​the two cells, thereby achieving an accurate and quantitative assessment of the impact of PCI conflict between the two cells.

[0099] In an optional embodiment, determining the PCI of the cell to be planned based on each of the aforementioned degrees of influence includes:

[0100] Cells with an impact level greater than a preset threshold are selected as affected neighboring cells, and all affected neighboring cells are combined into an affected neighboring cell set.

[0101] For any cell to be planned, the PCI values ​​in the preset specifications are traversed sequentially. If the PCI modulus of the current PCI does not conflict with the PCI modulus of any of the affected neighboring cells, then the current PCI is used as the PCI of the cell to be planned.

[0102] Specifically, for each cell of the current target base station, starting from the PCI number of the last planning, all PCI values ​​in the specification are traversed in sequence to attempt planning: if the PCI modulus and the set of modulus affecting the PCI of neighboring cells do not conflict, then the PCI is planned.

[0103] Optionally, neighboring regions with an influence level k > 0 can be selected as the affected neighboring regions.

[0104] The PCI planning method provided in this embodiment of the invention attempts to plan PCI values ​​in sequence, and uses the PCI that does not conflict as the PCI of the cell to be planned, avoiding PCI modulo 3, modulo 6 and modulo 30 interference, and ensuring normal communication of the cell to be planned.

[0105] In an optional embodiment, determining the PCI of the cell to be planned based on each of the aforementioned degrees of influence includes:

[0106] Determine the set of PCI moduli that affect the neighboring cell set;

[0107] The PCI module with the smallest total influence in the set of PCI modules is taken as the reference PCI module;

[0108] For any cell to be planned, the PCI values ​​in the preset specifications are traversed sequentially. If the PCI modulus of the current PCI is equal to the reference PCI modulus, and the current PCI is not equal to any reference PCI, then the current PCI is taken as the PCI of the cell to be planned. The reference PCI is the PCI of the neighboring cells with the PCI modulus in the set of neighboring cells.

[0109] Specifically, if the planned number does not meet the current number of base station cells, then for the current cell to be planned, from the set of PCI modules that affect neighboring cells, select the PCI module with the smallest total impact. Starting from the PCI number of the last planning, traverse all PCI values ​​in the specification in order to try planning: if the PCI module is equal to the PCI module with the smallest total impact, and the PCIs are not equal, then plan the PCI.

[0110] The PCI planning method provided in this embodiment of the invention selects the PCI with the least modulus conflict as the PCI of the cell to be planned, and reasonably allocates PCIs to each cell of the target base station to ensure that the downlink signals of the cells do not interfere with each other.

[0111] The PCI planning apparatus provided in the embodiments of the present invention is described below. The PCI planning apparatus described below and the PCI planning method described above can be referred to in correspondence.

[0112] Figure 6 This is a schematic diagram of the PCI planning device provided by the present invention, as shown below. Figure 6 As shown, the PCI planning device may include, but is not limited to;

[0113] The triangulation module 610 is used to: triangulate the target area and determine the topological relationship of the base stations in the target area based on the triangulation results;

[0114] The base station selection module 620 is used to: select an unplanned base station from the target area and add it to the first-in-first-out queue;

[0115] Target acquisition module 630 is used to: take the first base station in the first-in-first-out queue as the target base station;

[0116] The impact calculation module 640 is used to: determine the degree of influence between the cells to be planned under the target base station and each neighboring cell based on the topology relationship, wherein the neighboring cells are cells under the base station adjacent to the target base station;

[0117] PCI determination module 650 is used to: determine the PCI of the cell to be planned based on the degree of each of the aforementioned impacts;

[0118] The queue update module 660 is used to: after determining the PCI of all cells under the target base station, add the unplanned base stations adjacent to the target base station to the first-in-first-out queue in sequence, and return to the step of taking the first base station in the first-in-first-out queue as the target base station, until the first-in-first-out queue is empty.

[0119] It should be noted that the PCI planning device provided in this embodiment of the invention can execute the PCI planning method described in any of the above embodiments during specific operation, which will not be elaborated in this embodiment.

[0120] Figure 7 An example is a schematic diagram of the physical structure of an electronic device, such as... Figure 7As shown, the electronic device may include a processor 710, a communications interface 720, a memory 730, and a communication bus 740, wherein the processor 710, the communications interface 720, and the memory 730 communicate with each other through the communication bus 740. The processor 710 can call logical instructions in the memory 730 to execute a PCI planning method, which includes: triangulating a target area and determining the topological relationship of base stations in the target area based on the triangulation results;

[0121] Select an unplanned base station from the target area and add it to the first-in-first-out queue;

[0122] The first base station in the first-in-first-out queue is taken as the target base station;

[0123] Based on the topology, the degree of influence between the cells to be planned under the target base station and each neighboring cell is determined, wherein the neighboring cell is a cell under a base station adjacent to the target base station;

[0124] Based on the degree of each of the aforementioned impacts, the PCI of the cell to be planned is determined;

[0125] After determining the PCI of all cells under the target base station, the unplanned base stations adjacent to the target base station are added to the first-in-first-out queue in sequence, and the process returns to the step of taking the first base station in the first-in-first-out queue as the target base station, until the first-in-first-out queue is empty.

[0126] Furthermore, the logical instructions in the aforementioned memory 730 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, essentially, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0127] On the other hand, the present invention also provides a computer program product, the computer program product including a computer program, the computer program being able to be stored on a non-transitory computer-readable storage medium, the computer program being executed by a processor, the computer being able to execute the PCI planning method provided by the above methods, the method including: performing triangulation on a target area, and determining the topological relationship of base stations in the target area based on the triangulation results;

[0128] Select an unplanned base station from the target area and add it to the first-in-first-out queue;

[0129] The first base station in the first-in-first-out queue is taken as the target base station;

[0130] Based on the topology, the degree of influence between the cells to be planned under the target base station and each neighboring cell is determined, wherein the neighboring cell is a cell under a base station adjacent to the target base station;

[0131] Based on the degree of each of the aforementioned impacts, the PCI of the cell to be planned is determined;

[0132] After determining the PCI of all cells under the target base station, the unplanned base stations adjacent to the target base station are added to the first-in-first-out queue in sequence, and the process returns to the step of taking the first base station in the first-in-first-out queue as the target base station, until the first-in-first-out queue is empty.

[0133] In another aspect, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to perform the PCI planning method provided by the above methods, the method comprising: triangulating a target area and determining the topological relationship of base stations in the target area based on the triangulation result;

[0134] Select an unplanned base station from the target area and add it to the first-in-first-out queue;

[0135] The first base station in the first-in-first-out queue is taken as the target base station;

[0136] Based on the topology, the degree of influence between the cells to be planned under the target base station and each neighboring cell is determined, wherein the neighboring cell is a cell under a base station adjacent to the target base station;

[0137] Based on the degree of each of the aforementioned impacts, the PCI of the cell to be planned is determined;

[0138] After determining the PCI of all cells under the target base station, the unplanned base stations adjacent to the target base station are added to the first-in-first-out queue in sequence, and the process returns to the step of taking the first base station in the first-in-first-out queue as the target base station, until the first-in-first-out queue is empty.

[0139] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0140] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0141] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A PCI planning method, characterized in that, include: The target area is triangulated, and the topological relationship of the base stations in the target area is determined based on the triangulation results; Select an unplanned base station from the target area and add it to the first-in-first-out queue; The first base station in the first-in-first-out queue is taken as the target base station; Based on the topology, the degree of influence between the cells to be planned under the target base station and each neighboring cell is determined, wherein the neighboring cell is a cell under a base station adjacent to the target base station; Based on the degree of each of the aforementioned impacts, the PCI of the cell to be planned is determined; After determining the PCI of all cells under the target base station, the unplanned base stations adjacent to the target base station are added to the first-in-first-out queue in sequence, and the process returns to the step of taking the first base station in the first-in-first-out queue as the target base station, until the first-in-first-out queue is empty.

2. The PCI planning method according to claim 1, characterized in that, The step of triangulating the target region and determining the topological relationships of base stations in the target region based on the triangulation results includes: The base stations in the target area are triangulated using the De Röne triangulation algorithm to obtain a set of triangles. Each element in the set of triangles is a triangle, and each vertex of the triangle is a base station. Obtain the edges of each triangle in the triangle set, remove duplicates, and combine them to obtain the adjacency topology set of the target region. Each element in the adjacency topology set is a pair of adjacency relationships.

3. The PCI planning method according to claim 2, characterized in that, The step of determining the degree of influence between the cells to be planned under the target base station and each neighboring cell based on the topological relationship includes: Obtain all first-type elements in the adjacency topology relationship set, and take the base stations other than the target base station in the first-type elements as first-type neighboring stations. The first-type elements are elements that include the target base station. Obtain all second-type elements in the triangle set, and take the base stations in the second-type elements other than the first-type neighboring stations as second-type neighboring stations. The second-type elements are triangles that contain two first-type neighboring stations but do not contain the target base station. Determine the degree of influence between the cells to be planned under the target base station and the cells under each of the first-class neighboring stations, and determine the degree of influence between the cells to be planned under the target base station and the cells under each of the second-class neighboring stations.

4. The PCI planning method according to claim 3, characterized in that, The determination of the PCI of the cell to be planned based on the degree of each of the aforementioned impacts includes: Cells with an impact level greater than a preset threshold are selected as affected neighboring cells, and all affected neighboring cells are combined into an affected neighboring cell set. For any cell to be planned, the PCI values ​​in the preset specifications are traversed sequentially. If the PCI modulus of the current PCI does not conflict with the PCI modulus of any of the affected neighboring cells, then the current PCI is used as the PCI of the cell to be planned.

5. The PCI planning method according to claim 4, characterized in that, The determination of the PCI of the cell to be planned based on the degree of each of the aforementioned impacts includes: Determine the set of PCI moduli that affect the neighboring cell set; The PCI module with the smallest total influence in the set of PCI modules is taken as the reference PCI module; For any cell to be planned, the PCI values ​​in the preset specifications are traversed sequentially. If the PCI modulus of the current PCI is equal to the reference PCI modulus, and the current PCI is not equal to any reference PCI, then the current PCI is taken as the PCI of the cell to be planned. The reference PCI is the PCI of the neighboring cells with the PCI modulus in the set of neighboring cells.

6. The PCI planning method according to any one of claims 1-5, characterized in that, The degree of influence between the cell to be planned and the neighboring cells is determined based on the following steps: The coverage areas of the cell to be planned and the neighboring cells are constructed in circles to obtain a first circle and a second circle. The first circle is the coverage shape of the cell to be planned, and the second circle is the coverage shape of the neighboring cells. After adding the first radius and the second radius, subtracting the center distance, the degree of influence between the planned cell and the neighboring cell is obtained. The first radius is the radius of the first circle, the second radius is the radius of the second circle, and the center distance is the distance between the center of the first circle and the center of the second circle.

7. A PCI planning device, characterized in that, include: The triangulation module is used to: triangulate the target area and determine the topological relationship of the base stations in the target area based on the triangulation results; The base station selection module is used to: select an unplanned base station from the target area and add it to the first-in-first-out queue; The target acquisition module is used to: identify the first base station in the first-in-first-out queue as the target base station; The impact calculation module is used to: determine the degree of influence between the cells to be planned under the target base station and each neighboring cell based on the topology relationship, wherein the neighboring cells are cells under the base station adjacent to the target base station; The PCI determination module is used to: determine the PCI of the cell to be planned based on the degree of each of the aforementioned impacts; The queue update module is used to: after determining the PCI of all cells under the target base station, add the unplanned base stations adjacent to the target base station to the first-in-first-out queue in sequence, and return to the step of taking the first base station in the first-in-first-out queue as the target base station, until the first-in-first-out queue is empty.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the PCI planning method as described in any one of claims 1 to 6.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the PCI planning method as described in any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the PCI planning method as described in any one of claims 1 to 6.

Images