PCI Planning with Reassignment Budget in Ultra-Dense Networks

The physical cell identity (PCI) is a critical parameter in wireless networks, enabling user equipment (UE) to uniquely identify cells and mitigate inter-cell interference during communication. However, the proliferation of base stations in modern networks has complicated the proper assignment of PCIs, as it requires avoiding multiple types of PCI conflicts, such as PCI collision, mod-3 collision, and confusion. Existing methods generally focus on addressing single PCI conflicts and involve reassigning PCIs for all cells, which can lead to significant data exchange overhead in large-scale networks. To address these challenges, this paper tackles the PCI planning problem by introducing a PCI reassignment budget as a constraint to minimize overall network interference. A penalty-based double-loop PCI planning algorithm is proposed, where the outer loop optimizes penalty parameters derived from the constraints, and the inner loop combines a block coordinate descent (BCD) approach with a proposed concave-convex procedure to optimize PCI assignments. Simulation results demonstrate the effectiveness of the proposed method in significantly reducing network interference compared to existing approaches.

Authors

Institutions

Publication Details

Published
2025-06-17
DOI
https://doi.org/10.1109/vtc2025-spring65109.2025.11174815
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PCI Planning with Reassignment Budget in Ultra-Dense Networks

Jiaqiang Wen, Zihao Chen, Fan Liu, Fan Xu et al.
Interconnection Networks and Systems
article

PCI Planning with Reassignment Budget in Ultra-Dense Networks

Jiaqiang Wen, Zihao Chen, Fan Liu, Fan Xu, Yunlong Cai
article en

Abstract

The physical cell identity (PCI) is a critical parameter in wireless networks, enabling user equipment (UE) to uniquely identify cells and mitigate inter-cell interference during communication. However, the proliferation of base stations in modern networks has complicated the proper assignment of PCIs, as it requires avoiding multiple types of PCI conflicts, such as PCI collision, mod-3 collision, and confusion. Existing methods generally focus on addressing single PCI conflicts and involve reassigning PCIs for all cells, which can lead to significant data exchange overhead in large-scale networks. To address these challenges, this paper tackles the PCI planning problem by introducing a PCI reassignment budget as a constraint to minimize overall network interference. A penalty-based double-loop PCI planning algorithm is proposed, where the outer loop optimizes penalty parameters derived from the constraints, and the inner loop combines a block coordinate descent (BCD) approach with a proposed concave-convex procedure to optimize PCI assignments. Simulation results demonstrate the effectiveness of the proposed method in significantly reducing network interference compared to existing approaches.

Tongji University (CN), Southern University of Science and Technology (CN), Peng Cheng Laboratory (CN), Southeast University (CN)
Openalex Percentile: Top 69%
Interconnection Networks and Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

PCI Planning with Reassignment Budget in Ultra-Dense Networks — Jiaqiang Wen, Zihao Chen, et al. · (2025) | TGRS Research Map | TGRS