PCI whole network replanning method and device, electronic equipment and medium

Abstract

The invention discloses a PCI whole network replanning method and device, electronic equipment and a medium. The method comprises the following steps: acquiring basic information of a replanning area and a peripheral area thereof; the basic information comprises cell basic information, adjacent cell information, overlapping coverage information and PCI replanning configuration information of each cell in the region; preprocessing the basic information to obtain target data; performing PCI replanning based on the target data to obtain a PCI planning scheme; the PCI replanning comprises PCI group planning and MOD3 interference optimization. According to the technical scheme, through the steps of comprehensively obtaining basic information, preprocessing data, comprehensively planning the PCI and the like, the PCI related problems existing in the current electric connection 4G / 5G co-construction and sharing network are effectively solved, the network performance is optimized, the user experience is improved, and the method has wide popularization and application prospects and can be widely applied to the technical field of data processing.

Description

Technical Field

[0001] The present invention relates to the field of data processing technology, and in particular to a PCI full network replanning method, device, electronic equipment and medium. Background Art

[0002] With the deepening of the joint construction and sharing of 4G / 5G networks of China Telecom, the scale of China Telecom's shared network has gradually expanded, and the frequency unification work has begun. For example, the original 1.8G frequency and different frequency points have been merged into one network. One frequency point is used as the coverage layer to achieve continuous coverage, and one frequency point is used as the capacity layer to superimpose frequency points in areas with insufficient capacity to solve the capacity problem. Because the two parties did not consider each other's network when planning PCI before, when the two networks were merged into a network with the same frequency coverage, PCI conflicts and PCI collisions were prone to occur. At the same time, PCI MOD3 and MOD30 problems were highlighted. The current SON's PCI self-optimization function is not perfect and cannot achieve PCI automatic optimization. The existing PCI optimization algorithms are all optimized for a single site. Summary of the invention

[0003] The present invention proposes a PCI full network replanning method, device, electronic device and medium, aiming to solve one of the technical problems in the related technology at least to a certain extent. The embodiments of the present invention can flexibly and efficiently implement PCI full network replanning.

[0004] On the one hand, an embodiment of the present invention provides a PCI full network replanning method, including:

[0005] Obtain basic information of the replanning area and its surrounding areas; the basic information includes basic cell information, neighboring cell information, overlapping coverage information and PCI replanning configuration information of each cell in the area;

[0006] Preprocess the basic information to obtain target data;

[0007] PCI replanning is performed based on target data to obtain a PCI planning solution; PCI replanning includes PCI group planning and MOD3 interference optimization.

[0008] Optionally, before the step of preprocessing the basic information, the method further comprises the following steps:

[0009] Perform error correction on basic information.

[0010] Optionally, error correction processing is performed on the basic information, including the following steps:

[0011] Performing a first check and correction on the cell longitude and latitude recorded in the cell basic information of each cell;

[0012] Perform a second check and error correction on the PCI configuration of the same cell recorded in the cell basic information and neighboring cell information;

[0013] Performing a third check and error correction on the neighboring cell relationship greater than the first preset distance recorded in the neighboring cell information;

[0014] Performing fourth check and error correction on redundant data in neighboring cell information and cell basic information;

[0015] Based on the results of the first error checking and correction, the second error checking and correction, the third error checking and correction, and the fourth error checking and correction, the verification result is sent to the administrator; and then the error information in the verification result is corrected in response to the correction instruction of the administrator.

[0016] Optionally, performing a first check and error correction on the cell longitude and latitude recorded in the cell basic information of each cell includes the following steps:

[0017] Based on a preset data attribute format, determine whether the cell latitude and longitude recorded in the cell basic information of each cell has a data attribute error;

[0018] Based on the preset positioning measurement convergence algorithm, determine whether there is any recording error in the cell longitude and latitude recorded in the cell basic information of the 4G cell;

[0019] Based on the neighboring cell information, the neighboring cell association and correction algorithm is used to determine whether there are any recording errors in the cell longitude and latitude recorded in the cell basic information of the 5G cell.

[0020] Optionally, based on the neighboring cell information, a neighboring cell association and correction algorithm is used to determine whether the cell latitude and longitude recorded in the cell basic information of the 5G cell has a recording error, including the following steps:

[0021] Acquire a first preset number of neighboring cells whose distance from the 5G cell is less than a second preset distance, and sort them to obtain a cell list;

[0022] Determine whether there is a neighboring cell in the cell list in the neighboring cell relationship of the 5G cell based on the neighboring cell information;

[0023] When all neighboring cells in the cell list do not exist in the neighboring cell relationship, it is determined that the cell longitude and latitude recorded in the cell basic information of the 5G cell are recorded incorrectly.

[0024] Optionally, the target data includes a PCI group, a physical location point corresponding to a cell PCI of each cell, a mutually exclusive relationship between physical location points, a MOD3 interference table of each cell, a PCI group root list, a candidate PCI group list, and a candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list; preprocessing the basic information to obtain the target data includes the following steps:

[0025] The cell PCIs of all cells are grouped and converted into PCI groups; wherein the cell PCI is determined based on the cell basic information, and the group number of the PCI group is determined based on the arrangement order of the cell PCIs in the PCI group;

[0026] Based on the cell longitude and latitude of each cell, the cell PCI planning is converted into a physical location point; wherein the cell longitude and latitude are determined based on the basic information of the cell, the physical location point is associated with the cell PCI of at least two co-frequency cells, and the physical location point corresponds to the PCI group;

[0027] Based on the neighbor information, the neighbor relationship table of each cell is traversed to obtain the PCI mutual exclusion relationship between the cells, and then the physical location point mutual exclusion relationship is constructed by combining the cell PCI associated with the physical location point;

[0028] Based on the overlapping coverage information, the MOD3 interference times of each cell under different MOD allocations are obtained, and then the MOD3 interference table of each cell is obtained;

[0029] A PCI group root list is constructed based on PCI groups and their corresponding physical location points within a third preset distance around the replanning area;

[0030] A candidate PCI group list and a candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list are constructed based on the physical location points, the mutually exclusive relationship between the physical location points and the PCI group root list.

[0031] Optionally, the target data includes a PCI group, a physical location point corresponding to a cell PCI of each cell, a MOD3 interference table of each cell, a PCI group root list, a candidate PCI group list, and a candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list; performing PCI replanning based on the target data to obtain a PCI planning scheme includes the following steps:

[0032] Perform MOD3 interference optimization based on the MOD3 interference table to obtain the target PCI combination corresponding to each physical location point;

[0033] Perform PCI group planning based on the PCI group root list, the candidate PCI group list and the candidate physical location point list to obtain the PCI group corresponding to each physical location point;

[0034] A PCI planning scheme for each physical location point is obtained based on the PCI group corresponding to each physical location point and the target PCI combination.

[0035] Optionally, performing MOD3 interference optimization based on the MOD3 interference table to obtain a target PCI combination corresponding to each physical location point includes the following steps:

[0036] Obtain a physical location point from the replanning area as a target location point;

[0037] Based on the MOD3 interference table, the MOD3 interference value of the target position point under each PCI combination is obtained, and then the minimum interference value corresponding to the target position point and its corresponding pre-selected combination are determined;

[0038] The minimum interference value is subtracted from the MOD3 interference value of the preset PCI combination to obtain the difference; when the difference is equal to the preset single optimization maximum value, the target PCI combination corresponding to the target position point is determined as the pre-selected combination; otherwise, the difference is used as the single optimization maximum value corresponding to the target position point, the target position point is used as the physical position point to be optimized, and the pre-selected combination is used as the optimal combination; the next position of the target position point in the replanning area is used as the target position point;

[0039] Among them, the single optimization maximum value corresponding to each physical location point is initially 0;

[0040] The MOD3 interference values ​​of the three cells corresponding to the physical location point to be optimized are updated based on the overlapping coverage number determined by the MOD3 interference table;

[0041] Return to the step of obtaining the MOD3 interference value of the target location point under each PCI combination based on the MOD3 interference table until all physical location points in the replanning area complete the MOD3 interference optimization.

[0042] Optionally, performing PCI group planning based on the PCI group root list, the candidate PCI group list, and the candidate physical location point list to obtain a PCI group corresponding to each physical location point includes the following steps:

[0043] Extracting the physical location point with the least elements from the candidate PCI group list as the pre-planned location point;

[0044] Obtain a candidate physical location point list corresponding to each candidate PCI group of the pre-planned location point in the candidate PCI group list, and then traverse each physical location point in the candidate physical location point list to determine the number of impacts of the physical location points in the candidate physical location point list that include the pre-planned location point;

[0045] Determine the influence ratio of each candidate PCI group based on the influence quantity, sort the candidate PCI groups in ascending order of influence ratio, and obtain a first PCI group sequence;

[0046] A second preset number of candidate PCI groups in the preceding order are obtained from the first PCI group sequence as first candidate PCI groups, a minimum distance between the pre-planned location point and all physical location points in the PCI group root list corresponding to each first candidate PCI group is obtained, and the minimum distance is used as the multiplexing distance; all first candidate PCI groups are sorted in descending order according to the multiplexing distance to obtain a second PCI group sequence;

[0047] The first candidate PCI groups with a first preset ratio in the preamble are obtained from the second PCI group sequence as the second candidate PCI groups, and the MOD30 minimum reuse distance of each second candidate PCI group is obtained by evaluation; all the second candidate PCI groups are sorted in descending order according to the MOD30 minimum reuse distance to obtain a third PCI group sequence;

[0048] The second candidate PCI groups with a second preset ratio in the front sequence are obtained from the third PCI group sequence as the third candidate PCI group, and the number of times each third candidate PCI group is used in the replanning area is evaluated; and the third candidate PCI group with the least number of times used is used as the PCI group corresponding to the pre-planned location point;

[0049] Return to the step of extracting the physical location point with the least elements from the candidate PCI group list as the pre-planned location point until all physical location points in the candidate PCI group list complete PCI group planning.

[0050] On the other hand, an embodiment of the present invention provides a PCI full network replanning device, including:

[0051] The first module is used to obtain basic information of the replanning area and its surrounding areas; the basic information includes basic cell information, neighboring cell information, overlapping coverage information and PCI replanning configuration information of each cell in the area;

[0052] The second module is used to pre-process the basic information to obtain the target data;

[0053] The third module is used to perform PCI replanning based on target data to obtain a PCI planning solution; PCI replanning includes PCI group planning and MOD3 interference optimization.

[0054] Optionally, the device further comprises:

[0055] The fourth module is used to perform error correction on basic information;

[0056] The fourth module is executed before the second module.

[0057] On the other hand, an embodiment of the present invention provides an electronic device, including: a processor and a memory; the memory is used to store programs; the processor executes the program to implement the above-mentioned PCI full network replanning method.

[0058] On the other hand, an embodiment of the present invention provides a computer storage medium, in which a program executable by a processor is stored. When the program executable by the processor is executed by the processor, it is used to implement the above-mentioned PCI full network replanning method.

[0059] The embodiment of the present invention obtains basic information of the replanning area and its surrounding areas; the basic information includes basic cell information, neighboring cell information, overlapping coverage information and PCI replanning configuration information of each cell in the area; pre-processes the basic information to obtain target data; performs PCI replanning based on the target data to obtain a PCI planning scheme; PCI replanning includes PCI group planning and MOD3 interference optimization. The embodiment of the present invention includes at least the following beneficial effects:

[0060] Comprehensively obtain basic information to improve planning accuracy: The present invention first obtains basic information about the replanning area and its surrounding areas, including basic cell information, neighboring cell information, overlapping coverage information, and PCI replanning configuration information for each cell. This information provides comprehensive and accurate data support for subsequent PCI replanning, which helps to improve the accuracy and practicality of the planning scheme.

[0061] Preprocessing basic information to improve processing efficiency: The present invention obtains target data by preprocessing the acquired basic information. This step helps to remove redundant information and extract key information, thereby improving the processing efficiency and accuracy of subsequent PCI re-planning.

[0062] Comprehensively plan PCI to solve conflicts and collisions: The present invention performs PCI replanning based on preprocessed target data, including PCI group planning and MOD3 interference optimization. By comprehensively considering the PCI configuration of all cells in the area, the technical solution of the present invention can effectively avoid PCI conflicts and collisions, optimize MOD3 interference, and improve network performance.

[0063] Optimize network performance and improve user experience: The present invention implements PCI re-planning through PCI group planning and MOD3 interference optimization, which can significantly improve network coverage quality and capacity performance. The optimized PCI configuration can reduce interference, improve signal quality, and thus enhance the user's communication experience.

[0064] To sum up, the technical solution of the present invention effectively solves the PCI-related problems existing in the current China Telecom 4G / 5G co-built and shared network through the steps of comprehensively acquiring basic information, preprocessing data, and comprehensively planning PCI, optimizes network performance, improves user experience, and has broad prospects for promotion and application. BRIEF DESCRIPTION OF THE DRAWINGS

[0065] The accompanying drawings are used to provide a further understanding of the technical solution of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the technical solution of the present invention and do not constitute a limitation on the technical solution of the present invention.

[0066] Figure 1 A schematic diagram of an implementation environment for PCI full network replanning provided by an embodiment of the present invention;

[0067] Figure 2 A schematic diagram of a flow chart of a PCI full network replanning method provided by an embodiment of the present invention;

[0068] Figure 3 A flow chart of the MOD3 interference optimization process provided by an embodiment of the present invention;

[0069] Figure 4 A flowchart of a PCI group planning process provided by an embodiment of the present invention;

[0070] Figure 5 A schematic diagram of a data example of a comparison of multiplexing distances before and after PCI allocation provided in an embodiment of the present invention;

[0071] Figure 6 A schematic diagram of a data example of a comparison of the number of multiplexing layers before and after PCI allocation provided in an embodiment of the present invention;

