研究了半有向无线传感器网络的抗毁性,可以为制定有效的抗毁性策略提供理论依据.借助灰色系统理论,对网络中广泛存在的不完全信息予以刻画.运用母函数法推导出任意度分布的半有向随机网络的临界移除比例以及巨连通分支规模.通过仿真刻画了半有向无线传感器网络的拓扑结构,对其抗毁性展开了分析,以Barabási-Albert (BA)无标度网络作为典型案例进行了仿真分析.研究结果表明,蓄意动态攻击相较于随机攻击和蓄意静态攻击,在攻击效率方面具有明显优势.这一结论为制定无线传感器网络的抗毁性策略提供了重要参考依据.
By investigating the invulnerability of semi-directed wireless sensor networks, this paper provides a theoretical basis for formulating effective invulnerability strategies. The paper uses the grey system theory to characterize the widespread incomplete information in the network. By applying the generating function method, it successfully derives the critical removal ratio and the size of the giant connected component of semi-directed random networks with arbitrary degree distribution. The topologies of semi-directed wireless sensor networks are described by simulation, and the invulnerability analysis of semi-directed wireless sensor networks is carried out, with the Barabási-Albert (BA) scale-free network taken as a typical case for simulation analysis. The results indicate that the intentional dynamic attack has obvious advantages over the random attack and the intentional static attack in attack efficiency. This conclusion provides an important reference for formulating strategies to improve the invulnerability of wireless sensor networks.
[1] Erd?os P, R’enyi A. On random graphs [J]. Publicationes Mathematicae (Debrecen), 1959, 6: 290-297.
[2] Watts D J, Strogatz S H. Collective dynamics of ‘small-world’ networks [J]. Nature, 1998, 393(6684): 440.
[3] Wang Z X, Zhou D, Hu Y Q. Group percolation in interdependent networks [J]. Physical Review E, 2018, 97(3): 032306.
[4] Najjar S, David M, Derigent W, et al. Dynamic reconfiguration of wireless sensor networks: a survey [J]. Computer Networks, 2025, 262: 111176.
[5] Chen R Z. Optimizing wireless sensor network topology with node load consideration [J]. Virtual Reality & Intelligent Hardware, 2025, 7(1): 47-61.
[6] Hajar F, Amol D, Vibhute Y, et al. Intrusion detection in wireless sensor networks using machine learning [J]. Procedia Computer Science, 2025, 252: 912-921.
[7] Gu X B, Liu J L, Liu Y, et al. Anchor nodes selection and placement strategy for node positioning in wireless sensor networks [J]. Ad Hoc Networks, 2025, 170: 103766.
[8] Braun J, Derbel F. Wireless sensor network for fire detection with network coding to improve security and reliability [J]. Measurement: Sensors, 2025, 37: 101404.
[9] Fu X W, Yang Y S. Analysis on invulnerability of wireless sensor networks based on cellular automata [J]. Reliability Engineering & System Safety, 2021, 212: 107616.
[10] Albert R, Jeong H, Barabáasi A L. Error and attack tolerance of complex networks [J]. Nature, 2000, 406: 378-382.
[11] Xiao S, Xiao G, Cheng T H. Tolerance of intentional attacks in complex communication networks [J]. IEEE Communications Magazine, 2008, 46(1): 146-152.
[12] 吴俊, 谭跃进, 邓宏钟, 等. 基于不等概率抽样的不完全信息条件下复杂网络抗毁性模型[J]. 系统工程理论与实践, 2010, 30(7): 1207-1217.
[13] 田旭光, 张成名. 不完全信息条件下的装备保障网络抗毁性模型[J]. 系统工程理论与实践, 2017, 37(3): 790-798.
[14] 张强, 曹军海, 宋太亮, 等. 基于模糊局部维数的装备保障网络节点重要性评估[J]. 兵工学报, 2020, 41(7): 1449-1456.
[15] Li J, Wu J, Li Y, et al. Attack robustness of scale-free networks based on grey information [J]. Chinese Physics Letters, 2011, 28(5): 035801.
[16] 王甲生, 吴晓平, 叶清, 等. 灰色信息条件下的加权复杂网络抗毁性[J]. 海军工程大学学报, 2014(1): 42-47.
[17] Meyers L A, Newman M E J, Pourbohloul B. Predicting epidemics on directed contact networks [J]. Journal of Theoretical Biology, 2006, 240(3): 400-418.
[18] Zhang X G, Sun G Q, Zhu Y X, et al. Epidemic dynamics on semi-directed complex networks [J]. Mathematical Biosciences, 2013, 246(2): 242-251.
[19] Sun Q, Yang F B, Wang X Y, et al. Network invulnerability enhancement algorithm based on WSN closeness centrality [J]. Computers, Materials and Continua, 2022, 73(2): 3021-3038.
[20] Frohn M, Holtgrefe N, Iersel L V, et al. Reconstructing semi-directed level-1 networks using few quarnets [J]. Journal of Computer and System Sciences, 2025, 152: 103655.
[21] Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications [J]. Physical Review E, 2001, 64(2): 026118.
[22] Michael M, Bruce R. The size of the giant component of a random graph with a given degree sequence [J]. Combinatorics, Probability and Computing, 1998, 7(3): 295-305.
