Influence Evaluation of Centrality-Based Random Scanning Strategy on Early Worm Propagation Rate

被引:0
作者
Kown, Su-kyung [1 ]
Jang, Bongsoo [2 ]
Lee, Byoung-Dai [3 ]
Do, Younghae [4 ]
Baek, Hunki [5 ]
Choi, Yoon-Ho [1 ]
机构
[1] Pusan Natl Univ, Sch Elect Elect & Comp Engn, Busan, South Korea
[2] Ulsan Natl Inst Sci & Technol, Dept Math Sci, Ulsan, South Korea
[3] Kyonggi Univ, Dept Comp Sci, Suwon, South Korea
[4] Kyungpook Natl Univ, Dept Math, KNU Ctr Nonlinear Dynam, Daegu, South Korea
[5] Catholic Univ Daegu, Dept Math Educ, Daegu, South Korea
来源
INFORMATION SECURITY APPLICATIONS, WISA 2016 | 2017年 / 10144卷
基金
新加坡国家研究基金会;
关键词
Worm propagation; Centrality theory; Centrality-based random scanning strategy; Anonymity-based random scanning strategy;
D O I
10.1007/978-3-319-56549-1_8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Smart devices interconnected through Internet became one of everyday items. In particular, we are now able to access Internet anywhere and anytime with our smartphones. To support the ad-hoc access to Internet by using smartphones, the computer network structure has become more complex. Also, a certain network node is highly connected to support the diverse Internet services. In this paper, we note that when a node is infected by malicious programs, their propagation speeds from the node with a high level of centrality will be faster than those from the node with a low level of centrality, which identifies the most important nodes within a network. From experiments under diverse worm propagation parameters and the well-known network topologies, we evaluate the influence of Centrality-based random scanning strategy on early worm propagation rate. Therefore, we show that centrality-based random scanning strategy, where an initial infected node selects the victim based on the level of centrality, can make random scanning worms propagate rapidly compared to Anonymity-based random scanning strategy, where an initial infected node selects the victim uniformly.
引用
收藏
页码:90 / 101
页数:12
相关论文
共 12 条
[1]  
Albert Reka., 2002, STAT MECH COMPLEX NE
[2]   Centrality and network flow [J].
Borgatti, SP .
SOCIAL NETWORKS, 2005, 27 (01) :55-71
[3]  
Chan Yi-Tung F., 2008, 2008 Third International Conference on Digital Information Management, P581, DOI 10.1109/ICDIM.2008.4746789
[4]  
Feng Chao-sheng, 2010, 2010 International Conference on Communications, Circuits and Systems (ICCCAS), P241, DOI 10.1109/ICCCAS.2010.5582004
[5]  
Kchiche Amine, 2010, 2010 17th International Conference on Telecommunications (ICT 2010), P700, DOI 10.1109/ICTEL.2010.5478800
[6]   Measurement and analysis of worm propagation on Internet network topology [J].
Kim, J ;
Radhakrishnan, S ;
Dhall, SK .
ICCCN 2004: 13TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2004, :495-500
[7]  
Mohammed A., 2011, Proceedings of the 2011 IEEE International Conference on Internet of Things and 4th IEEE International Conference on Cyber, Physical and Social Computing (iThings/CPSCom 2011), P653, DOI 10.1109/iThings/CPSCom.2011.29
[8]  
Wang Yongjian, 2011, Proceedings of the 2011 IEEE International Conference on Internet of Things and 4th IEEE International Conference on Cyber, Physical and Social Computing (iThings/CPSCom 2011), P756, DOI 10.1109/iThings/CPSCom.2011.49
[9]   Collective dynamics of 'small-world' networks [J].
Watts, DJ ;
Strogatz, SH .
NATURE, 1998, 393 (6684) :440-442
[10]  
Xiaojun T., 2010, 9 INT S DCABES 2010, P219