Key Node Identification in Spatial Information Networks via Soft Community Partition and Hypergraph Interweaving Degree

Due to the widespread deployment of large-scale satellite constellations, Spatial Information Networks (SINs) exhibit increasingly high-order node and service coupling characteristics, rendering them vulnerable to node removal and cascading failures. Traditional graph-theoretic models fail to capture the inherent multi-node cooperative relationships within SINs, while conventional centrality metrics overlook service coupling features and cross-community propagation risks, leading to inaccurate key node identification. To address these issues, this paper proposes a key node mining method based on soft community partition and hypergraph interweaving degree. The method first constructs a hypernetwork to characterize the high-order associations among three types of services—communication, remote sensing, and navigation. Second, a probabilistic generative model, Hypergraph-MT, is introduced to detect overlapping communities and capture the multi-role attributes of satellites. Finally, the Interweaving Degree (IW) and its derived Bridge Score (IWBS) are defined to quantify node importance from two dimensions: load capacity and cross-community connectivity. Experimental results demonstrate that, compared with degree centrality and betweenness centrality, the proposed method increases the service interruption rate from 27.4% to 64.8% under a 5% removal ratio, and the service efficiency loss is elevated by more than 60%. In comparison with pure interweaving degree removal, IWBS triggers deeper cascading removal at a 30% removal ratio, reduces the removal cost by 8.9%, and improves the input–output ratio by 8.2% under high-intensity removal. Moreover, the algorithm exhibits linear scalability and strong robustness to parameter variations. The proposed method significantly enhances the accuracy and efficiency of key node identification in SINs, providing theoretical support for constellation deployment optimization and priority protection decision-making.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2026-09-16
DOI
https://doi.org/10.3390/s26185870
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Key Node Identification in Spatial Information Networks via Soft Community Partition and Hypergraph Interweaving Degree

Xiaolan Yu, Ping Jian, Wei Xiong, Yali Liu
Sensors
Satellite Communication Systems
article

Key Node Identification in Spatial Information Networks via Soft Community Partition and Hypergraph Interweaving Degree

Xiaolan Yu, Ping Jian, Wei Xiong, Yali Liu
article en

Abstract

Due to the widespread deployment of large-scale satellite constellations, Spatial Information Networks (SINs) exhibit increasingly high-order node and service coupling characteristics, rendering them vulnerable to node removal and cascading failures. Traditional graph-theoretic models fail to capture the inherent multi-node cooperative relationships within SINs, while conventional centrality metrics overlook service coupling features and cross-community propagation risks, leading to inaccurate key node identification. To address these issues, this paper proposes a key node mining method based on soft community partition and hypergraph interweaving degree. The method first constructs a hypernetwork to characterize the high-order associations among three types of services—communication, remote sensing, and navigation. Second, a probabilistic generative model, Hypergraph-MT, is introduced to detect overlapping communities and capture the multi-role attributes of satellites. Finally, the Interweaving Degree (IW) and its derived Bridge Score (IWBS) are defined to quantify node importance from two dimensions: load capacity and cross-community connectivity. Experimental results demonstrate that, compared with degree centrality and betweenness centrality, the proposed method increases the service interruption rate from 27.4% to 64.8% under a 5% removal ratio, and the service efficiency loss is elevated by more than 60%. In comparison with pure interweaving degree removal, IWBS triggers deeper cascading removal at a 30% removal ratio, reduces the removal cost by 8.9%, and improves the input–output ratio by 8.2% under high-intensity removal. Moreover, the algorithm exhibits linear scalability and strong robustness to parameter variations. The proposed method significantly enhances the accuracy and efficiency of key node identification in SINs, providing theoretical support for constellation deployment optimization and priority protection decision-making.

SensorsVol. 26(18)
Space Engineering University (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 7%
Satellite Communication 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.

Key Node Identification in Spatial Information Networks via Soft Community Partition and Hypergraph Interweaving Degree — Xiaolan Yu, Ping Jian, et al. · Sensors (2026) | TGRS Research Map | TGRS