Relaxation-Free Min-$k$-Partition for PCI Assignment in 5G Networks
- 16 September 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 3931-3946
Abstract
Physical Cell Identity (PCI) is a critical parameter in 5G networks. Efficient and accurate PCI assignment is essential for mitigating mod-3 interference, mod-30 interference, collisions, and confusions among cells, which directly affect network reliability and user experience. In this paper, we propose a novel framework for PCI assignment by decomposing the problem into Min-3-Partition, Min-10-Partition, and a graph coloring problem, leveraging the Chinese Remainder Theorem (CRT). Furthermore, we develop a relaxation-free approach to the general Min-k-Partition problem by reformulating it as a quadratic program with a norm-equality constraint and solving it using a penalized mirror descent (PMD) algorithm. The proposed method demonstrates superior computational efficiency and scalability, significantly reducing interference while eliminating collisions and confusions in large-scale 5G networks. Numerical evaluations on real-world datasets show that our approach reduces computational time by up to 20 times compared to state-of-the-art methods, making it highly practical for real-time PCI optimization in large-scale networks. These results highlight the potential of our method to improve network performance and reduce deployment costs in modern 5G systems.Keywords
All Related Versions
Funding Information
- National Key Research and Development Program of China (2022YFA1003900)
- National Natural Science Foundation of China (62301334)
- Guangdong Major Project of Basic and Applied Basic Research (2023B0303000001)
- Guangdong Provincial Key Laboratory of Big Data Computing
This publication has 33 references indexed in Scilit:
- A programmable distributed optimization framework for 5GCSI Transactions on ICT, 2020
- A Novel PCI Optimization Method in LTE System Based on Intelligent Genetic Algorithm2017
- A two-level graph partitioning problem arising in mobile wireless communicationsComputational Optimization and Applications, 2017
- Randomized Graph Coloring Algorithm for Physical Cell ID Assignment in LTE-A Femtocellular NetworksWireless Personal Communications, 2016
- A multiple search operator heuristic for the max-k-cut problemAnnals of Operations Research, 2016
- A biased random-key genetic algorithm for wireless backhaul network designApplied Soft Computing, 2015
- A Survey of 5G Network: Architecture and Emerging TechnologiesIEEE Access, 2015
- Numerical Optimization1999
- Laplacian eigenvalues and the maximum cut problemMathematical Programming, 1993
- The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and boundsAnnals of Operations Research, 1991