[0072] Figure 7 A schematic diagram of an example of distribution of points where path testing changes before and after PCI replanning provided in an embodiment of the present invention;

[0073] Figure 8 A schematic diagram of an example of a line graph of CQI mean values ​​before and after reallocation provided in an embodiment of the present invention;

[0074] Fig. 9 A schematic diagram of a data example of a comparison before and after PCI multiplexing distance planning provided in an embodiment of the present invention;

[0075] Fig.10 A schematic diagram of a data example of a comparison before and after planning of the number of PCI multiplexing layers provided in an embodiment of the present invention;

[0076] Fig.11 A schematic diagram of a data example of a comparison before and after PCI MOD3 multiplexing distance planning provided in an embodiment of the present invention;

[0077] Fig.12 A schematic diagram of a data example of a change in the number of multiplexing layers of PCI MOD3 provided in an embodiment of the present invention;

[0078] Fig.13 A schematic diagram of a data example of PCI multiplexing balance comparison provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0079] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0080] It should be noted that, although the functional modules are divided in the system schematic diagram and the logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than the module division in the system or the order in the flowchart. The terms "first / S100", "second / S200", etc. in the specification, claims and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0081] Reference to "embodiments" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present invention. The appearance of the phrase in various places in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0082] To facilitate the understanding of the technical solution of the present invention, the technical feature terms that may appear in the embodiments of the present invention are first explained:

[0083] PCI (Physical Cell Identities), 4G has 504, 5G has 1008, it is a planning parameter used in both 4G and 5G networks. Each cell needs to be configured with a PCI. A base station has 3 cells, and 3 PCIs need to be configured. 3 PCIs are called a group of PCIs, that is, 4G has 168 groups of PCIs available, and 5G has 336 groups of PCIs available. Each base station is configured with a group of PCIs. PCI groups are reused in thousands of sites in the existing network. If the PCI planning quality is poor, a series of problems will arise, reducing the performance of the mobile network. The main problems related to PCI are as follows:

[0084] PCI conflict: PCI conflict refers to the use of the same PCI between two adjacent cells. If two adjacent cells use the same PCI, in the overlapping coverage area of ​​the two cells, the terminal can only synchronize with one cell, and the downlink synchronization of the UE (User Equipment) in the overlapping coverage area will be delayed; causing a high block error rate, physical channel decoding failure, and switching failure.

[0085] PCI confusion: Two neighboring cells of a serving cell cannot use the same PCI. When the PCIs are the same, when the terminal switches out of the serving cell, it cannot identify the target cell, causing confusion.

[0086] PCI MOD3 interference: Since PCI is generated by PSS (Primary Synchronization Signal); there are only 3 PSS (0, 1, 2) recycled in the network; the "PCI mode 3" of the cell is equal, and its PSS is also equal. When MOD3 interference occurs, it will reduce the SINR (Signal to Interference plus Noise Ratio, which refers to the ratio of the strength of the received useful signal to the strength of the received interference signal (noise and interference), referred to as signal-to-noise ratio) value of the signal, causing the user experience rate to decrease. In a weak coverage environment, the occurrence of MOD3 interference problems will aggravate the rate experience and even cause users to drop the line. Since MOD3 interference has only 3 code numbers, it can only minimize the interference of the entire network and cannot eliminate it.

[0087] PCI MOD30 interference: DMRS and SRS (Sounding Reference Signal) on PUCCH (Physical Uplink Control Channel) / PUSCH (Physical Uplink Shared Channel) in 5G (NR) networks are generated based on ZC sequences; their roots are all related to PCI; if the PCI MOD30 between neighboring cells is the same, uplink interference will occur. Since there are fewer MOD30 locations, 4G has 16 groups, 5G has 33 groups, and the number of neighboring cells is at most hundreds, it is impossible to completely avoid the MOD30 problem between the source cell and the neighboring cell. The only way is to try to reduce it as much as possible and make the MOD30 reuse distance as large as possible to reduce the probability of uplink interference.

[0088] PCI reservation: To facilitate manual PCI planning, operators usually need to reserve a PCI segment, or use different PCI segments for different scenarios to reduce the probability of PCI conflicts and collisions during manual PCI planning.

[0089] PCI reuse frequency: The number of times each PCI is reused. Generally, within the planned PCI segment, the more balanced the number of times each PCI is reused, the higher the quality of PCI reuse. If some PCIs are reused more times, while some PCIs are reused less times, it means that PCI resource reuse is insufficient.

[0090] PCI reuse distance: Among all cells with the same PCI as cell A, the value with the shortest distance from cell A is the PCI reuse distance of cell A. That is, when the same PCI is used in different cells, the PCI reuse distances are different due to differences in surrounding PCI configurations.

[0091] PCI reuse layer number: Among all cells with the same PCI as cell A, the value with the smallest number of layers away from cell A is the PCI reuse layer number of cell A. That is, when the same PCI is used in different cells, the number of PCI reuse layers is different due to differences in surrounding PCI configurations.

[0092] AGPS MR aggregation algorithm: This is a method that uses Assisted Global Positioning System Measurement Report (AGPS MR) technology to extract important features from massive MR data through data processing and calculation to predict the coordinates and longitude of base stations, providing important support for LTE project planning. The algorithm first reads the historical MR data of the province in the past week from the operator's existing network data, extracts the MR containing AGPS data, removes the MR without reporting TA, and groups and aggregates the data by base station cell number. During the processing, considering the errors caused by the wireless environment, the DBSCAN algorithm is used for clustering processing to find one of the points as the MR point with accurate TA, and retain the AGPS and TA values ​​of the MR point. This method can accurately reflect the coverage of the network, and predict the coordinates and longitude of the base station by extracting important features, thereby providing important support for LTE project planning.

[0093] It can be understood that the PCI full network replanning method provided in the embodiment of the present invention can be applied to any computer device with data processing and computing capabilities, and this computer device can be various types of terminals or servers. When the computer device in the embodiment is a server, the server is an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms. Optionally, the terminal is a smart phone, tablet computer, laptop computer, desktop computer, etc., but is not limited to this.

[0094] like Figure 1 FIG. 1 is a schematic diagram of an implementation environment provided by an embodiment of the present invention. Figure 1 The implementation environment includes at least one terminal 102 and a server 101. The terminal 102 and the server 101 can be connected to a network wirelessly or wired to complete data transmission and exchange.

[0095] Server 101 can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers. It can also be a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN (Content Delivery Network), as well as big data and artificial intelligence platforms.

[0096] In addition, the server 101 can also be a node server in the blockchain network. Blockchain is a new application model of computer technologies such as distributed data storage, peer-to-peer transmission, consensus mechanism, and encryption algorithm.

[0097] The terminal 102 may be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, etc., but is not limited thereto. The terminal 102 and the server 101 may be directly or indirectly connected via wired or wireless communication, which is not limited in the embodiment of the present invention.

[0098] Based on the example Figure 1 In the implementation environment shown, an embodiment of the present invention provides a PCI full network replanning method. The following is explained using the PCI full network replanning method applied to the terminal 102 as an example. It can be understood that the PCI full network replanning method can also be applied to the server 101.

[0099] Reference Figure 2 , Figure 2 The flowchart of the PCI full network re-planning method applied to a terminal (for example, the terminal may be a DPU) provided in an embodiment of the present invention, the execution subject of the PCI full network re-planning method may be any of the aforementioned computer devices (including a server or a terminal). Figure 2 , the method comprises the following steps:

[0100] S100, obtaining basic information of the replanning area and its surrounding areas;

[0101] The basic information includes basic cell information, neighboring cell information, overlapping coverage information and PCI re-planning configuration information of each cell in the area;

[0102] For example, in some specific implementations, obtaining basic information includes basic information of cells in the replanning area and surrounding areas, neighboring area information, overlapping coverage information, reserved PCI group number requirements, and PCI requirements for setting based on scenario requirements, as follows:

[0103] (1) Basic information of the community:

[0104] The basic cell information includes the cell ID (4G: Enodebid_cellid, 5G: Gnodebid_cellid), cell name, cell longitude, cell latitude, cell PCI, scene (if the scene needs to be divided into segments, the scene needs to be indicated), replanning area identifier, and SSB frequency. The fields are explained as follows:

[0105] Cell ID: The 4G base station code is Enodebid, the 5G base station code is Gnodebid, and the cell code is cellid. Enodebid_cellid can uniquely identify a 4G cell, and Gnodebid_cellid can uniquely identify a 5G cell.

[0106] Community name: Usually a Chinese name is used, just to clearly describe a community and make it more readable.

[0107] Cell longitude and cell latitude: The longitude and latitude of the WGS 84 coordinate system must be used.

[0108] Cell PCI: The PCI currently configured in the cell. This PCI is used to check with the PCI configured in the neighboring cell to ensure that the PCI configured in the cell of the neighboring cell data is consistent with the PCI in the basic information.

[0109] Scenario: This field is used to identify the scenario configured for the cell. If you need to configure PCI segmentation by scenario, you need to identify the scenario to which each cell belongs in the basic information so that you can configure the PCI segmentation for the corresponding scenario in the configuration file.

[0110] Replanning area identification: Usually the PCI replanning area identification is a city, and the city name is used to distinguish the replanning area, but there are also cases where only a certain district or county of a city needs to be planned. If the planning area is a certain city or district, the replanning area identification is the city name or district name, but if the planning area is a custom area, you can customize a region name, such as "Replanning Area 1", etc., and the non-planning area can be left blank or filled in the city information interface to which the community belongs.

[0111] The basic information needs to include information within the re-planning area and the surrounding areas (usually prefecture-level cities). This ensures that the PCI configuration of surrounding prefecture-level cities can be considered in the subsequent planning process to prevent the problem of too small PCI reuse distance and number of reuse layers with the surrounding areas.

[0112] (2) Neighborhood information:

[0113] Source cell ID, source cell PCI, neighboring cell ID, neighboring cell PCI, number of handover requests, source cell SSB frequency, neighboring cell SSB frequency. The fields are explained as follows:

[0114] The numbering rules of the source cell ID and the neighboring cell ID are consistent with the numbering rules of the cell ID in (1) the cell basic information.

[0115] The source cell PCI and the neighbor cell PCI are the PCI of the source cell and the PCI of the neighbor cell respectively. The data is obtained from the network management configuration data. It is possible that the PCI of the same cell is different in different neighbor cell configurations or different from the PCI configured in the cell basic data.

[0116] Number of handover requests: The network management can count the number of handover requests from the source cell to the neighboring cell for each handover pair. There is a situation where the neighboring cell is configured but the number of handover requests is 0. Usually, this neighboring cell is a redundant neighboring cell and needs to be deleted from the existing network configuration before the PCI replanning begins.

[0117] Source cell frequency and neighboring cell frequency: these are the frequencies of the source cell and the neighboring cell respectively. Since all PCI problems occur between cells with the same frequency, if the source cell frequency is inconsistent with the neighboring cell frequency, the neighboring cell can be ignored and is not considered in the PCI replanning scope.

[0118] Neighborhood information needs to include neighborhood information within the replanning area and the surrounding areas (usually prefecture-level cities) of the replanning area. This ensures that the subsequent planning process can take into account the neighborhood configuration of surrounding cities and prevent PCI conflicts and PCI collisions with the surrounding areas.

[0119] (3) Overlapping information:

[0120] Since a handover request may not be sent when MOD3 interference and MOD30 interference occur, it needs to be extracted from the MR information. The MR information is a piece of measurement information reported by the mobile terminal at a fixed time interval (usually set to 10S) during use. The measurement information includes the frequency, PCI and RSRP of the main cell and the neighboring cell received by the terminal at this time. The network stores this information to form MR information. Usually, we collect MR information for the entire network for one week as the basis for judging the overlapping coverage information. When the difference between the main cell and the neighboring cell is within 6db, it is considered that the overlapping coverage from the main cell to the neighboring cell is recorded once. If the PCI MOD3 of the main neighboring cell is the same, the overlapping coverage is considered to be MOD3 interference. If the PCI MOD30 of the main neighboring cell is the same, the overlapping coverage is considered to be MOD30 interference. In this way, MOD3 interference and MOD30 interference can be digitized into the number of interferences through the overlapping coverage information. Reducing this number can significantly reduce the number of MOD3 and MOD30 interferences in the entire network. The overlapping coverage information field is different from the neighboring cell information by only one field, and the number of handover requests is replaced by the number of overlapping coverage.

[0121] The overlapping coverage times between the source cell and the neighboring cell are used to evaluate the MOD3 interference and MOD30 interference times in the current re-planning area. They can be used to evaluate whether the impact of each site on the MOD3 and MOD30 interference of the entire network becomes larger or smaller when planned as different PCIs during the PCI planning process, so as to select the optimal PCI solution.

[0122] (4) PCI re-planning configuration information:

[0123] PCI re-planning configuration information refers to the conditions that PCI needs to meet during the planning process, such as how many groups of PCIs need to be reserved for subsequent new sites, the minimum PCI reuse distance (the default setting is 2 kilometers), the minimum number of PCI reuse layers (the default setting is 30), the PCI segmentation rules for different scenarios (for example, special PCI segmentation is specified for indoor, outdoor, high-speed rail, and subway scenarios), and which frequency point to carry out PCI planning.

[0124] Among them, in some embodiments, before the step of preprocessing the basic information, the method may further include the following steps: performing error correction processing on the basic information.

[0125] Further, in some preferred implementations, error correction processing of basic information may include the following steps: performing a first error check and correction on the cell longitude and latitude recorded in the cell basic information of each cell; performing a second error check and correction on the PCI configuration of the same cell recorded in the cell basic information and the neighboring cell information; performing a third error check and correction on the neighboring cell relationship greater than a first preset distance recorded in the neighboring cell information; performing a fourth error check and correction on redundant data existing in the neighboring cell information and the cell basic information; sending a verification result to an administrator based on the results of the first error check and correction, the second error check and correction, the third error check and correction, and the fourth error check and correction; and then performing correction operations on the erroneous information in the verification result in response to the administrator's correction instruction.

