A Study of the Neighborhood PCI Planning Problem Based on an Integer Planning Model
In the context of mobile communication networks, the allocation of PCI is directly correlated with the quality of the user experience. Effective PCI allocation can mitigate signal interference and enhance the efficacy of user operations. In this paper, this article first analyse the PCI open source data for 2067 cells in a region. Then we preprocess the data in order to obtain three matrices, and finally establish an integer planning model by combining the processed data and the problem. The decision variables are the corresponding PCI values of 2067 cells. The objective function is the minimum sum of the MR numbers of conflict, confusion and mode 3 interference among 2067 cells. The constraints are that each cell is assigned a PCI value and is in the range of [0,1007], which is taken as an integer. Furthermore, this paper assesses the relationship between the PCI values of two or more cells operating on the same frequency and establishes the corresponding constraints. The sequential quadratic programming algorithm is employed, with the optimization function of MATLAB being invoked to address the optimization problem. The optimal values of the decision variables are identified through continuous iteration, and the optimal PCI values for 2067 cells are ultimately derived.
Authors
- Zizhi Chen (ORCID: https://orcid.org/0000-0001-5721-9431)
- Fuqiang Cui (ORCID: https://orcid.org/0000-0002-9592-4286)
- Yuhan Zhang (ORCID: https://orcid.org/0009-0001-0686-3865)
Institutions
- Shandong University of Science and Technology (CN)
Publication Details
- Published
- 2024-10-23
- DOI
- https://doi.org/10.1109/iccasit62299.2024.10828115
- Citations
- 1
- Primary Topic
- Vehicle Routing Optimization Methods
- Type
- article
- Field-Weighted Citation Impact
- 0.35