›› 2011, Vol. 26 ›› Issue (4): 732-743.doi: 10.1007/s11390-011-1172-1

Special Issue: Computer Networks and Distributed Computing

• Information Security • Previous Articles     Next Articles

A New Protocol for the Detection of Node Replication Attacks in Mobile Wireless Sensor Networks

Xiao-Ming Deng (邓晓明) and Yan Xiong (熊焰) Membership IEEE, ACM, CCF   

  1. School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, China
  • Received:2009-06-16 Revised:2011-05-03 Online:2011-07-05 Published:2011-07-05
  • Supported by:

    This work is partly supported by the National Natural Science Foundation of China under Grant No. 90818007, the National High Technology Research and Development 863 Program of China under Grant No. 2009AA01Z203.

Wireless sensor networks (WSNs) are often deployed in harsh environments. Thus adversaries can capture some nodes, replicate them and deploy those replicas back into the strategic positions in the network to launch a variety of attacks. These are referred to as node replication attacks. Some methods of defending against node replication attacks have been proposed, yet they are not very suitable for the mobile wireless sensor networks. In this paper, we propose a new protocol to detect the replicas in mobile WSNs. In this protocol, polynomial-based pair-wise key pre-distribution scheme and Counting Bloom Filters are used to guarantee that the replicas can never lie about their real identifiers and collect the number of pair-wise keys established by each sensor node. Replicas are detected by looking at whether the number of pair-wise keys established by them exceeds the threshold. We also derive accurate closed form expression for the expected number of pair-wise keys established by each node, under commonly used random waypoint model. Analyses and simulations verify that the protocol accurately detects the replicas in the mobile WSNs and supports their removal.

[1] Akyildiz I F, Su W, Sankarasubramaniam Y, Cayirci E. A survey onsensor networks. IEEE Communications Magazine, 2002, 40(8):102-114.



[2] Chan H, Perrig A. Security and privacy in sensor networks. Computer, 2003, 36(10): 103-105.



[3] Parno B, Perrig A, Gligor V. Distributed detection of nodereplication attacks in sensor networks. In Proc. IEEE Symposium onSecurity and Privacy, Oakland, USA, May 8-11, 2005, pp.49-63.



[4] Conti M, Di Pietro R, Mancini L V, Mei A. A randomized, efficient,and distributed protocol for the detection of node replication attacksin wireless sensor networks. In Proc. the 8th ACM InternationalSymposium on Mobile Ad Hoc Networking and Computing, New York, USA,Sept.9-14, 2007, pp.80-89.



[5] Zhu B, Addada V G K, Setia S, Jajodia S, Roy S. Efficientdistributed detection of node replication attacks in sensor networks.In Proc. the 23rd Annual Computer Security Applications Conference,Miami Beach, USA, Dec.10-14, 2007, pp.257-267.



[6] Bekara C, Laurent-Maknavicius M. A New protocol for securingwireless sensor networks against nodes replication attacks. In Proc. the 3rd IEEE International Conference on Wireless and MobileComputing, Networking and Communications, White Plains, USA, Oct.8-10,2007, pp.59-59.



[7] Xing K, Liu F, Cheng X, Du D H C. Real-time detection of cloneattacks in wireless sensor networks, In Proc. the 28th InternationalConference on Distributed Computing Systems, Beijing, China Jun.17-20, 2008,pp.3-10.



[8] Brooks R, Govindaraju P Y, Pirretti M, Vijaykrishnan N, Kandemir MT. On the detection of clones in sensor networks using random keypredistribution. IEEE Trans. Systems, Man, and Cybernetics,2007, 37(6): 1246-1258.



[9] Fu F, Liu J, Yin X. Space-time related pairwise keypredistribution scheme for wireless sensor networks. In Proc. Int.Conference on Wireless Communications, Networking and MobileComputing, Shanghai, China, Sept.21-25, 2007, pp.2692-2696.