[0126] In some optional implementations, a first check and error correction is performed on the cell longitude and latitude recorded in the cell basic information of each cell, which may include the following steps: based on a preset data attribute format, determining whether there are data attribute errors in the cell longitude and latitude recorded in the cell basic information of each cell; based on a preset positioning measurement convergence algorithm, determining whether there are recording errors in the cell longitude and latitude recorded in the cell basic information of the 4G cell; based on the neighboring cell information, using a neighboring cell association and correction algorithm to determine whether there are recording errors in the cell longitude and latitude recorded in the cell basic information of the 5G cell.

[0127] Among them, in some implementations, based on the neighboring cell information, a neighboring cell association and correction algorithm is used to determine whether there are recording errors in the cell longitude and latitude recorded in the cell basic information of the 5G cell, which may include the following steps: obtaining a first preset number of neighboring cells that are less than a second preset distance from the 5G cell, and sorting them out to obtain a cell list; determining whether there are neighboring cells in the cell list in the neighboring cell relationship of the 5G cell based on the neighboring cell information; when all neighboring cells in the cell list do not exist in the neighboring cell relationship, determining that there are recording errors in the cell longitude and latitude recorded in the cell basic information of the 5G cell.

[0128] For example, in some specific application scenarios, the first error check and correction, the second error check and correction, the third error check and correction, and the fourth error check and correction can be implemented as follows:

[0129] There are many common errors in the basic information, which will affect the PCI replanning process and make it impossible to find a PCI replanning solution suitable for the entire network. The main errors include errors in the longitude and latitude of the cell in the basic information, PCI configuration errors in the neighboring cell information or cell information, configuration of super-distant neighboring cells, redundant data in the neighboring cell data, and redundant data in the cell configuration information. Of course, there are few errors in the actual data provided, and the probability of simultaneous occurrence is small. The following judgment logic can be used to filter errors:

[0130] (1) Errors in longitude and latitude of a community: Due to human negligence, there may be errors in longitude and latitude of a community. For example, the longitude and latitude entered are not numbers, which makes them unrecognizable. This error can be determined through data attributes, and a modification prompt will be given. Errors in longitude and latitude digital records cannot be determined through field attributes, but they are useful for subsequent planning, marketing, and guidance. The algorithm for identifying longitude and latitude errors in a community is as follows:

[0131] For 4G cells, the AGPS MR convergence algorithm can be used to solve the longitude and latitude error problem. It is an existing mature algorithm and has been applied in the network management of telecommunications groups. I will not go into details here. Here, the main purpose is to identify 5G cell information errors. Since 5G does not have APGS-MR, algorithms similar to 4G cannot be applied. Here, an algorithm that combines and corrects with neighboring cells is used. The specific algorithm is as follows:

[0132] (1.1) Calculate the list Blist of the five nearest cells outside the 100-meter range around cell A. The 100-meter range is set here to exclude cells at the same site as the current cell. Usually, cells at the same site are in the neighboring cell relationship and cannot be used as a basis for distance judgment.

[0133] (1.2) Check whether there are any cells in Blist among the neighboring cells of cell A. If none of the cells in Blist are in the neighboring cell relationship, a prompt will be given and the longitude and latitude of cell A need to be manually checked. As long as one exists, it is considered that the longitude and latitude of the cell are normal.

[0134] (1.3) Repeat the above two steps, traverse all cell information, obtain the verification results of all cells in the planning area, and then manually verify and confirm to ensure that the cell latitude and longitude in the basic information are basically accurate.

[0135] (2) PCI configuration errors in neighboring cell information or cell information. Since a cell has only one correct PCI, if such errors are not screened out and corrected in advance, the new PCI solution will conflict with the wrong PCI, affecting network performance, especially in cross-city border scenarios, where similar problems are more likely to occur. The specific verification method is as follows:

[0136] First, read the PCI of each cell in the cell basic information as a comparison benchmark and perform the following comparison:

[0137] (2.1) Read the PCI of the source cell in the neighboring cell information for comparison. If the PCI of the source cell is different from the basic information, it is considered that the PCI configuration in the basic information is wrong, and a prompt is given. The PCI configured in the basic information of the cell is corrected to the PCI configured in the existing network.

[0138] (2.2) After completing (2.1), the actual PCI of each cell can be determined, and then the PCI in the neighboring cell can be read and compared with the actual PCI of the cell. If they are different, a prompt will be displayed, and the PCI configuration error in the neighboring cell of the existing network needs to be manually modified.

[0139] (3) Ultra-distant neighbor cells: Usually, the coverage of a cell is limited, and the distance between the cells that form a neighboring cell relationship with the cell is limited. An erroneous ultra-distant neighbor cell will have a very large impact on the subsequent PCI planning, making it impossible to find an effective PCI configuration solution. The ultra-distant neighbor cell screening method is to calculate the distance between each neighbor cell and the source cell. If the distance is greater than 10 km, it is considered an ultra-distant neighbor cell. It is necessary to manually check whether the neighbor cell configuration is reasonable. Inappropriate neighbor cells need to be deleted.

[0140] (4) Redundant data exists in neighboring cell data: Due to the continuous relocation and forced relocation of the existing network, zombie data exists in the existing network. If the zombie data is not cleaned up, it may conflict with the new PCI planning scheme, causing PCI conflicts and collisions, and causing network management alarm prompts, so it needs to be cleaned up in advance. The method for judging the redundancy of neighboring cell data is as follows:

[0141] (4.1) The source cell ID does not exist in the cell basic information. It may be that the new site is not included in the basic information management, or the data of the decommissioned site has not been deleted. Manual confirmation and cleanup are required.

[0142] (4.2) The neighboring cell ID does not exist in the cell basic information and the source cell. It is considered zombie data of the neighboring cell and needs to be manually deleted on the network management.

[0143] (5) Redundant data exists in the cell basic information: Check the total number of handover requests for each cell ID in the cell basic information. If it is 0, it is necessary to manually confirm whether the data is redundant. If so, delete it. If the new site has not been opened, it can be retained.

[0144] After the verification and manual confirmation of the above five parts, all problems with the basic information are clear, which can ensure the accuracy and completeness of the basic data required for PCI replanning and ensure that the subsequent PCI replanning process will not fail due to errors in basic information.

[0145] S200, preprocessing basic information to obtain target data;

[0146] It should be noted that the target data includes the PCI group, the physical location point corresponding to the cell PCI of each cell, the mutually exclusive relationship between the physical location points, the MOD3 interference table of each cell, the PCI group root list, the candidate PCI group list and the candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list; in some embodiments, the basic information is preprocessed to obtain the target data, which may include the following steps: grouping the cell PCIs of all cells and converting them to obtain PCI groups; wherein the cell PCI is determined based on the cell basic information, and the group number of the PCI group is determined based on the arrangement order of the cell PCI in the PCI group; based on the cell longitude and latitude of each cell, the cell PCI plan is converted into a physical location point; wherein the cell longitude and latitude are determined based on the cell basic information , the physical location point is associated with the cell PCIs of at least two co-frequency cells, and the physical location point corresponds to a PCI group; based on the neighboring cell information, the neighboring cell relationship table of each cell is traversed to obtain the PCI mutual exclusion relationship between the cells, and then the physical location point mutual exclusion relationship is constructed in combination with the cell PCI associated with the physical location point; based on the overlapping coverage information, the MOD3 interference times of each cell under different MOD allocations are obtained, and then the MOD3 interference table of each cell is obtained; based on the PCI groups within a third preset distance around the re-planning area and their corresponding physical location points, a PCI group root list is constructed; based on the physical location points, the mutual exclusion relationship of the physical location points and the PCI group root list, a candidate PCI group list and a candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list are constructed.

[0147] Exemplarily, in some specific implementations, constructing target data (including a PCI group, a physical location point corresponding to a cell PCI of each cell, a mutually exclusive relationship between physical location points, a MOD3 interference table for each cell, a PCI group root list, a candidate PCI group list, and a candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list; and other target data that may be applied, such as a mutually exclusive relationship between a PCI multiplexing distance and a multiplexing layer number of a physical location point) can be implemented as follows:

[0148] The basic information preprocessing process is the basis for establishing the data structure of the subsequent PCI replanning process. The subsequent PCI replanning is performed on the basis of the preprocessed data. The preprocessing information reads the basic information, neighboring area information, and overlapping coverage information of the specific frequency point according to the frequency point specified in the PCI replanning configuration information, and performs basic information preprocessing based on this information.

[0149] (1) PCI to PCI group:

[0150] The PCI group number is equal to PCI / 3 and rounded down, and is expressed by the formula PCI group = INT (PCI / 3).

[0151] Each PCI group contains three PCIs, MOD0\1\2 respectively. Then each group of PCI has 6 arrangements, which are:

[0152] pailie{0}=[0, 1, 2];

[0153] pailie{1}=[0,2,1];

[0154] pailie{2}=[1, 0, 2];

[0155] pailie{3}=[1, 2, 0];

[0156] pailie{4}=[2, 1, 0];

[0157] pailie{5}=[2, 0, 1];

[0158] The arrangement order of these six MOD3s is the search space for subsequent MOD3 interference optimization, and the subsequent MOD3 interference evaluation uses the number change as the index.

[0159] (2) Cell PCI planning is converted into physical location planning:

[0160] In the actual PCI planning process, the planning is carried out according to the base station. Usually, one base station has three co-frequency cells. There are also cases where one base station has more than three co-frequency cells due to capacity issues, so the cell PCI planning needs to be converted into the base station PCI planning. Three co-frequency cells correspond to one physical location number, and 3-6 cells correspond to two physical location numbers. The detailed process is as follows:

[0161] Assume that there are 5 cells at a longitude and latitude point (longitude 115.51109, latitude 38.89183), namely 198912_0, 198912_1, 198912_2, 198912_3, and 198912_4. Then the longitude and latitude point is finally planned as 2 positions, position 1: 115.51109_38.89183_1, position 2: 115.51109_38.89183_2, among which position 1 is associated with 3 cells, namely 198912_0, 198912_1, and 198912_2, and position 2 is associated with 2 cells, namely 198912_3 and 198912_4.

[0162] With reference to the above process, all cells are assigned to a unique physical location point, and the subsequent cell PCI re-planning process can be transformed into a physical location point planning process. Each point can plan a PCI group.

[0163] (3) Establishment of mutually exclusive relationship between physical location points:

[0164] It is generally believed that PCI conflict and PCI collision are the relationship between the source cell and the neighboring cell. As long as there is a neighboring cell relationship between two cells, or two cells exist in the neighboring cell of the same cell at the same time, then the two cells cannot have the same PCI, which is a mutually exclusive relationship. By traversing the neighboring cell relationship table, the PCI mutually exclusive relationship between all two cells can be obtained. Through step (2), this PCI planning process has changed the PCI planning process of the cell into the planning process of the PCI group of the longitude and latitude points. Due to the MOD3 interference optimization process, it is necessary to change the PCImod allocation of the cells in the same group. Every time it changes, it is necessary to detect whether new PCI conflicts and collisions will occur, which is very troublesome. In order to decouple the MOD3 interference optimization process from the PCI group planning process, we convert the mutually exclusive relationship between cells into a mutually exclusive relationship between physical location points. If the physical location points of two locations have a mutually exclusive relationship, then the two physical location points cannot be assigned the same PCI group. In this way, as long as all the physical location points with mutually exclusive relationships are finally assigned different PCI groups, the MOD3 interference optimization process can be achieved without generating new PCI conflicts and PCI collisions. The specific relationship establishment process is as follows:

[0165] In step (2), we have established the corresponding relationship between each cell and the physical location point. Then, the mutually exclusive relationship between cell 1 and cell 2 can be converted into the mutually exclusive relationship between physical location {cell 1} and physical location {cell 2} when cell 1 and cell 2 belong to different physical locations. By traversing the mutually exclusive relationships of all cells, the pairwise mutually exclusive relationships between physical locations can be obtained. Through the pairwise mutually exclusive relationships, the set of physical location points LIST_pengzhuang{A} with mutually exclusive relationships of each physical location point A can be obtained. As long as the PCI group assigned to the physical location point A is inconsistent with the PCI groups of all physical location points in LIST_pengzhuang{A}, PCI conflicts and collisions can be reset to zero. At the same time, changes in MOD3 allocation between cells within the PCI group assigned to the physical location point will not cause new PCI conflicts and collisions.

[0166] (4) The mutually exclusive relationship between the PCI reuse distance and the number of reuse layers at the physical location point is established:

[0167] Usually, during the PCI planning process, there will be a minimum constraint on the PCI reuse distance and the number of PCI reuse layers, such as the latest reuse distance of 3 kilometers and the number of reuse layers of 30 layers. Due to unreasonable configuration of neighboring cells of some cells, or too few configurations, if only PCI conflicts and PCI collisions are considered, the program will find a situation where PCI conflicts and collisions are zero, but the PCI reuse distance is very close. For this reason, it is necessary to establish a constraint relationship based on the number of PCI reuse layers and PCI reuse distance to ensure that PCI reuse meets the minimum reuse distance and number of reuse layers. The specific steps are as follows:

[0168] Traverse all physical locations within 10 kilometers around a single physical location point. As long as the reuse distance or the number of reuse layers is less than the set minimum reuse distance and the minimum number of reuse layers, the two physical locations are in a mutually exclusive relationship of PCI reuse distance and number of reuse layers. Traverse all physical locations to obtain the mutually exclusive relationship between the PCI reuse distance and the number of reuse layers of each physical location point. Through the mutually exclusive relationship between the two, the set of physical location points LIST_juli{A} with mutually exclusive relationships for each physical location point A is obtained. The PCI replanning plan satisfies that the PCI group assigned to physical location point A is inconsistent with the PCI groups of all physical location points in LISTC_juli{A}, and the minimum reuse distance and number of reuse layers constraints can be achieved.

