ArticleScientific reports2025
Security-centric node identification in complex networks.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Ensuring network security in complex and dynamic environments has become a critical challenge due to the increasing proliferation of Internet of Things (IoT) devices and decentralized architectures such as Fog Computing. Traditional node identification methods primarily focus on either network centrality measures or security metrics in isolation, which limits their effectiveness in detecting security-critical nodes. In this paper, we propose a novel Security-Centric Node Identification method that integrates multiple centrality measures with security-related metrics and dynamic factors to compute a comprehensive Security Centrality (SC) for each node. Unlike conventional approaches, our method accounts for both structural importance and security vulnerabilities by incorporating degree, betweenness, closeness, and eigenvector centralities with real-time security risk assessments and dynamic network conditions. To achieve this, we develop a mathematical model to compute SC, introduce efficient algorithms for identifying critical nodes, and implement an incremental update mechanism to enhance adaptability in real-time networks. Our experimental evaluation on various network topologies, including random, scale-free, small-world, and real-world networks, demonstrates that the proposed method effectively identifies security-critical nodes with high detection accuracy while maintaining a low false-positive rate. The results show that incorporating dynamic factors significantly improves the robustness of node identification, making our method highly adaptable to real-world network security scenarios.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.