• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

复杂网络中以安全性为中心的节点识别

Security-centric node identification in complex networks.

作者信息

Liu Lanying, Du Ning, Sheng Duyong

机构信息

Liaocheng University Dongchang College, Liaocheng, 252000, Shandong, China.

College of Electrical Engineering and Automation, Shandong University of Science and Technology, Qingdao, 266590, Shandong, China.

出版信息

Sci Rep. 2025 May 4;15(1):15568. doi: 10.1038/s41598-025-00360-4.

DOI:10.1038/s41598-025-00360-4
PMID:40320425
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC12050318/
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.

摘要

由于物联网(IoT)设备的不断扩散以及诸如雾计算等去中心化架构的出现,在复杂且动态的环境中确保网络安全已成为一项严峻挑战。传统的节点识别方法主要孤立地关注网络中心性度量或安全指标,这限制了它们在检测安全关键节点方面的有效性。在本文中,我们提出了一种新颖的以安全为中心的节点识别方法,该方法将多种中心性度量与安全相关指标及动态因素相结合,为每个节点计算一个综合的安全中心性(SC)。与传统方法不同,我们的方法通过将度中心性、介数中心性、紧密中心性和特征向量中心性与实时安全风险评估及动态网络条件相结合,兼顾了结构重要性和安全漏洞。为实现这一点,我们开发了一个用于计算SC的数学模型,引入了用于识别关键节点的高效算法,并实现了一种增量更新机制以增强在实时网络中的适应性。我们在各种网络拓扑结构上进行的实验评估,包括随机网络、无标度网络、小世界网络和真实世界网络,表明所提出的方法能够以高检测准确率有效识别安全关键节点,同时保持低误报率。结果表明,纳入动态因素显著提高了节点识别的鲁棒性,使我们的方法高度适用于现实世界的网络安全场景。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/6571ccebc75f/41598_2025_360_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/9586f37626c0/41598_2025_360_Figa_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/61ec5f26edbc/41598_2025_360_Figb_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/a6ccf706ba0d/41598_2025_360_Figc_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/50852e589e1c/41598_2025_360_Figd_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/1080f2d87578/41598_2025_360_Fige_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/e26dff805bd7/41598_2025_360_Figf_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/73506fa55ff2/41598_2025_360_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/6571ccebc75f/41598_2025_360_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/9586f37626c0/41598_2025_360_Figa_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/61ec5f26edbc/41598_2025_360_Figb_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/a6ccf706ba0d/41598_2025_360_Figc_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/50852e589e1c/41598_2025_360_Figd_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/1080f2d87578/41598_2025_360_Fige_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/e26dff805bd7/41598_2025_360_Figf_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/73506fa55ff2/41598_2025_360_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7562/12050318/6571ccebc75f/41598_2025_360_Fig2_HTML.jpg

相似文献

1
Security-centric node identification in complex networks.复杂网络中以安全性为中心的节点识别
Sci Rep. 2025 May 4;15(1):15568. doi: 10.1038/s41598-025-00360-4.
2
A Multi-Attribute Decision-Making Approach for Critical Node Identification in Complex Networks.一种用于复杂网络关键节点识别的多属性决策方法。
Entropy (Basel). 2024 Dec 9;26(12):1075. doi: 10.3390/e26121075.
3
Investigating critical node identification in water networks through distance Laplacian energy centrality.通过距离拉普拉斯能量中心性研究水网络中的关键节点识别
Environ Sci Pollut Res Int. 2025 Mar;32(11):6505-6531. doi: 10.1007/s11356-025-36118-8. Epub 2025 Feb 25.
4
The parallel computing of node centrality based on GPU.基于图形处理器(GPU)的节点中心性并行计算
Math Biosci Eng. 2022 Jan 10;19(3):2700-2719. doi: 10.3934/mbe.2022123.
5
Towards a methodology for validation of centrality measures in complex networks.迈向复杂网络中心性度量验证方法学。
PLoS One. 2014 Apr 7;9(4):e90283. doi: 10.1371/journal.pone.0090283. eCollection 2014.
6
A new measure of centrality for brain networks.一种新的脑网络中心度度量。
PLoS One. 2010 Aug 16;5(8):e12200. doi: 10.1371/journal.pone.0012200.
7
Computing Influential Nodes Using the Nearest Neighborhood Trust Value and PageRank in Complex Networks.利用复杂网络中的最近邻信任值和PageRank算法计算有影响力的节点
Entropy (Basel). 2022 May 16;24(5):704. doi: 10.3390/e24050704.
8
Absorbing random walks interpolating between centrality measures on complex networks.在复杂网络上介于中心性度量之间进行插值的吸收随机游走。
Phys Rev E. 2020 Jan;101(1-1):012302. doi: 10.1103/PhysRevE.101.012302.
9
A secure end-to-end communication framework for cooperative IoT networks using hybrid blockchain system.一种使用混合区块链系统的协作物联网网络的安全端到端通信框架。
Sci Rep. 2025 Apr 1;15(1):11077. doi: 10.1038/s41598-025-96002-w.
10
Optimized intrusion detection in IoT and fog computing using ensemble learning and advanced feature selection.使用集成学习和先进特征选择技术实现物联网和雾计算中的优化入侵检测。
PLoS One. 2024 Aug 1;19(8):e0304082. doi: 10.1371/journal.pone.0304082. eCollection 2024.

本文引用的文献

1
Robust self supervised symmetric nonnegative matrix factorization to the graph clustering.用于图聚类的鲁棒自监督对称非负矩阵分解
Sci Rep. 2025 Mar 1;15(1):7350. doi: 10.1038/s41598-025-92564-x.
2
Identifying Important Nodes in Complex Networks Based on Node Propagation Entropy.基于节点传播熵识别复杂网络中的重要节点
Entropy (Basel). 2022 Feb 14;24(2):275. doi: 10.3390/e24020275.
3
Synchronizability of small-world networks generated from ring networks with equal-distance edge additions.具有等距边添加的环形网络生成的小世界网络的同步性。
Chaos. 2012 Jun;22(2):023121. doi: 10.1063/1.4711008.
4
Temporal node centrality in complex networks.复杂网络中的时间节点中心性
Phys Rev E Stat Nonlin Soft Matter Phys. 2012 Feb;85(2 Pt 2):026107. doi: 10.1103/PhysRevE.85.026107. Epub 2012 Feb 13.
5
Attack vulnerability of complex networks.复杂网络的攻击脆弱性。
Phys Rev E Stat Nonlin Soft Matter Phys. 2002 May;65(5 Pt 2):056109. doi: 10.1103/PhysRevE.65.056109. Epub 2002 May 7.