[0169] (5) MOD3 relationship (i.e. MOD3 interference table) is established:

[0170] The MOD3 relationship is established through overlapping coverage information. Here, the combination of the PCI group of each physical location point is set to 0, that is, all are 0 / 1 / 2, and the initial MOD3 value of each cell is obtained. The MOD3 relationship is established based on the initial MOD3 value of each cell. Each cell has an overlapping coverage relationship table. Traversing each cell overlapping relationship table, the number of overlapping coverages of all neighboring cells of the source cell with PCI MOD0 is accumulated to be the number of MOD3 interferences when the MOD of the source cell assigned PCI is 0, mod3interfere{A_0}. Similarly, the number of MOD3 interferences when the MOD of the source cell assigned PCI is 1 or 2, mod3interfere{A_1} and mod3interfere{A_2}, can be obtained and recorded as the initial basis for subsequent MOD3 interference optimization.

[0171] At the same time, an overlapping coverage relationship table associated with cell A is established, that is, to record in which cells' neighboring relationships cell A has appeared. These cells form LIST_mod3{A}. When the PCI of cell A changes, the interference of the cells affected by cell A can be updated through LISTD{A}.

[0172] (6) PCI group root list establishment:

[0173] All sites within 10 kilometers around the re-planning area are included in the evaluation scope of the PCI group root sequence establishment. Because there are ultra-high sites with ultra-long-distance coverage and island sites in the existing network, if the distance to the periphery is set small, these sites may not be taken into account, resulting in the same PCI problem for adjacent long-distance sites. The same physical location points of the PCI group within 10 kilometers around the re-planning area each form a PCI group same physical location list, and 168 lists for 4G / 336 lists for 5G are established. The list is marked as waibulist{i} (where i is the PCI group number). For example:

[0174] The list of PCI group 1 consists of all physical locations around the replanning area where the PCI group root sequence is 1:

[0175] waibulist{1}=A1, A2, A3, A4, ..., An, the PCI groups of the physical locations A1, A2, A3, A4, ..., An are all 1.

[0176] This list is the basis for subsequent PCI group planning. As the planning process progresses, the number of physical locations in the list gradually increases until all physical locations are included in waibulist{i}, and the entire planning process ends.

[0177] (7) List of optional PCI groups for the cell to be planned (i.e., candidate PCI group list):

[0178] At the beginning of planning, the physical locations in the area to be planned do not have PCI groups, but the surrounding cells already have PCI groups. The physical locations in the area to be planned may have PCI conflicts, PCI collisions, non-compliance with the minimum reuse distance, and non-compliance with the minimum number of reuse layers. As long as there is a non-compliance, the physical location to be planned cannot select the PCI group of the surrounding physical location as its candidate PCI group. By checking the four types of relationships between each physical location to be planned and the physical location points outside the area, the candidate PCI group of each physical location to be planned can be obtained. This list ensures that the optional PCI groups of the physical location points to be planned all meet PCI conflicts and collisions of zero, and at the same time meet the minimum reuse distance and minimum number of reuse layers. Here, the list is established using LIST_chongtu established in step (2) and LIST_juli established in step (3). The specific steps are as follows:

[0179] Extract a physical location point A to be planned, extract LIST_chongtu{A} and LIST_juli{A} to match with the physical location points in waibulist{i}. If any physical location point in LIST_chongtu{A} or LIST_juli{A} exists in waibulist{i}, i is not included in the optional PCI group of the physical location point A to be planned. If not, i is included in the optional PCI group of the physical location point A to be planned. Traverse all optional PCI groups to get all optional PCI groups of physical location point A. These PCI groups form a list PCIKX{A} with A as the index. Traverse all physical locations to be planned to get the PCIKX of each physical location point to be planned. For example:

[0180] LIST_chongtu{A}=[A, A1, A2, A3, A4, A5];

[0181] LIST_juli{A}=[A, B1, B2, B3, B4, B5];

[0182] waibulist{i}=[C1, C2, C3, C4, B3];

[0183] waibulist{j}=[E1, E2, E3, E4, E5];

[0184] waibulist{k}=[D1, D2, D3, D4, D5];

[0185] Since there is no point in LIST_chongtu{A} or LIST_juli{A} in waibulist{j}, element j is added to LISTKX{A}. Similarly, if there is no point in LIST_chongtu{A} or LIST_juli{A} in waibulist{k}, element k is added to PCIKX{A}. However, there is element B3 in waibulist{i}, which belongs to LIST_juli{A}, so i cannot be added to PCIKX{A}. At the same time, according to the A scene in the basic information and the planning range of the PCI group of the scene, it is determined whether j and k are within the planning range. If j and k are both within the range, the final PCIKX{A} = [j, k].

[0186] (8) A list of physical location points of a PCI group can be selected (i.e., a list of candidate physical location points):

[0187] Extract a physical location point A to be planned, extract LIST_chongtu{A} and LIST_juli{A} to match with the physical location points in waibulist{i}. If any physical location point in LIST_chongtu{A} or LIST_juli{A} exists in waibulist{i}, i is not included in the optional PCI group of the physical location point A to be planned. If not, i is included in the optional PCI group of the physical location point A to be planned. Traverse all optional PCI groups to obtain all optional PCI groups of the physical location point A. The A groups corresponding to these PCI groups form the physical location point list DIANKX{i} to which each PCI group can be assigned. Traverse all physical locations to be planned to obtain DIANKX for each PCI group i. An example is shown below:

[0188] LIST_chongtu{A}=[A, A1, A2, A3, A4, A5];

[0189] LIST_juli{A}=[A, B1, B2, B3, B4, B5];

[0190] LIST_chongtu{B}=[B, D1, D2, D3, D4, D5];

[0191] LIST_juli{B}=[B, D5, D6, D7, D8, D9];

[0192] LIST_chongtu{C}=[C, E1, E2, E3, E4, E5];

[0193] LIST_juli{C}=[C, E5, E6, D7, E8, E9];

[0194] waibulist{i}=[C1, C2, C3, C4, B3];

[0195] Since point B3 in LISTC{A} exists in waibulist{i}, element A will not be added to PCIKX{i}. Since point B3 in LISTC{A} does not exist in waibulist{i}, element B will be added to DIANKX{i}. Similarly, since point B3 in LISTC{A} does not exist in waibulist{i}, element C will be added to DIANKX{i}. Finally, DIANKX{i}=[B,C].

[0196] S300: Perform PCI re-planning based on target data to obtain a PCI planning solution.

[0197] Among them, PCI re-planning includes PCI group planning and MOD3 interference optimization;

[0198] It should be noted that the target data includes the PCI group, the physical location point corresponding to the cell PCI of each cell, the MOD3 interference table of each cell, the PCI group root list, the candidate PCI group list and the candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list; in some embodiments, PCI re-planning is performed based on the target data to obtain a PCI planning scheme, which may include the following steps: performing MOD3 interference optimization based on the MOD3 interference table to obtain a target PCI combination corresponding to each physical location point; performing PCI group planning based on the PCI group root list, the candidate PCI group list and the candidate physical location point list to obtain a PCI group corresponding to each physical location point; obtaining a PCI planning scheme for each physical location point based on the PCI group corresponding to each physical location point and the target PCI combination.

[0199] Optionally, in some preferred implementations, performing MOD3 interference optimization based on the MOD3 interference table to obtain a target PCI combination corresponding to each physical location point may include the following steps: acquiring a physical location point from the replanning area as the target location point; obtaining the MOD3 interference value of the target location point under each PCI combination based on the MOD3 interference table, and then determining the minimum interference value corresponding to the target location point and its corresponding pre-selected combination; subtracting the minimum interference value from the MOD3 interference value of the preset PCI combination to obtain a difference; when the difference is equal to the preset single optimization maximum value, determining the target PCI combination corresponding to the target location point as the pre-selected combination; otherwise , taking the difference as the single optimization maximum value corresponding to the target location point, taking the target location point as the physical location point to be optimized, and taking the pre-selected combination as the optimal combination; taking the next location of the target location point in the replanning area as the target location point; wherein the single optimization maximum value corresponding to each physical location point is initially 0; updating the MOD3 interference values ​​of the three cells corresponding to the physical location point to be optimized based on the overlapping coverage number determined by the MOD3 interference table; returning to execute the step of obtaining the MOD3 interference value of the target location point under each PCI combination based on the MOD3 interference table, until all physical location points in the replanning area complete the MOD3 interference optimization.

[0200] For example, in some specific embodiments, Figure 3 As shown, the MOD3 optimal exploration can be achieved as follows:

[0201] First, each position has 6 combinations. If all combinations are traversed, the number of combinations will reach 6 times the number of physical positions. There are 1000 physical positions, which is 6 times 1000. This is an astronomical number and it is impossible to traverse all combinations. Here, a genetic algorithm is used to solve this problem. The specific steps are as follows:

[0202] Step 1: Set a single optimization maximum value MAX to 0, the physical location to be optimized is A_bak, and the optimal combination is B_zu;

[0203] Step 2: Extract a physical location point A, traverse the six combinations of the physical location point A, and calculate the MOD3 interference value caused by each combination. Here, the three cells at point A are represented by A1\A2\A3 respectively. Using the mod3interfere table of basic data preprocessing (5), the MOD3 interference value of each combination can be obtained as follows: 0 / 1 / 2, 0 / 2 / 1, 1 / 0 / 2, 1 / 2 / 0, 2 / 1 / 0, 2 / 0 / 1;

[0204] MOD3{combination 0}=mod3interfere{A1_0}+mod3interfere{A2_1}+mod3interfere{A3_2};

[0205] MOD3{combination 1}=mod3interfere{A1_0}+mod3interfere{A2_2}+mod3interfere{A3_1};

[0206] MOD3{combination 2}=mod3interfere{A1_1}+mod3interfere{A2_0}+mod3interfere{A3_2};

[0207] MOD3{combination 3}=mod3interfere{A1_1}+mod3interfere{A2_2}+mod3interfere{A3_0};

[0208] MOD3{combination 4}=mod3interfere{A1_2}+mod3interfere{A2_1}+mod3interfere{A3_0};

[0209] MOD3{combination 5}=mod3interfere{A1_2}+mod3interfere{A2_0}+mod3interfere{A3_1};

[0210] Find the minimum interference value MIN of the above 6 combinations and combination X, and calculate the difference with MOD3{combination 0}. If the difference is greater than MAX, assign the value to MAX, assign A to A_bak, and assign combination X to B_zu;

[0211] Continue to extract the next location point and repeat the second step until all physical location points are traversed and enter the third step;

[0212] Step 3: If the output MAX in the second step is 0, it means that the optimal solution has been found and the MOD3 optimal exploration ends. If it is not 0, the PCI combination scheme of A_bak is set to B_zu and the next step is to update the mod3interfere table.

[0213] Step 4: Update the mod3interfere table. Since the combination scheme of A_bak has changed, A_bak contains three cells A_bak_1, A_bak_2, and A_bak_3. The mod3interfere values ​​of the cells recorded in the LISTD corresponding to these three cells need to be updated. First, the MOD3 interference value caused by the original PCI combination scheme must be subtracted, and then the MOD3 interference value caused by the new scheme must be added. The operation process of the three cells is the same. The following takes A_bak_1 as an example to illustrate the operation process as follows:

