Skip to main content

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

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10144))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Wikipedia. https://ko.wikipedia.org/wiki/%EC%9B%9C

  2. Zou, C.C., Gong, W., Towsley, D.: Code red worm propagation modeling and analysis, In: ACM, pp. 138–147 (2002)

    Google Scholar 

  3. Chao-shengl, F., Zhi-guang, Q., Ding, Y., Xia, L., Jian-jun, W.: Modeling passive worm propagation in mobile P2P networks. In: ICCCAS International Conference, pp. 241–244 (2010)

    Google Scholar 

  4. Kim, J., Radhakrishnan, S., Dhall, S.K.: Measurement and analysis of worm propagation on Internet network topology. In: Proceedings of ICCCN 2004, pp. 495–500 (2004)

    Google Scholar 

  5. Mohammed, A., Nor, S.M., Marsono, M.N.: Network worm propagation model based on a campus network topology. In: ITHINGSCPSCOM 2011, pp. 653–659 (2011)

    Google Scholar 

  6. Xiaojun, T., Zhangquan, Z., Huimin, S., Zhu, W.: The analysis of worm non-linear propagation model and the design of worm distributed detection technology: In: Ninth International Symposium on DCABES 2010, pp. 219–223 (2010)

    Google Scholar 

  7. Chan, Y.-T.F., Shoniregun, C.A., Akmayeva, G.A.: A NetFlow based internet-worm detecting system in large network. In: ICDIM 2008, pp. 581–586 (2008)

    Google Scholar 

  8. Yongjian, W., Bin, F., Shupeng, W.: The rapid worm detecting technology in large-scale network. In: Proceedings of the 2011 International Conference on Internet of Things and 4th International Conference on Cyber, Physical and Social Computing, pp. 756–761 (2011)

    Google Scholar 

  9. Borgatti, S.P.: Centrality and network flow. Soc. Networks 27(1), 55–71 (2005). (Elsevier)

    Article  MathSciNet  Google Scholar 

  10. Network Centrality. http://cs.brynmawr.edu/Courses/cs380/spring2013/section02/slides/05_Centrality.pdf

  11. Kchiche, A., Kamoun, F.,: Centrality-based access-points deployment for vehicular networks. In: 2010 IEEE 17th International Conference on Telecommunications (ICT), pp. 700–706 (2010)

    Google Scholar 

  12. Wei, Z., Facheng, Q., Shiqi, C., Ruchuan, W.: The study of network worm propagation simulation. In: ICCASM 2010, pp. 295–299 (2010)

    Google Scholar 

  13. GraphStream. http://graphstream-project.org

  14. Albert, R., Barabási, A.-L.: Statistical Mechanics of Complex Networks (2002)

    Google Scholar 

  15. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partly supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIP) (No. 10043907, Development of high performance IoT device and Open Platform with Intelligent Software) and basic science research program through national research foundation korea (NRF) funded by the ministry of education (NRF-2013R1A1A1005991).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yoon-Ho Choi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kown, Sk., Jang, B., Lee, BD., Do, Y., Baek, H., Choi, YH. (2017). Influence Evaluation of Centrality-Based Random Scanning Strategy on Early Worm Propagation Rate. In: Choi, D., Guilley, S. (eds) Information Security Applications. WISA 2016. Lecture Notes in Computer Science(), vol 10144. Springer, Cham. https://doi.org/10.1007/978-3-319-56549-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-56549-1_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-56548-4

  • Online ISBN: 978-3-319-56549-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics