Sequential defense against random and intentional attacks in complex networks

被引:18
作者
Chen, Pin-Yu [1 ]
Cheng, Shin-Ming [2 ]
机构
[1] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
[2] Natl Taiwan Univ Sci & Technol, Dept Comp Sci & Informat Engn, Taipei 10607, Taiwan
关键词
INTERNET; RESILIENCE; TOLERANCE;
D O I
10.1103/PhysRevE.91.022805
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
Network robustness against attacks is one of the most fundamental researches in network science as it is closely associated with the reliability and functionality of various networking paradigms. However, despite the study on intrinsic topological vulnerabilities to node removals, little is known on the network robustness when network defense mechanisms are implemented, especially for networked engineering systems equipped with detection capabilities. In this paper, a sequential defense mechanism is first proposed in complex networks for attack inference and vulnerability assessment, where the data fusion center sequentially infers the presence of an attack based on the binary attack status reported from the nodes in the network. The network robustness is evaluated in terms of the ability to identify the attack prior to network disruption under two major attack schemes, i.e., random and intentional attacks. We provide a parametric plug-in model for performance evaluation on the proposed mechanism and validate its effectiveness and reliability via canonical complex network models and real-world large-scale network topology. The results show that the sequential defense mechanism greatly improves the network robustness and mitigates the possibility of network disruption by acquiring limited attack status information from a small subset of nodes in the network.
引用
收藏
页数:13
相关论文
共 36 条
  • [1] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [2] Error and attack tolerance of complex networks
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 2000, 406 (6794) : 378 - 382
  • [3] Network Anomaly Detection and Classification via Opportunistic Sampling
    Androulidakis, Georgios
    Chatzigiannakis, Vassilis
    Papavassiliou, Symeon
    [J]. IEEE NETWORK, 2009, 23 (01): : 6 - 12
  • [4] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [5] Network robustness and fragility: Percolation on random graphs
    Callaway, DS
    Newman, MEJ
    Strogatz, SH
    Watts, DJ
    [J]. PHYSICAL REVIEW LETTERS, 2000, 85 (25) : 5468 - 5471
  • [6] Chen P.-Y., 2011, P 2011 IEEE INT C GL, P1, DOI DOI 10.1109/ICSPCC.2011.6061733
  • [7] Chen P, 2013, EL PACKAG TECH CONF, P1, DOI 10.1109/EPTC.2013.6745672
  • [8] Information Fusion to Defend Intentional Attack in Internet of Things
    Chen, Pin-Yu
    Cheng, Shin-Ming
    Chen, Kwang-Cheng
    [J]. IEEE INTERNET OF THINGS JOURNAL, 2014, 1 (04): : 337 - 348
  • [9] Assessing and Safeguarding Network Resilience to Nodal Attacks
    Chen, Pin-Yu
    Hero, Alfred O., III
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2014, 52 (11) : 138 - 143
  • [10] Smart Attacks in Smart Grid Communication Networks
    Chen, Pin-Yu
    Cheng, Shin-Ming
    Chen, Kwang-Cheng
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2012, 50 (08) : 24 - 29