[0214] Sequentially extract the cells of LIST_mod3{A_bak_1}, represented by AA here, mod3interfere{AA_(original mod3 value of A_bak_1) minus the overlapped coverage of AA and A_bak_1, mod3interfere{AA_(new mod3 value of A_bak_1) plus the overlapped coverage of AA and A_bak_1. After the update, set MAX to 0, set A_bak and B_zu to be empty for the physical location point to be optimized, and repeat the second step.

[0215] After completing the above steps, the best combination of each physical location point is determined. After the PCI group of the subsequent physical location point is determined, the PCI group + combination can uniquely confirm the specific PCI value of each cell at the physical location point. Next, turn to PCI group planning.

[0216] Optionally, in some preferred implementations, PCI group planning is performed based on a PCI group root list, a candidate PCI group list, and a candidate physical location point list to obtain a PCI group corresponding to each physical location point, which may include the following steps: extracting a physical location point with the least elements from the candidate PCI group list as a pre-planned location point; obtaining a candidate physical location point list corresponding to each candidate PCI group in the candidate PCI group list corresponding to the pre-planned location point, and then traversing each physical location point in the candidate physical location point list to determine the number of influence of physical location points in the candidate physical location point list that contain the pre-planned location point; determining an influence ratio of each candidate PCI group based on the influence ratio, and sorting the candidate PCI groups in ascending order of the influence ratio to obtain a first PCI group sequence; obtaining a second preset number of candidate PCI groups in the first PCI group sequence as the first candidate PCI group, and obtaining the maximum number of all physical location points in the PCI group root list corresponding to the pre-planned location point and each first candidate PCI group. Small distance, take the minimum distance as the reuse distance; sort all first candidate PCI groups in descending order according to the reuse distance to obtain a second PCI group sequence; obtain the first candidate PCI group with a first preset ratio of the preceding order from the second PCI group sequence as the second candidate PCI group, and evaluate and obtain the MOD30 minimum reuse distance of each second candidate PCI group; sort all second candidate PCI groups in descending order according to the MOD30 minimum reuse distance to obtain a third PCI group sequence; obtain the second candidate PCI group with a second preset ratio of the preceding order from the third PCI group sequence as the third candidate PCI group, and evaluate and obtain the number of times each third candidate PCI group is used in the replanning area; use the third candidate PCI group with the least number of uses as the PCI group corresponding to the pre-planned location point; return to execute the step of extracting the physical location point with the least elements from the candidate PCI group list as the pre-planned location point until all physical location points in the candidate PCI group list have completed PCI group planning.

[0217] For example, in some specific embodiments, Figure 4 As shown, PCI group planning can be implemented as follows:

[0218] PCI group planning needs to simultaneously resolve PCI conflicts, zero collisions, maximize PCI reuse distance, balance reuse times, and maximize MOD30 reuse distance and reuse layer number. This process is a best-effort process to explore the optimal value. The specific steps are as follows:

[0219] Step 1: Evaluate the PCIKX table of each physical location point to be planned, and select the physical location point with the least elements as the next physical location point to be planned, which is represented by A_MIN here.

[0220] Step 2: Evaluate the DIANKX{PCI_TMP} list of each optional PCI group (here represented by PCI_TMP) in PCIKX{A_MIN}. If A_MIN selects PCI_TMP, then the number of points in the DIANKX{PCI_TMP} list to be reduced should be set to zero at the beginning. The specific process is: traverse each physical location point DIAN_TMP in DIANKX{PCI_TMP}. As long as it is in the LIST_juli{DIAN_TMP} or LIST_chongtu{DIAN_TMP} list with A_MIN, the impact quantity should be increased by 1 until the points in DIANKX{PCI_TMP} are traversed. The impact quantity is obtained, and this value is divided by the number of elements in DIANKX{PCI_TMP} to obtain the effect of A_MIN on PCI_TMP. Traverse to obtain the information of each optional PCI group in PCIKX{A_MIN}, and sort them in ascending order according to the influence ratio. The PCI group with the smallest influence ratio is placed in front, and the PCI group with the smallest influence on the subsequent planning can be selected first.

[0221] Step 3: Evaluate the PCI groups in the first N (N is usually 50) positions of PCIKX{A_MIN} after the sorting in step 2. If the number of PCI groups is less than N, all groups in PCIKX{A_MIN} need to be evaluated. Calculate the minimum distance between A_MIN and all points in the waibulist of each optional PCI group, which is the PCI reuse distance of A_MIN relative to the optional PCI group. Sort the PCI groups from large to small according to their PCI reuse distances, and give priority to those with large PCI reuse distances.

[0222] Step 4: Extract the top x% (usually 60% here) of the PCI group list list_part1 sorted in step 2, evaluate the MOD30 minimum reuse distance of each PCI group, and sort list_part1 from large to small according to the MOD30 minimum reuse distance of the PCI group.

[0223] Step 5: Extract the top x% (usually 60%) of the PCI group list list_part2 in list_part1, evaluate the number of times each PCI group is used in the area to be planned, and select the PCI group with the least number of uses. If the number of uses is the same, select the PCI group with the highest ranking to obtain the PCI group determined by A_MIN.

[0224] Step 6: Based on the PCI group determined by A_MIN, here it is marked with PCI_queding, and the affected lists are updated, mainly including: 1) Waibulist{PCI_queding}, that is, A_MIN is added to the waibulist{PCI_queding} list. 2) Physical locations that have LIST_chongtu or LIST_juli with A_MIN are deleted from DIANKX{PCI_queding}. 3) PCI_queding is deleted from PCIKX of the physical location deleted in 2).

[0225] Step 7: Check whether all the points to be planned have been planned. If not, repeat Step 1. If so, end the PCI group planning.

[0226] In order to explain the principle of the technical solution of the present invention in detail, the overall process of the present invention is described below in combination with some specific embodiments. It is easy to understand that the following is an explanation of the technical principle of the present invention and cannot be regarded as a limitation of the present invention.

[0227] First of all, it should be noted that since three consecutive PCIs are usually used as a group of PCIs when PCI is allocated, and the optimization of MOD3 interference is usually optimized by replacing the cells corresponding to the same group of PCIs, it is easy for the MOD3 interference to be improved after PCI optimization, but new PCI conflicts and PCI collisions will arise. This leads to a long PCI optimization time for each site. For large networks, it is difficult to eliminate PCI conflicts and PCI collisions. At the same time, the optimization of MOD30 and MOD3 interference is also constrained.

[0228] When using the current single-cell planning or the current tool to plan PCI, people usually only pay attention to the usage of PCIs in the surrounding area, but not the usage of PCIs in the entire network. As a result, some PCIs are reused too many times, while some PCIs are used less frequently. This leads to unbalanced PCI reuse times and ineffective use of PCI resources.

[0229] Although there is a PCI reservation strategy in the PCI planning principles at the prefecture level, the reserved PCIs are gradually exhausted over time. At the same time, the PCI segments reserved by different operators are also inconsistent. A PCI segment reserved by one operator has been widely used by a shared operator, causing the original reservation strategy to become invalid. It is necessary to uniformly re-plan the PCI for the shared network architecture, and reserve PCI resources recognized by both parties during the re-planning to facilitate the subsequent site access to the network.

[0230] Based on the above problems, a PCI replanning algorithm suitable for 4G / 5G networks is needed to solve the PCI conflicts, PCI collisions, optimize MOD3 and MOD30 problems of the entire city network at one time, realize PCI reservation, and PCI multiplexing balance. It can solve the problems existing in the current network and reserve sufficient PCI resources for the subsequent new stations to join the network.

[0231] In view of this, the present invention provides a technical solution for PCI full network replanning. The present invention mainly realizes a PCI replanning applicable to 4G and 5G networks, which can solve the PCI conflict and PCI collision of the whole network at one time, improve the reuse distance and the number of reuse layers, and optimize MOD3 and MOD30. At the same time, PCI reservation, PCI setting by scene and segment (optional), and balanced PCI reuse frequency are realized, and PCI resource utilization is improved, and finally the purpose of optimizing mobile network performance and improving mobile network quality is achieved. It provides an effective and executable method for the subsequent PCI replanning of the back-end of the shared network merger of the telecom network.

[0232] The present invention adopts the following technical solutions to achieve the above-mentioned purpose:

[0233] The present invention is mainly completed through four processes: basic collection, basic information error correction, basic information preprocessing, and PCI replanning, which are specifically introduced as follows:

[0234] 1. Basic information collection:

[0235] Obtaining basic information includes basic information of cells in the replanning area and surrounding areas, neighboring cell information, overlapping coverage information, reserved PCI group number requirements, and PCI requirements for scenario-based requirements, as follows:

[0236] (1) Basic information of the community:

[0237] The basic cell information includes the cell ID (4G: Enodebid_cellid, 5G: Gnodebid_cellid), cell name, cell longitude, cell latitude, cell PCI, scene (if the scene needs to be divided into segments, the scene needs to be indicated), replanning area identifier, and SSB frequency. The fields are explained as follows:

[0238] Cell ID: The 4G base station code is Enodebid, the 5G base station code is Gnodebid, and the cell code is cellid. Enodebid_cellid can uniquely identify a 4G cell, and Gnodebid_cellid can uniquely identify a 5G cell.

[0239] Community name: Usually a Chinese name is used, just to clearly describe a community and make it more readable.

[0240] Cell longitude and cell latitude: The longitude and latitude of the WGS 84 coordinate system must be used.

[0241] Cell PCI: The PCI currently configured in the cell. This PCI is used to check with the PCI configured in the neighboring cell to ensure that the PCI configured in the cell of the neighboring cell data is consistent with the PCI in the basic information.

[0242] Scenario: This field is used to identify the scenario configured for the cell. If you need to configure PCI segmentation by scenario, you need to identify the scenario to which each cell belongs in the basic information so that you can configure the PCI segmentation for the corresponding scenario in the configuration file.

[0243] Replanning area identification: Usually the PCI replanning area identification is a city, and the city name is used to distinguish the replanning area, but there are also cases where only a certain district or county of a city needs to be planned. If the planning area is a certain city or district, the replanning area identification is the city name or district name, but if the planning area is a custom area, you can customize a region name, such as "Replanning Area 1", etc., and the non-planning area can be left blank or filled in the city information interface to which the community belongs.

[0244] The basic information needs to include information within the re-planning area and the surrounding areas (usually prefecture-level cities). This ensures that the PCI configuration of surrounding prefecture-level cities can be considered in the subsequent planning process to prevent the problem of too small PCI reuse distance and number of reuse layers with the surrounding areas.

[0245] (2) Neighborhood information:

[0246] Source cell ID, source cell PCI, neighboring cell ID, neighboring cell PCI, number of handover requests, source cell SSB frequency, neighboring cell SSB frequency. The fields are explained as follows:

[0247] The numbering rules of the source cell ID and the neighboring cell ID are consistent with the numbering rules of the cell ID in (1) the cell basic information.

[0248] The source cell PCI and the neighbor cell PCI are the PCI of the source cell and the PCI of the neighbor cell respectively. The data is obtained from the network management configuration data. It is possible that the PCI of the same cell is different in different neighbor cell configurations or different from the PCI configured in the cell basic data.

[0249] Number of handover requests: The network management can count the number of handover requests from the source cell to the neighboring cell for each handover pair. There is a situation where the neighboring cell is configured but the number of handover requests is 0. Usually, this neighboring cell is a redundant neighboring cell and needs to be deleted from the existing network configuration before the PCI replanning begins.

[0250] Source cell frequency and neighboring cell frequency: these are the frequencies of the source cell and the neighboring cell respectively. Since all PCI problems occur between cells with the same frequency, if the source cell frequency is inconsistent with the neighboring cell frequency, the neighboring cell can be ignored and is not considered in the PCI replanning scope.

[0251] Neighborhood information needs to include neighborhood information within the replanning area and the surrounding areas (usually prefecture-level cities) of the replanning area. This ensures that the subsequent planning process can take into account the neighborhood configuration of surrounding cities and prevent PCI conflicts and PCI collisions with the surrounding areas.

[0252] (3) Overlapping information:

[0253] Since a handover request may not be sent when MOD3 interference and MOD30 interference occur, it needs to be extracted from the MR information. The MR information is a piece of measurement information reported by the mobile terminal at a fixed time interval (usually set to 10S) during use. The measurement information includes the frequency, PCI and RSRP of the main cell and the neighboring cell received by the terminal at this time. The network stores this information to form MR information. Usually, we collect MR information for the entire network for one week as the basis for judging the overlapping coverage information. When the difference between the main cell and the neighboring cell is within 6db, it is considered that the overlapping coverage from the main cell to the neighboring cell is recorded once. If the PCI MOD3 of the main neighboring cell is the same, the overlapping coverage is considered to be MOD3 interference. If the PCI MOD30 of the main neighboring cell is the same, the overlapping coverage is considered to be MOD30 interference. In this way, MOD3 interference and MOD30 interference can be digitized into the number of interferences through the overlapping coverage information. Reducing this number can significantly reduce the number of MOD3 and MOD30 interferences in the entire network. The overlapping coverage information field is different from the neighboring cell information by only one field, and the number of handover requests is replaced by the number of overlapping coverage.

[0254] The overlapping coverage times between the source cell and the neighboring cell are used to evaluate the MOD3 interference and MOD30 interference times in the current re-planning area. They can be used to evaluate whether the impact of each site on the MOD3 and MOD30 interference of the entire network becomes larger or smaller when planned as different PCIs during the PCI planning process, so as to select the optimal PCI solution.

[0255] (4) PCI re-planning configuration information:

[0256] PCI re-planning configuration information refers to the conditions that PCI needs to meet during the planning process, such as how many groups of PCIs need to be reserved for subsequent new sites, the minimum PCI reuse distance (the default setting is 2 kilometers), the minimum number of PCI reuse layers (the default setting is 30), the PCI segmentation rules for different scenarios (for example, special PCI segmentation is specified for indoor, outdoor, high-speed rail, and subway scenarios), and which frequency point to carry out PCI planning.

[0257] 2. Basic information correction:

[0258] There are many common errors in the basic information, which will affect the PCI replanning process and make it impossible to find a PCI replanning solution suitable for the entire network. The main errors include errors in the longitude and latitude of the cell in the basic information, PCI configuration errors in the neighboring cell information or cell information, configuration of super-distant neighboring cells, redundant data in the neighboring cell data, and redundant data in the cell configuration information. Of course, there are few errors in the actual data provided, and the probability of simultaneous occurrence is small. The following judgment logic can be used to filter errors:

[0259] (1) Errors in longitude and latitude of a community: Due to human negligence, there may be errors in longitude and latitude of a community. For example, the longitude and latitude entered are not numbers, which makes them unrecognizable. This error can be determined through data attributes, and a modification prompt will be given. Errors in longitude and latitude digital records cannot be determined through field attributes, but they are useful for subsequent planning, marketing, and guidance. The algorithm for identifying longitude and latitude errors in a community is as follows:

[0260] For 4G cells, the AGPS MR convergence algorithm can be used to solve the longitude and latitude error problem. It is an existing mature algorithm and has been applied in the network management of telecommunications groups. I will not go into details here. Here, the main purpose is to identify 5G cell information errors. Since 5G does not have APGS-MR, algorithms similar to 4G cannot be applied. Here, an algorithm that combines and corrects with neighboring cells is used. The specific algorithm is as follows:

[0261] (1.1) Calculate the list Blist of the five nearest cells outside the 100-meter range around cell A. The 100-meter range is set here to exclude cells at the same site as the current cell. Usually, cells at the same site are in the neighboring cell relationship and cannot be used as a basis for distance judgment.

[0262] (1.2) Check whether there are any cells in Blist among the neighboring cells of cell A. If none of the cells in Blist are in the neighboring cell relationship, a prompt will be given and the longitude and latitude of cell A need to be manually checked. As long as one exists, it is considered that the longitude and latitude of the cell are normal.

