TY - GEN
T1 - Geometry-Optimized Fission Clustering for Joint Communication and Localization in Capacity-Constrained Networks
AU - Tan, Zimu
AU - Shen, Yuyao
AU - Liu, Yiming
AU - Wang, Yongqing
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - Clustering is a crucial technology for addressing the challenges of dense wireless networks with limited base station (BS) capacity. However, conventional clustering algorithms often neglect connectivity, leading to severe resource waste during sub-band allocation. Furthermore, they ignore the geometric distribution of nodes, frequently resulting in collinear anchors or coplanar anchor-agent configurations that cause the Equivalent Fisher Information Matrix (EFIM) to become singular, thereby degrading 3D positioning accuracy. To address these challenges, we propose the Geometry-Optimized Fission Clustering (GOFC) algorithm. GOFC constructs a multi-dimensional similarity graph incorporating a topological volumetric similarity metric to prioritize highly divergent, volumetric node groups. By employing a recursive spectral fission mechanism, GOFC guarantees connectivity and adheres to cluster capacity limits. Simulation results demonstrate that, compared with benchmark methods, the proposed GOFC algorithm attains higher network throughput while simultaneously achieving a significantly lower Squared Position Error Bound (SPEB) in highly dynamic environments.
AB - Clustering is a crucial technology for addressing the challenges of dense wireless networks with limited base station (BS) capacity. However, conventional clustering algorithms often neglect connectivity, leading to severe resource waste during sub-band allocation. Furthermore, they ignore the geometric distribution of nodes, frequently resulting in collinear anchors or coplanar anchor-agent configurations that cause the Equivalent Fisher Information Matrix (EFIM) to become singular, thereby degrading 3D positioning accuracy. To address these challenges, we propose the Geometry-Optimized Fission Clustering (GOFC) algorithm. GOFC constructs a multi-dimensional similarity graph incorporating a topological volumetric similarity metric to prioritize highly divergent, volumetric node groups. By employing a recursive spectral fission mechanism, GOFC guarantees connectivity and adheres to cluster capacity limits. Simulation results demonstrate that, compared with benchmark methods, the proposed GOFC algorithm attains higher network throughput while simultaneously achieving a significantly lower Squared Position Error Bound (SPEB) in highly dynamic environments.
KW - clustering
KW - Joint communication and localization
KW - spectral clustering
UR - https://www.scopus.com/pages/publications/105043789170
U2 - 10.1109/EICCT69950.2026.11564562
DO - 10.1109/EICCT69950.2026.11564562
M3 - Conference contribution
AN - SCOPUS:105043789170
T3 - 2026 5th International Conference on Electronics, Integrated Circuits and Communication Technology, EICCT 2026
SP - 532
EP - 537
BT - 2026 5th International Conference on Electronics, Integrated Circuits and Communication Technology, EICCT 2026
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th International Conference on Electronics, Integrated Circuits and Communication Technology, EICCT 2026
Y2 - 24 April 2026 through 26 April 2026
ER -