Zhipeng Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhipeng Jiang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Suixiang Gao
University of Chinese Academy of Sciences
2 shared publications- Chengpiao Huang
Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027
1 shared publication Dong Zhang
Huawei Technologies, Shenzhen, China
1 shared publicationJihong Gui
University of Chinese Academy of Sciences
1 shared publication- Qingjiang Shi
Tongji University
1 shared publication Rui Wang
School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, China
1 shared publication
Latest Publications
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 3931-3946
Relaxation-Free Min-$k$-Partition for PCI Assignment in 5G Networks
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.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 3931-3946
Relaxation-Free Min-$k$-Partition for PCI Assignment in 5G Networks
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.
- Open Access
- 6 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 203-214
PCI Planning Based on Binary Quadratic Programming in LTE/LTE-A Networks
In recent years, interference has played an increasingly significant part in bulkier and denser Long Term Evolution (LTE/LTE-Advanced) networks. Though intra-cell interference is successfully improved by Orthogonal Frequency Division Multiple Access (OFDMA), inter-cell interference (ICI) could cause a degradation of throughput and significantly impact Signal-to-Noise-Ratio (SINR) in the downlink (DL) network. Physical Cell ID (PCI) planning, an effective approach to eliminate ICI, is required to reduce collision, confusion and mod q interference, where q = 3 for Single-Input Single- Output (SISO) system, and q = 6 for Multiple-Input Multiple-Output (MIMO) system. In this study, a new definition of neighborhood relations was proposed based on the measurement report (MR) data in the actual network. Binary quadratic programming (BQP) model was built for PCI planning through a series of model deductions and mathematical proofs. Since BQP is known as NP-hard, a heuristic Greedy algorithm was proposed and its low complexity both in time and space can ensure large-scale computing. Finally, based on the raw data extracted from the actual SISO system network and the simulation calculation of MATLAB, the experimental results demonstrated that Greedy algorithm not only eliminates conflict and confusion completely, but also reduces the mod 3 interference of 26.213% more than the baseline scheme and far more than the improvement ratio of 4.436% given by the classical graph coloring algorithm.
- 6 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 203-214
Open AccessPCI Planning Based on Binary Quadratic Programming in LTE/LTE-A Networks
In recent years, interference has played an increasingly significant part in bulkier and denser Long Term Evolution (LTE/LTE-Advanced) networks. Though intra-cell interference is successfully improved by Orthogonal Frequency Division Multiple Access (OFDMA), inter-cell interference (ICI) could cause a degradation of throughput and significantly impact Signal-to-Noise-Ratio (SINR) in the downlink (DL) network. Physical Cell ID (PCI) planning, an effective approach to eliminate ICI, is required to reduce collision, confusion and mod q interference, where q = 3 for Single-Input Single- Output (SISO) system, and q = 6 for Multiple-Input Multiple-Output (MIMO) system. In this study, a new definition of neighborhood relations was proposed based on the measurement report (MR) data in the actual network. Binary quadratic programming (BQP) model was built for PCI planning through a series of model deductions and mathematical proofs. Since BQP is known as NP-hard, a heuristic Greedy algorithm was proposed and its low complexity both in time and space can ensure large-scale computing. Finally, based on the raw data extracted from the actual SISO system network and the simulation calculation of MATLAB, the experimental results demonstrated that Greedy algorithm not only eliminates conflict and confusion completely, but also reduces the mod 3 interference of 26.213% more than the baseline scheme and far more than the improvement ratio of 4.436% given by the classical graph coloring algorithm.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 354-357
An efficient heuristic for restorable energy aware routing in networks with bundled links
Energy aware routing via rerouting traffic or traffic aggregating has received wide attention in the last decade. It is important and challenging to take network reliability into consideration to enhance the resilience to failures at the same time. In this paper, we aim to minimize energy expenditure while ensuring network reliability by restoration. As each request has an active path and disjoint backup path for restoration, the backup path can be used if the active path fails. To this end, we first propose the problem called Restorable Energy Aware Routing Problem in networks with bundled links (REAR-BL) when backup sharing is not allowed. We form a linear integer model to minimize the number of powered-on cables of links while putting idle cables to sleep under constraints of restoration and maximum link utilization. Since REAR-BL is Np-hard, we design a fast heuristic to solve it based on Suurballe algorithm and the analysis of a lower bound and an upper bound of the optimal solution. We evaluate our heuristic through extensive simulations on real and synthetic topologies and obtain considerable energy savings with less time when compared to CPLEX solutions and upper and lower bounds.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 354-357
An efficient heuristic for restorable energy aware routing in networks with bundled links
Energy aware routing via rerouting traffic or traffic aggregating has received wide attention in the last decade. It is important and challenging to take network reliability into consideration to enhance the resilience to failures at the same time. In this paper, we aim to minimize energy expenditure while ensuring network reliability by restoration. As each request has an active path and disjoint backup path for restoration, the backup path can be used if the active path fails. To this end, we first propose the problem called Restorable Energy Aware Routing Problem in networks with bundled links (REAR-BL) when backup sharing is not allowed. We form a linear integer model to minimize the number of powered-on cables of links while putting idle cables to sleep under constraints of restoration and maximum link utilization. Since REAR-BL is Np-hard, we design a fast heuristic to solve it based on Suurballe algorithm and the analysis of a lower bound and an upper bound of the optimal solution. We evaluate our heuristic through extensive simulations on real and synthetic topologies and obtain considerable energy savings with less time when compared to CPLEX solutions and upper and lower bounds.