[0263] (1.3) Repeat the above two steps, traverse all cell information, obtain the verification results of all cells in the planning area, and then manually verify and confirm to ensure that the cell latitude and longitude in the basic information are basically accurate.

[0264] (2) PCI configuration errors in neighboring cell information or cell information. Since a cell has only one correct PCI, if such errors are not screened out and corrected in advance, the new PCI solution will conflict with the wrong PCI, affecting network performance, especially in cross-city border scenarios, where similar problems are more likely to occur. The specific verification method is as follows:

[0265] First, read the PCI of each cell in the cell basic information as a comparison benchmark and perform the following comparison:

[0266] (2.1) Read the PCI of the source cell in the neighboring cell information for comparison. If the PCI of the source cell is different from the basic information, it is considered that the PCI configuration in the basic information is wrong, and a prompt is given. The PCI configured in the basic information of the cell is corrected to the PCI configured in the existing network.

[0267] (2.2) After completing (2.1), the actual PCI of each cell can be determined, and then the PCI in the neighboring cell can be read and compared with the actual PCI of the cell. If they are different, a prompt will be displayed, and the PCI configuration error in the neighboring cell of the existing network needs to be manually modified.

[0268] (3) Ultra-distant neighbor cells: Usually, the coverage of a cell is limited, and the distance between the cells that form a neighboring cell relationship with the cell is limited. An erroneous ultra-distant neighbor cell will have a very large impact on the subsequent PCI planning, making it impossible to find an effective PCI configuration solution. The ultra-distant neighbor cell screening method is to calculate the distance between each neighbor cell and the source cell. If the distance is greater than 10 km, it is considered an ultra-distant neighbor cell. It is necessary to manually check whether the neighbor cell configuration is reasonable. Inappropriate neighbor cells need to be deleted.

[0269] (4) Redundant data exists in neighboring cell data: Due to the continuous relocation and forced relocation of the existing network, zombie data exists in the existing network. If the zombie data is not cleaned up, it may conflict with the new PCI planning scheme, causing PCI conflicts and collisions, and causing network management alarm prompts, so it needs to be cleaned up in advance. The method for judging the redundancy of neighboring cell data is as follows:

[0270] (4.1) The source cell ID does not exist in the cell basic information. It may be that the new site is not included in the basic information management, or the data of the decommissioned site has not been deleted. Manual confirmation and cleanup are required.

[0271] (4.2) The neighboring cell ID does not exist in the cell basic information and the source cell. It is considered zombie data of the neighboring cell and needs to be manually deleted on the network management.

[0272] (5) Redundant data exists in the cell basic information: Check the total number of handover requests for each cell ID in the cell basic information. If it is 0, it is necessary to manually confirm whether the data is redundant. If so, delete it. If the new site has not been opened, it can be retained.

[0273] After the verification and manual confirmation of the above five parts, all problems with the basic information are clear, which can ensure the accuracy and completeness of the basic data required for PCI replanning and ensure that the subsequent PCI replanning process will not fail due to errors in basic information.

[0274] 3. Basic information preprocessing:

[0275] The basic information preprocessing process is the basis for establishing the data structure of the subsequent PCI replanning process. The subsequent PCI replanning is performed on the basis of the preprocessed data. The preprocessing information reads the basic information, neighboring area information, and overlapping coverage information of the specific frequency point according to the frequency point specified in the PCI replanning configuration information, and performs basic information preprocessing based on this information.

[0276] (1) PCI to PCI group:

[0277] The PCI group number is equal to PCI / 3 and rounded down, and is expressed by the formula PCI group = INT (PCI / 3).

[0278] Each PCI group contains three PCIs, MOD0\1\2 respectively. Then each group of PCI has 6 arrangements, which are:

[0279] pailie{0}=[0, 1, 2];

[0280] pailie{1}=[0,2,1];

[0281] pailie{2}=[1, 0, 2];

[0282] pailie{3}=[1, 2, 0];

[0283] pailie{4}=[2, 1, 0];

[0284] pailie{5}=[2, 0, 1];

[0285] The arrangement order of these six MOD3s is the search space for subsequent MOD3 interference optimization, and the subsequent MOD3 interference evaluation uses the number change as the index.

[0286] (2) Cell PCI planning is converted into physical location planning:

[0287] In the actual PCI planning process, the planning is carried out according to the base station. Usually, one base station has three co-frequency cells. There are also cases where one base station has more than three co-frequency cells due to capacity issues, so the cell PCI planning needs to be converted into the base station PCI planning. Three co-frequency cells correspond to one physical location number, and 3-6 cells correspond to two physical location numbers. The detailed process is as follows:

[0288] Assume that there are 5 cells at a longitude and latitude point (longitude 115.51109, latitude 38.89183), namely 198912_0, 198912_1, 198912_2, 198912_3, and 198912_4. Then the longitude and latitude point is finally planned as 2 positions, position 1: 115.51109_38.89183_1, position 2: 115.51109_38.89183_2, among which position 1 is associated with 3 cells, namely 198912_0, 198912_1, and 198912_2, and position 2 is associated with 2 cells, namely 198912_3 and 198912_4.

[0289] With reference to the above process, all cells are assigned to a unique physical location point, and the subsequent cell PCI re-planning process can be transformed into a physical location point planning process. Each point can plan a PCI group.

[0290] (3) Establishment of mutually exclusive relationship between physical location points:

[0291] It is generally believed that PCI conflict and PCI collision are the relationship between the source cell and the neighboring cell. As long as there is a neighboring cell relationship between two cells, or two cells exist in the neighboring cell of the same cell at the same time, then the two cells cannot have the same PCI, which is a mutually exclusive relationship. By traversing the neighboring cell relationship table, the PCI mutually exclusive relationship between all two cells can be obtained. Through step (2), this PCI planning process has changed the PCI planning process of the cell into the planning process of the PCI group of the longitude and latitude points. Due to the MOD3 interference optimization process, it is necessary to change the PCImod allocation of the cells in the same group. Every time it changes, it is necessary to detect whether new PCI conflicts and collisions will occur, which is very troublesome. In order to decouple the MOD3 interference optimization process from the PCI group planning process, we convert the mutually exclusive relationship between cells into a mutually exclusive relationship between physical location points. If the physical location points of two locations have a mutually exclusive relationship, then the two physical location points cannot be assigned the same PCI group. In this way, as long as all the physical location points with mutually exclusive relationships are finally assigned different PCI groups, the MOD3 interference optimization process can be achieved without generating new PCI conflicts and PCI collisions. The specific relationship establishment process is as follows:

[0292] In step (2), we have established the corresponding relationship between each cell and the physical location point. Then, the mutually exclusive relationship between cell 1 and cell 2 can be converted into the mutually exclusive relationship between physical location {cell 1} and physical location {cell 2} when cell 1 and cell 2 belong to different physical locations. By traversing the mutually exclusive relationships of all cells, the pairwise mutually exclusive relationships between physical locations can be obtained. Through the pairwise mutually exclusive relationships, the set of physical location points LIST_pengzhuang{A} with mutually exclusive relationships of each physical location point A can be obtained. As long as the PCI group assigned to the physical location point A is inconsistent with the PCI groups of all physical location points in LIST_pengzhuang{A}, PCI conflicts and collisions can be reset to zero. At the same time, changes in MOD3 allocation between cells within the PCI group assigned to the physical location point will not cause new PCI conflicts and collisions.

[0293] (4) Establishment of mutually exclusive relationship between PCI reuse distance and multiplexing layer number at physical location

[0294] Usually, during the PCI planning process, there will be a minimum constraint on the PCI reuse distance and the number of PCI reuse layers, such as the latest reuse distance of 3 kilometers and the number of reuse layers of 30 layers. Due to unreasonable configuration of neighboring cells of some cells, or too few configurations, if only PCI conflicts and PCI collisions are considered, the program will find a situation where PCI conflicts and collisions are zero, but the PCI reuse distance is very close. For this reason, it is necessary to establish a constraint relationship based on the number of PCI reuse layers and PCI reuse distance to ensure that PCI reuse meets the minimum reuse distance and number of reuse layers. The specific steps are as follows:

[0295] Traverse all physical locations within 10 kilometers around a single physical location point. As long as the reuse distance or the number of reuse layers is less than the set minimum reuse distance and the minimum number of reuse layers, the two physical locations are in a mutually exclusive relationship of PCI reuse distance and number of reuse layers. Traverse all physical locations to obtain the mutually exclusive relationship between the PCI reuse distance and the number of reuse layers of each physical location point. Through the mutually exclusive relationship between the two, the set of physical location points LIST_juli{A} with mutually exclusive relationships for each physical location point A is obtained. The PCI replanning plan satisfies that the PCI group assigned to physical location point A is inconsistent with the PCI groups of all physical location points in LISTC_juli{A}, and the minimum reuse distance and number of reuse layers constraints can be achieved.

[0296] (5) MOD3 relationship establishment:

[0297] The MOD3 relationship is established through overlapping coverage information. Here, the combination of the PCI group of each physical location point is set to 0, that is, all are 0 / 1 / 2, and the initial MOD3 value of each cell is obtained. The MOD3 relationship is established based on the initial MOD3 value of each cell. Each cell has an overlapping coverage relationship table. Traversing each cell overlapping relationship table, the number of overlapping coverages of all neighboring cells of the source cell with PCI MOD0 is accumulated to be the number of MOD3 interferences when the MOD of the source cell assigned PCI is 0, mod3interfere{A_0}. Similarly, the number of MOD3 interferences when the MOD of the source cell assigned PCI is 1 or 2, mod3interfere{A_1} and mod3interfere{A_2}, can be obtained and recorded as the initial basis for subsequent MOD3 interference optimization.

[0298] At the same time, an overlapping coverage relationship table associated with cell A is established, that is, to record in which cells' neighboring relationships cell A has appeared. These cells form LIST_mod3{A}. When the PCI of cell A changes, the interference of the cells affected by cell A can be updated through LISTD{A}.

[0299] (6) PCI group root list establishment:

[0300] All sites within 10 kilometers around the re-planning area are included in the evaluation scope of the PCI group root sequence establishment. Because there are ultra-high sites with ultra-long-distance coverage and island sites in the existing network, if the distance to the periphery is set small, these sites may not be taken into account, resulting in the same PCI problem for adjacent long-distance sites. The same physical location points of the PCI group within 10 kilometers around the re-planning area each form a PCI group same physical location list, and 168 lists for 4G / 336 lists for 5G are established. The list is marked as waibulist{i} (where i is the PCI group number). For example:

[0301] The list of PCI group 1 consists of all physical locations around the replanning area where the PCI group root sequence is 1:

[0302] waibulist{1}=A1, A2, A3, A4, ..., An, the PCI groups of the physical locations A1, A2, A3, A4, ..., An are all 1.

[0303] This list is the basis for subsequent PCI group planning. As the planning process progresses, the number of physical locations in the list gradually increases until all physical locations are included in waibulist{i}, and the entire planning process ends.

[0304] (7) List of optional PCI groups for the cell to be planned:

[0305] At the beginning of planning, the physical locations in the area to be planned do not have PCI groups, but the surrounding cells already have PCI groups. The physical locations in the area to be planned may have PCI conflicts, PCI collisions, non-compliance with the minimum reuse distance, and non-compliance with the minimum number of reuse layers. As long as there is a non-compliance, the physical location to be planned cannot select the PCI group of the surrounding physical location as its candidate PCI group. By checking the four types of relationships between each physical location to be planned and the physical location points outside the area, the candidate PCI group of each physical location to be planned can be obtained. This list ensures that the optional PCI groups of the physical location points to be planned all meet PCI conflicts and collisions of zero, and at the same time meet the minimum reuse distance and minimum number of reuse layers. Here, the list is established using LIST_chongtu established in step (2) and LIST_juli established in step (3). The specific steps are as follows:

[0306] Extract a physical location point A to be planned, extract LIST_chongtu{A} and LIST_juli{A} to match with the physical location points in waibulist{i}. If any physical location point in LIST_chongtu{A} or LIST_juli{A} exists in waibulist{i}, i is not included in the optional PCI group of the physical location point A to be planned. If not, i is included in the optional PCI group of the physical location point A to be planned. Traverse all optional PCI groups to get all optional PCI groups of physical location point A. These PCI groups form a list PCIKX{A} with A as the index. Traverse all physical locations to be planned to get the PCIKX of each physical location point to be planned. For example:

[0307] LIST_chongtu{A}=[A, A1, A2, A3, A4, A5];

[0308] LIST_juli{A}=[A, B1, B2, B3, B4, B5];

[0309] waibulist{i}=[C1, C2, C3, C4, B3];

[0310] waibulist{j}=[E1, E2, E3, E4, E5];

[0311] waibulist{k}=[D1, D2, D3, D4, D5];

[0312] Since there is no point in LIST_chongtu{A} or LIST_juli{A} in waibulist{j}, element j is added to LISTKX{A}. Similarly, if there is no point in LIST_chongtu{A} or LIST_juli{A} in waibulist{k}, element k is added to PCIKX{A}. However, there is element B3 in waibulist{i}, which belongs to LIST_juli{A}, so i cannot be added to PCIKX{A}. At the same time, according to the A scene in the basic information and the planning range of the PCI group of the scene, it is determined whether j and k are within the planning range. If j and k are both within the range, the final PCIKX{A} = [j, k].

[0313] (8) A list of physical locations of a PCI group can be selected:

[0314] Extract a physical location point A to be planned, extract LIST_chongtu{A} and LIST_juli{A} to match with the physical location points in waibulist{i}. If any physical location point in LIST_chongtu{A} or LIST_juli{A} exists in waibulist{i}, i is not included in the optional PCI group of the physical location point A to be planned. If not, i is included in the optional PCI group of the physical location point A to be planned. Traverse all optional PCI groups to obtain all optional PCI groups of the physical location point A. The A groups corresponding to these PCI groups form the physical location point list DIANKX{i} to which each PCI group can be assigned. Traverse all physical locations to be planned to obtain DIANKX for each PCI group i. An example is shown below:

[0315] LIST_chongtu{A}=[A, A1, A2, A3, A4, A5];

[0316] LIST_juli{A}=[A, B1, B2, B3, B4, B5];

[0317] LIST_chongtu{B}=[B, D1, D2, D3, D4, D5];

[0318] LIST_juli{B}=[B, D5, D6, D7, D8, D9];

[0319] LIST_chongtu{C}=[C, E1, E2, E3, E4, E5];

[0320] LIST_juli{C}=[C, E5, E6, D7, E8, E9];

[0321] waibulist{i}=[C1, C2, C3, C4, B3];

[0322] Since point B3 in LISTC{A} exists in waibulist{i}, element A will not be added to PCIKX{i}. Since point B3 in LISTC{A} does not exist in waibulist{i}, element B will be added to DIANKX{i}. Similarly, since point B3 in LISTC{A} does not exist in waibulist{i}, element C will be added to DIANKX{i}. Finally, DIANKX{i}=[B,C].

[0323] 4. PCI re-planning main process:

[0324] After the basic information preprocessing is completed, the basic data required for PCI replanning is prepared, and the PCI replanning process begins.

[0325] (1)MOD3 is optimized for decoupling of PCI conflicts, PCI collisions, PCI multiplexing layers, and PCI multiplexing distance.

[0326] For example, in the basic information preprocessing, the PCI planning process of a single cell becomes the planning process of the PCI group at the physical location. As long as the PCI group at the physical location satisfies the mutual exclusion relationship, the reuse distance and the reuse layer constraints of the PCI group, the PCI conflict and PCI collision are 0, and the PCI reuse layer and PCI reuse distance minimum constraints are achieved. Since the change in the arrangement within the PCI group will not affect the collision, conflict and reuse layer of the PCI group between the physical locations, the PCIMOD3 optimization process can be decoupled from the planning process of the PCI group. The exploration of the optimal solution of MOD3 is simplified to finding the combination of the three numbers 0, 1 and 2 at each physical location. There are 6 combinations of this combination in the first step of basic data processing. The MOD3 optimization process is simplified to the process of exploring the PCI combination of physical locations. Finding the PCI combination with the least MOD3 interference can find the optimal solution.

[0327] (2) MOD3 optimal exploration:

[0328] First, each position has 6 combinations. If all combinations are traversed, the number of combinations will reach 6 times the number of physical positions. There are 1000 physical positions, which is 6 times 1000. This is an astronomical number and it is impossible to traverse all combinations. Here, a genetic algorithm is used to solve this problem. The specific steps are as follows:

[0329] Step 1: Set a single optimization maximum value MAX to 0, the physical location to be optimized is A_bak, and the optimal combination is B_zu;

[0330] Step 2: Extract a physical location point A, traverse the six combinations of the physical location point A, and calculate the MOD3 interference value caused by each combination. Here, the three cells at point A are represented by A1\A2\A3 respectively. Using the mod3interfere table of basic data preprocessing (5), the MOD3 interference value of each combination can be obtained as follows: 0 / 1 / 2, 0 / 2 / 1, 1 / 0 / 2, 1 / 2 / 0, 2 / 1 / 0, 2 / 0 / 1;

[0331] MOD3{combination 0}=mod3interfere{A1_0}+mod3interfere{A2_1}+mod3interfere{A3_2};

[0332] MOD3{combination 1}=mod3interfere{A1_0}+mod3interfere{A2_2}+mod3interfere{A3_1};

[0333] MOD3{combination 2}=mod3interfere{A1_1}+mod3interfere{A2_0}+mod3interfere{A3_2};

[0334] MOD3{combination 3}=mod3interfere{A1_1}+mod3interfere{A2_2}+mod3interfere{A3_0};

[0335] MOD3{combination 4}=mod3interfere{A1_2}+mod3interfere{A2_1}+mod3interfere{A3_0};

[0336] MOD3{combination 5}=mod3interfere{A1_2}+mod3interfere{A2_0}+mod3interfere{A3_1};

[0337] Find the minimum interference value MIN of the above 6 combinations and combination X, and calculate the difference with MOD3{combination 0}. If the difference is greater than MAX, assign the value to MAX, assign A to A_bak, and assign combination X to B_zu;

[0338] Continue to extract the next location point and repeat the second step until all physical location points are traversed and enter the third step;

[0339] Step 3: If the output MAX in the second step is 0, it means that the optimal solution has been found and the MOD3 optimal exploration ends. If it is not 0, the PCI combination scheme of A_bak is set to B_zu and the next step is to update the mod3interfere table.

[0340] Step 4: Update the mod3interfere table. Since the combination scheme of A_bak has changed, A_bak contains three cells A_bak_1, A_bak_2, and A_bak_3. The mod3interfere values ​​of the cells recorded in the LISTD corresponding to these three cells need to be updated. First, the MOD3 interference value caused by the original PCI combination scheme must be subtracted, and then the MOD3 interference value caused by the new scheme must be added. The operation process of the three cells is the same. The following takes A_bak_1 as an example to illustrate the operation process as follows:

[0341] Sequentially extract the cells of LIST_mod3{A_bak_1}, represented by AA here, mod3interfere{AA_(original mod3 value of A_bak_1) minus the overlapped coverage of AA and A_bak_1, mod3interfere{AA_(new mod3 value of A_bak_1) plus the overlapped coverage of AA and A_bak_1. After the update, set MAX to 0, set A_bak and B_zu to be empty for the physical location point to be optimized, and repeat the second step.

[0342] For details of the MOD3 optimal solution exploration flow chart, please see the attached Figure 3 ;

[0343] After completing the above steps, the best combination of each physical location point is determined. After the PCI group of the subsequent physical location point is determined, the PCI group + combination can uniquely confirm the specific PCI value of each cell at the physical location point. Next, turn to (3) PCI group planning.

[0344] (3) PCI team planning:

[0345] PCI group planning needs to simultaneously solve PCI conflicts, zero collisions, maximize PCI reuse distance, balance reuse times, and maximize MOD30 reuse distance and reuse layer number. This process is a best-effort process to explore the optimal value, such as Figure 4 As shown, the specific steps are as follows:

[0346] Step 1: Evaluate the PCIKX table of each physical location point to be planned, and select the physical location point with the least elements as the next physical location point to be planned, which is represented by A_MIN here.

[0347] Step 2: Evaluate the DIANKX{PCI_TMP} list of each optional PCI group (here represented by PCI_TMP) in PCIKX{A_MIN}. If A_MIN selects PCI_TMP, then the number of points in the DIANKX{PCI_TMP} list to be reduced should be set to zero at the beginning. The specific process is: traverse each physical location point DIAN_TMP in DIANKX{PCI_TMP}. As long as it is in the LIST_juli{DIAN_TMP} or LIST_chongtu{DIAN_TMP} list with A_MIN, the impact quantity should be increased by 1 until the points in DIANKX{PCI_TMP} are traversed. The impact quantity is obtained, and this value is divided by the number of elements in DIANKX{PCI_TMP} to obtain the effect of A_MIN on PCI_TMP. Traverse to obtain the information of each optional PCI group in PCIKX{A_MIN}, and sort them in ascending order according to the influence ratio. The PCI group with the smallest influence ratio is placed in front, and the PCI group with the smallest influence on the subsequent planning can be selected first.

[0348] Step 3: Evaluate the PCI groups in the first N (N is usually 50) positions of PCIKX{A_MIN} after the sorting in step 2. If the number of PCI groups is less than N, all groups in PCIKX{A_MIN} need to be evaluated. Calculate the minimum distance between A_MIN and all points in the waibulist of each optional PCI group, which is the PCI reuse distance of A_MIN relative to the optional PCI group. Sort the PCI groups from large to small according to their PCI reuse distances, and give priority to those with large PCI reuse distances.

[0349] Step 4: Extract the top x% (usually 60% here) of the PCI group list list_part1 sorted in step 2, evaluate the MOD30 minimum reuse distance of each PCI group, and sort list_part1 from large to small according to the MOD30 minimum reuse distance of the PCI group.

[0350] Step 5: Extract the top x% (usually 60%) of the PCI group list list_part2 in list_part1, evaluate the number of times each PCI group is used in the area to be planned, and select the PCI group with the least number of uses. If the number of uses is the same, select the PCI group with the highest ranking to obtain the PCI group determined by A_MIN.

[0351] Step 6: Based on the PCI group determined by A_MIN, here it is marked with PCI_queding, and the affected lists are updated, mainly including 1) Waibulist{PCI_queding}, that is, A_MIN is added to the Waibulist{PCI_queding} list. 2) Physical locations that have LIST_chongtu or LIST_juli with A_MIN are deleted from DIANKX{PCI_queding}. 3) PCI_queding is deleted from PCIKX of the physical location deleted in 2).

[0352] Step 7: Check whether all the points to be planned have been planned. If not, repeat Step 1. If so, end the PCI group planning.

[0353] (4) PCI planning result output:

[0354] According to the PCI group of each physical location point outputted by (3) and the combination of each physical location point outputted by (2), the PCI of the three cells contained in each physical location point can be obtained. The specific process is as follows:

[0355] The PCI group planned for physical location point A is X, and the PCI combination is Y. Then the three cells A1, A2, and A3 included in the physical location point have the following corresponding PCIs:

[0356] A1's PCI = X*3 + pailie{Y}[0];

[0357] A2's PCI = X*3 + pailie{Y}[1];

[0358] A3's PCI = X*3 + pailie{Y}[2];

[0359] Example 1: This technical solution replans and implements 1405 4G cells in a certain 4G network, and the results are as follows:

[0360] This solution reserves 10 groups of PCIs, namely 474-503, for the later addition of sites, with a total of 33 PCIs. Since the impact of 4G MOD30 is relatively small, MOD30 tuning is not considered in this optimization. This solution has been implemented, and the results of this optimization are as follows:

[0361] 1. The mod3 interference is 19490995. After planning, the PCI mod3 interference is 15635242, and the improvement percentage is 19.78%.

[0362] 2. The mod3 interference of the road test before redistribution was 15451, and the mod3 interference of the road test after planning was 10593, with an improvement of 31.4%. The road SINR increased by about 0.8db. The current average SINNR is 11.74, which will be increased to about 12.54 after the implementation of the plan.

[0363] 3. 1,346 PCI collisions or conflicts were found, which were reduced to 0 after redistribution.

[0364] 4. The reuse distance has been significantly improved. The specific situation is as follows: Figure 5 shown.

[0365] 5. The number of reused layers has been significantly improved. The specific situation is as follows: Figure 6 shown.

[0366] The distribution of points that changed before and after PCI replanning. The effect is as follows Figure 7 As shown. Among them, Figure 7 In the figure, the green points indicate the original MOD3 interference points, which are eliminated after redistribution; the yellow points indicate the original non-MOD3 interference points, which become MOD3 interference points after redistribution; the white points indicate the MOD3 interference points before and after redistribution.

[0367] The network statistics CQI changes before and after PCI reallocation are as follows: Figure 8 Among them, the CQI average has significantly improved, from 9.67 before the re-planning to 9.82 on a weekly basis, and is better than before the re-planning every day from Monday to Sunday.

[0368] Example 2: This technical solution replans 16030 3.5G cells in a certain 5G network, and adopts a reservation scheme of reserving 15 groups of PCIs. This scheme has not yet been implemented, and the improvement of network indicators is not included. The comparison results before and after are as follows:

[0369] 1. The PCI mod3 interference is 10350807395. After planning, the number of PCI mod3 switching is 8507320687, and the improvement percentage is 17.81%. The number of PCI conflicts is reduced from 4310 to 0.

[0370] 2. Improvement of PCI reuse distance Fig. 9 As shown, the reuse distance within 4 kilometers basically disappears, and the reuse distance cells above 5 kilometers increase significantly.

[0371] 3. Improvement of PCI multiplexing layers Fig.10 As shown, the number of reused layers disappears within 30 layers, and increases significantly above 30 layers.

[0372] 4. Improvement of MOD30 reuse distance Fig.11 As shown, through Fig.11 The comparison shows that the MOD30 reuse distance is significantly reduced with short distance, and significantly improved with long distance. Among them, the reuse distance above 1.4 kilometers increased by 78%, and the reuse distance within 500 meters decreased from 875 to 71, with a pressure drop of 92%.

[0373] 5. Improvement of MOD30 reuse layers Fig.12 As shown, through Fig.12 The comparison shows that the MOD30 reuse fraction is significantly reduced, and the number on layer 2 has increased from 3701 to 8410, an increase of 127%.

[0374] 6. Improvement of PCI multiplexing balance Fig.13 As shown, the horizontal axis is the PCI value, and the vertical axis is the number of PCI multiplexing times. Fig.13 From the comparison, we can see that the reuse times of each PCI are significantly more balanced.

[0375] In summary, the present invention mainly realizes a PCI replanning applicable to 4G and 5G networks, which can solve the PCI conflicts and PCI collisions of the entire network at one time, improve the reuse distance and the number of reuse layers, and optimize MOD3 and MOD30. At the same time, PCI reservation, PCI setting by scene and segment (optional), and balanced PCI reuse frequency are realized, and PCI resource utilization is improved, and finally the purpose of optimizing mobile network performance and improving mobile network quality is achieved. It provides an effective and executable method for the subsequent PCI replanning of the back-end of the shared network merger of the telecommunications network.

[0376] Compared with the prior art, the present invention has at least the following beneficial effects:

[0377] 1. The present invention splits the PCI replanning process into two separate processes: MOD3 optimal exploration and PCI group planning, thereby decoupling PCI MOD3 interference optimization from PCI conflict, PCI collision, PCI reuse distance, PCI reuse layer number, PCI reuse frequency, and MOD30 interference optimization process.

[0378] 2. The method according to the present invention can realize the whole process from basic information collection, basic information error correction to PCI re-planning, which is a full-process full-network PCI re-planning solution.

[0379] 3. The present invention can simultaneously solve the problems of PCI conflict, PCI collision, PCI multiplexing distance, PCI multiplexing layer number, PCI multiplexing frequency, MOD3 interference, and MOD30 interference.

[0380] 4. PCI re-planning results can be directly applied to the existing network without manual verification.

[0381] On the other hand, an embodiment of the present invention provides a PCI full network replanning device, which may include:

[0382] The first module is used to obtain basic information of the replanning area and its surrounding areas; the basic information includes basic cell information, neighboring cell information, overlapping coverage information and PCI replanning configuration information of each cell in the area;

[0383] The second module is used to pre-process the basic information to obtain the target data;

[0384] The third module is used to perform PCI replanning based on target data to obtain a PCI planning solution; PCI replanning includes PCI group planning and MOD3 interference optimization.

[0385] Optionally, the device may further include:

[0386] The fourth module is used to perform error correction on basic information;

[0387] The fourth module is executed before the second module.

[0388] The contents of the method embodiments of the present invention are all applicable to the device embodiments. The functions specifically implemented by the device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0389] On the other hand, an embodiment of the present invention further provides an electronic device, the electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the above sensitive information method when executing the computer program. The electronic device can be any intelligent terminal including a tablet computer, a car computer, etc.

[0390] The contents of the method embodiments of the present invention are all applicable to the electronic device embodiments. The functions specifically implemented by the electronic device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0391] Another aspect of an embodiment of the present invention further provides a computer-readable storage medium, wherein the storage medium stores a program, and the program is executed by a processor to implement the above method.

[0392] It should be noted that the computer-readable medium shown in the embodiment of the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disk read-only memory (Compact Disc Read to Only Memory, CD to ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer readable signal media may also be any computer readable medium other than computer readable storage media, which may send, propagate, or transmit programs for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0393] The contents of the method embodiments of the present invention are all applicable to the computer-readable storage medium embodiments. The functions specifically implemented by the computer-readable storage medium embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0394] The embodiment of the present invention also discloses a computer program product or a computer program, which includes a computer instruction stored in a computer-readable storage medium. A processor of a computer device can read the computer instruction from the computer-readable storage medium, and the processor executes the computer instruction, so that the computer device executes the above method.

[0395] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0396] It should be noted that, although several modules of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to an embodiment of the present invention, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into being embodied by multiple modules or units.

[0397] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present invention can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD to ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the implementation of the present invention.

[0398] In some selectable embodiments, the function / operation mentioned in the block diagram may not occur in the order mentioned in the operation diagram. For example, depending on the function / operation involved, the two boxes shown in succession can actually be executed substantially simultaneously or the boxes can sometimes be executed in reverse order. In addition, the embodiment presented and described in the flow chart of the present invention is provided by way of example, for the purpose of providing a more comprehensive understanding of technology. The disclosed method is not limited to the operation and logic flow presented herein. Selectable embodiments are expected, wherein the order of various operations is changed and the sub-operation of a part for which is described as a larger operation is performed independently.

[0399] In addition, although the present invention is described in the context of functional modules, it should be understood that, unless otherwise specified, one or more of the functions and / or features can be integrated into a single physical device and / or software module, or one or more functions and / or features can be implemented in a separate physical device or software module. It is also understood that a detailed discussion of the actual implementation of each module is unnecessary for understanding the present invention. More specifically, in view of the properties, functions and internal relationships of the various functional modules in the device disclosed herein, the actual implementation of the module will be understood within the conventional skills of the engineer. Therefore, those skilled in the art can implement the present invention set forth in the claims without excessive experimentation using ordinary techniques. It is also understood that the specific concepts disclosed are merely illustrative and are not intended to limit the scope of the present invention, which is determined by the full scope of the appended claims and their equivalents.

[0400] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods of each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.

[0401] The logic and / or steps represented in the flowchart or otherwise described herein, for example, may be considered as an ordered list of executable instructions for implementing logical functions, and may be embodied in any computer-readable medium for use by an instruction execution device, apparatus or device (such as a computer-based device, a device including a processor, or other device that can fetch instructions from an instruction execution device, apparatus or device and execute the instructions), or in conjunction with such instruction execution device, apparatus or device. For purposes of this specification, "computer-readable medium" may be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution device, apparatus or device, or in conjunction with such instruction execution device, apparatus or device.

[0402] More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk case (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), a fiber optic device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be a paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, deciphering or, if necessary, processing in another suitable manner, and then stored in a computer memory.

[0403] It should be understood that the various parts of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, a plurality of steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution device. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0404] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "examples", "specific examples", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0405] Although the embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the claims and their equivalents.

[0406] The above is a specific description of the preferred implementation of the present invention, but the present invention is not limited to the embodiments. Those skilled in the art can make various equivalent modifications or substitutions without violating the spirit of the present invention. These equivalent modifications or substitutions are all included in the scope defined by the claims of the present invention.

Claims

1. A PCI full network replanning method, characterized in that: The following steps are involved: Obtain basic information of the replanning area and its surrounding areas; the basic information includes basic cell information, neighboring cell information, overlapping coverage information and PCI replanning configuration information of each cell in the area; Preprocessing the basic information to obtain target data; Perform PCI replanning based on the target data to obtain a PCI planning solution; The PCI replanning includes PCI group planning and MOD3 interference optimization.

2. The PCI network-wide replanning method according to claim 1, characterized in that: Before the step of preprocessing the basic information, the method further comprises the following steps: Perform error correction processing on the basic information.

3. The PCI network-wide replanning method according to claim 2, characterized in that: The error correction process for the basic information comprises the following steps: Performing a first check and error correction on the cell longitude and latitude recorded in the cell basic information of each cell; Performing a second check and error correction on the PCI configuration of the same cell recorded in the cell basic information and the neighboring cell information; Performing a third check and error correction on the neighboring cell relationship greater than the first preset distance recorded in the neighboring cell information; Performing a fourth check and error correction on the redundant data in the neighboring cell information and the cell basic information; Based on the results of the first error checking and correction, the second error checking and correction, the third error checking and correction, and the fourth error checking and correction, a verification result is sent to an administrator; and then a correction operation is performed on the error information in the verification result in response to the correction instruction of the administrator.

4. The PCI network-wide replanning method according to claim 3, characterized in that: The first checking and correcting of the cell longitude and latitude recorded in the cell basic information of each cell comprises the following steps: Based on a preset data attribute format, determining whether the cell latitude and longitude recorded in the cell basic information of each cell has a data attribute error; Determine whether there is a recording error in the longitude and latitude of the cell recorded in the cell basic information of the 4G cell based on a preset positioning measurement convergence algorithm; Based on the neighboring cell information, a neighboring cell association and correction algorithm is used to determine whether there are any recording errors in the longitude and latitude of the cell recorded in the basic cell information of the 5G cell.

5. The PCI network-wide replanning method according to claim 4, characterized in that: The method of using a neighboring cell association and correction algorithm to determine whether a recording error occurs in the cell longitude and latitude recorded in the cell basic information of the 5G cell based on the neighboring cell information includes the following steps: Acquire a first preset number of neighboring cells that are less than a second preset distance from the 5G cell, and sort them out to obtain a cell list; Determine whether there is a neighboring cell in the cell list in the neighboring cell relationship of the 5G cell based on the neighboring cell information; When all the neighboring cells in the cell list do not exist in the neighboring cell relationship, it is determined that there is a recording error in the longitude and latitude of the cell recorded in the cell basic information of the 5G cell.

6. The PCI network-wide replanning method according to claim 1, characterized in that: The target data includes a PCI group, a physical location point corresponding to a cell PCI of each cell, a mutually exclusive relationship between physical location points, a MOD3 interference table of each cell, a PCI group root list, a candidate PCI group list, and a candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list; The preprocessing of the basic information to obtain target data comprises the following steps: Grouping the cell PCIs of all cells to obtain the PCI group; wherein the cell PCI is determined based on the cell basic information, and the group number of the PCI group is determined based on the arrangement order of the cell PCIs in the PCI group; Based on the cell longitude and latitude of each cell, converting the planning of the cell PCI into the physical location point; wherein the cell longitude and latitude are determined based on the cell basic information, the physical location point is associated with the cell PCI of at least two co-frequency cells, and the physical location point corresponds to the PCI group; Traversing the neighbor relationship table of each cell based on the neighbor information, obtaining the PCI mutual exclusion relationship between the cells, and then constructing the physical location point mutual exclusion relationship in combination with the cell PCI associated with the physical location point; Based on the overlapping coverage information, the number of MOD3 interferences of each cell under different MOD allocations is obtained, and then the MOD3 interference table of each cell is obtained; The PCI group root list is constructed based on the PCI groups and their corresponding physical location points within a third preset distance around the replanning area; The candidate PCI group list and a candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list are constructed based on the physical location points, the mutually exclusive relationship between the physical location points and the PCI group root list.

7. The PCI network-wide replanning method according to claim 1, characterized in that: The target data includes a PCI group, a physical location point corresponding to a cell PCI of each cell, a MOD3 interference table of each cell, a PCI group root list, a candidate PCI group list, and a candidate physical location point list corresponding to each candidate PCI in the candidate PCI group list; performing PCI replanning based on the target data to obtain a PCI planning scheme includes the following steps: Perform the MOD3 interference optimization based on the MOD3 interference table to obtain a target PCI combination corresponding to each of the physical location points; Perform the PCI group planning based on the PCI group root list, the candidate PCI group list and the candidate physical location point list to obtain the PCI group corresponding to each physical location point; The PCI planning scheme for each physical location point is obtained based on the PCI group corresponding to each physical location point and the target PCI combination.

8. The PCI network-wide replanning method according to claim 7, characterized in that: The MOD3 interference optimization is performed based on the MOD3 interference table to obtain a target PCI combination corresponding to each physical location point, including the following steps: Acquire one of the physical locations from the replanning area as a target location; Obtaining the MOD3 interference value of the target location point under each PCI combination based on the MOD3 interference table, and then determining the minimum interference value corresponding to the target location point and its corresponding pre-selected combination; The minimum interference value is subtracted from the MOD3 interference value of the preset PCI combination to obtain a difference; when the difference is equal to the preset single optimization maximum value, the target PCI combination corresponding to the target position point is determined to be the pre-selected combination; otherwise, the difference is used as the single optimization maximum value corresponding to the target position point, the target position point is used as the physical position point to be optimized, and the pre-selected combination is used as the optimal combination; the next position of the target position point in the replanning area is used as the target position point; Wherein, the single optimization maximum value corresponding to each of the physical position points is initially 0; The MOD3 interference values ​​of the three cells corresponding to the physical location point to be optimized are updated based on the overlapping coverage number determined by the MOD3 interference table; Return to the step of obtaining the MOD3 interference value of the target location point under each PCI combination based on the MOD3 interference table until all the physical location points in the replanning area complete the MOD3 interference optimization.

9. The PCI network-wide replanning method according to claim 7, characterized in that: The PCI group planning is performed based on the PCI group root list, the candidate PCI group list and the candidate physical location point list to obtain the PCI group corresponding to each physical location point, including the following steps: Extracting the physical location point with the least elements from the candidate PCI group list as the pre-planned location point; Obtain the candidate physical location point list corresponding to each candidate PCI group of the pre-planned location point in the candidate PCI group list, and then traverse each physical location point in the candidate physical location point list to determine the impact quantity of the physical location points in the candidate physical location point list that include the pre-planned location point; Determine an influence ratio of each of the candidate PCI groups based on the influence quantity, and sort the candidate PCI groups in ascending order of the influence ratios to obtain a first PCI group sequence; Obtaining a second preset number of candidate PCI groups in the preceding order from the first PCI group sequence as first candidate PCI groups, obtaining the minimum distance between the pre-planned location point and all the physical location points in the PCI group root list corresponding to each of the first candidate PCI groups, and using the minimum distance as the multiplexing distance; sorting all the first candidate PCI groups in descending order according to the multiplexing distance to obtain a second PCI group sequence; The first candidate PCI groups of the first preset ratio in the preceding order are obtained from the second PCI group sequence as the second candidate PCI groups, and the MOD30 minimum reuse distance of each of the second candidate PCI groups is obtained by evaluation; all the second candidate PCI groups are sorted in descending order according to the MOD30 minimum reuse distance to obtain a third PCI group sequence; The second candidate PCI groups of the second preset proportion of the preceding sequence are obtained from the third PCI group sequence as the third candidate PCI group, and the number of times each of the third candidate PCI groups is used in the replanning area is obtained by evaluation; and the third candidate PCI group with the least number of times is used as the PCI group corresponding to the pre-planned location point; Return to the step of extracting the physical location point with the least elements from the candidate PCI group list as the pre-planned location point until all the physical location points in the candidate PCI group list complete the PCI group planning.

10. A PCI full network re-planning device, characterized in that: include: The first module is used to obtain basic information about the replanning area and its surrounding areas; The basic information includes basic cell information, neighboring cell information, overlapping coverage information and PCI re-planning configuration information of each cell in the area; The second module is used to pre-process the basic information to obtain target data; The third module is used to perform PCI re-planning based on the target data to obtain a PCI planning solution; The PCI replanning includes PCI group planning and MOD3 interference optimization.

11. An electronic device, characterized in that: including a processor and a memory; The memory is used to store programs; The processor executes the program to implement the method according to any one of claims 1 to 9.

12. A computer storage medium storing a program executable by a processor, characterized in that: The program executable by the processor is used to implement the method according to any one of claims 1 to 9 when executed by the processor.

Images