Abstract
In node capture attacks, an attacker intellectually captures nodes and extracts cryptographic keys from their memories to wreck security, reliability and confidentiality of wireless sensor networks. Previous methods suffered from low attacking efficiency and neglected resource expenditure. A novel method of modeling the node capture attack is proposed aiming at maximizing destructiveness while minimizing resource expenditure. We convert routing paths into abstracted vertexes and formalize hybrid graph model for the network. A property called destructive value is defined for expressing the destructiveness of attacking a node. We develop a Greedy AttaCking algoRithm named GACR on the hybrid graph. An attacker is able to maximize the destructiveness of the attack while constructing the shortest Hamiltonian cycle to reduce resource expenditure. At last, extensive simulations are conducted to show the advantages of our scheme. Simulation results demonstrate that, GACR can reduce the attacking times, enhance the attacking efficiencies and save energy cost in compromising the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wu, G., Chen, X., Obaidat, M.S., Lin, C.: A high efficient node capture attack algorithm in wireless sensor network based on route minimum key set. Secur. Commun. Netw. 6(2), 230–238 (2013)
Tague, P., Lee, J., Poovendran, R.: A set-covering approach for modeling attacks on key predistribution in wireless sensor networks. In: Third International Conference on Intelligent Sensing and Information Processing, ICISIP 2005, pp. 254–259. IEEE (2005)
Tague, P., Poovendran, R.: A canonical seed assignment model for key predistribution in wireless sensor networks. ACM Trans. Sens. Netw. (TOSN) 3(4), 19-es (2007)
Tague, P.: Identifying, modeling, and mitigating attacks in wireless ad-hoc and sensor networks. PhD thesis, University of Washington (2009)
Lin, C., Wu, G.: Enhancing the attacking efficiency of the node capture attack in WSN: a matrix approach. J. Supercomputing 66(2), 989–1007 (2013)
Lin, C., Wu, G., Xia, F., Yao, L.: Enhancing efficiency of node compromise attacks in vehicular ad-hoc networks using connected dominating set. Mob. Netw. Appl. 18(6), 908–922 (2013)
Lin, C., Wu, G., Yim, K., Yao, L., Hou, G.: Compromising ad-hoc networks by attacking weakly connected dominating set. In: The 9-th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS 2015). IEEE (2015) (to appear)
Lin, C., Wu, G., Yu, C.W., Yao, L.: Maximizing destructiveness of node capture attack in wireless sensor networks. J. Supercomputing (2015) (to appear) doi:10.1007/s11227-015-1435-7
Tague, P., Slater, D., Rogers, J., Poovendran, R.: Vulnerability of network traffic under node capture attacks using circuit theoretic analysis. In: The 27th Conference on Computer Communications, INFOCOM 2008, IEEE, pp. 161–165. IEEE (2008)
Tague, P., Slater, D., Rogers, J., Poovendran, R.: Evaluating the vulnerability of network traffic using joint security and routing analysis. IEEE Trans. Dependable Secure Comput. 6, 111–123 (2008)
Liu, D., Ning, P., Li, R.: Establishing pairwise keys in distributed sensor networks. ACM Trans. Inf. Syst. Secur. (TISSEC) 8(1), 41–77 (2005)
Perkins, C., Belding-Royer, E., Das, S., et al.: Ad hoc on-demand distance vector (AODV) routing (2003)
Schurgers, C., Srivastava, M.: Energy efficient routing in wireless sensor networks. In: Military Communications Conference on Communications for Network-Centric Operations: Creating the Information Force, IEEE, MILCOM 2001, vol. 1, pp. 357–361. IEEE (2001)
Jain, K.: Security based on network topology against the wiretapping attack. IEEE Wirel. Commun. 11(1), 68–71 (2004)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine* 1. Comput. Netw. ISDN Syst. 30(1–7), 107–117 (1998)
Langville, A., Meyer, C.: Google Page Rank and Beyond. Princeton University Press, Princeton (2006)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensornetworks (2003)
Eschenauer, L., Gligor, V.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41–47. ACM (2002)
Akkaya, K., Younis, M.: A survey on routing protocols for wireless sensor networks. Ad hoc Netw. 3(3), 325–349 (2005)
Acknowledgments
This research is sponsored in part by the National Natural Science Foundation of China (No.61173179, No.61202443 and No.61402078), Major National Science and Technology Special Projects High-Nuclear-Based Project of China under Grant (No. 2012ZX01039-004-21 and No. 2012ZX01039-004-44) and Program for New Century Excellent Talents in University (NCET-13-0083). This research is also sponsored in part supported by the Fundamental Research Funds for the Central Universities (No.DUT14RC(3)090) and Major State Basic Research Development Program of China (973 Program), No.201300185.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Lin, C., Wu, G., Lai, X., Qiu, T. (2015). Minimizing Resource Expenditure While Maximizing Destructiveness for Node Capture Attacks. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9530. Springer, Cham. https://doi.org/10.1007/978-3-319-27137-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-27137-8_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27136-1
Online ISBN: 978-3-319-27137-8
eBook Packages: Computer ScienceComputer Science (R0)