[10] Yu C, Lu C, Kuo S. Mobile sensor network resilient against nodereplication attacks. In Proc. the 5th Annual IEEE CommunicationsSociety Conference on Sensor, Mesh and Ad Hoc Communications andNetworks, San Francisco, USA, Jun.16-20, 2008, pp.597-599.



[11] Johnson D B, Maltz D A. Dynamic source routing in ad hoc wirelessnetworks. Mobile Computing, 1996, 353: 153-181.



[12] Sichitiu M L, Veerarittiphan C. Simple, accurate timesynchronization for wireless sensor networks. In Proc. WirelessCommunications and Networking, New Orleans, USA, Mar.20, 2003,pp.1266-1273.



[13] Kyoung-lae N, Serpedin E, Qaraqe K. A new approach for timesynchronization in wireless wensor networks: Pairwise broadcastsynchronization. IEEE Trans. Wireless Communications, 2008,7(9): 3318-3322.



[14] Blundo C, Suntis A D, Herzbeg A, Kutten S, Vaccaro U, Yung M.Perfectly secure key distribution for dynamic conferences. In Proc. the 12th Annual Int. Cryptology Conference on Advances inCryptology, Santa Barbara, USA, Aug.16-20, 1992, pp.471-486.



[15] Blom R. An optimal class of symmetric key generation systems.In Proc. EUROCRYPT,1984 Workshop on Advances in Cryptology: Theoryand Application of Cryptographic Techniques, 1985, pp.335-338.



[16] Blundo C, Santis A D, Herzberg A, Kutten S, Vaccaro U, Yung M.Perfectly-secure key distribution for dynamic conferences. In Proc. the 12th Annual Int. Cryptology Conference on Advances inCryptology, Santa Barbara, USA, Aug.16-20, 1992, pp.471-486.



[17] Perrig A, Szewczyk R, Tygar J D, Wen V, Culler D E. SPINS:Security protocols for sensor networks. Wirel. Netw., Sept., 2002,8(5): 521-534.



[18] Bloom B H. Space/time trade-offs in hash coding with allowableerrors. Commun. ACM, 1970, 13(7): 422-426.



[19] Bonomi F, Mitzenmacher M, Panigrahy R, Singh S, Varghese G. Animproved construction for Counting Bloom Filters. In Proc. the 14thConference on Annual European Symposium, Zurich, Switzerland,Sept.11-13, 2006, pp.684-695.



[20] Fan L, Cao P, Almeida J, Broder A Z. Summary cache: A scalablewide-area Web cache sharing protocol. IEEE/ACM Trans. Networking,2000, 8(3): 281-293.



[21] Huffman D A. A method for the construction of minimum-redundancycodes. Proc. I.R.E., September, 1952, 40(9): 1098-1101.



[22] Lin G, Noubir G, Rajaraman R. Mobility models for ad hoc networksimulation. In Proc. the 23rd Annual Joint Conf. IEEE Computer andCommunications Societies, Hong Kong, China, Mar.7-11, 2004, p.463.



[23] Bettstetter C, Hartenstein H, Pérez-Costa X. Stochasticproperties of the random waypoint mobility model: Epoch length,direction distribution, and cell change rate. In Proc. the 5th ACMInt. Workshop on Modeling Analysis and Simulation of Wireless andMobile Systems, Atlanta, USA, Sept.28, 2002, pp.7-14.



[24] Karlof C, Wagner D. Secure routing in wireless sensor networks:Attacks and countermeasures. In Proc. the 1st IEEE Int. Workshop onSensor Network Protocols and Applications, Anchrorage, USA, May 11, 2003,pp.113-127.



[25] Deng H, Li W, Agrawal D P. Routing security in wireless ad hocnetworks. Communications Magazine, IEEE, 2002, 40(10): 70-75.



[26] Brooks R R, Iyengar S S. Multi-Sensor Fusion: Fundamentals andApplications with Software. Upper Saddle River: Prentice-Hall, NJ, 1998.



[27] Watts D. Small Worlds. Princeton: Princeton Univ. Press, NJ, 1999.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved