Distributed Detection of Clone Attacks in Wireless Sensor Networks

被引:97
作者
Conti, Mauro [1 ]
Di Pietro, Roberto [2 ]
Mancini, Luigi Vincenzo [1 ]
Mei, Alessandro [1 ]
机构
[1] Univ Roma La Sapienza, Dipartimento Informat, I-00198 Rome, Italy
[2] Univ Rome Tre, Dipartimento Matemat, I-00146 Rome, Italy
关键词
Wireless sensor networks security; node replication attack detection; distributed protocol; resilience; efficiency; COMMUNICATION;
D O I
10.1109/TDSC.2010.25
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless Sensor Networks (WSNs) are often deployed in hostile environments where an adversary can physically capture some of the nodes, first can reprogram, and then, can replicate them in a large number of clones, easily taking control over the network. A few distributed solutions to address this fundamental problem have been recently proposed. However, these solutions are not satisfactory. First, they are energy and memory demanding: A serious drawback for any protocol to be used in the WSN-resource-constrained environment. Further, they are vulnerable to the specific adversary models introduced in this paper. The contributions of this work are threefold. First, we analyze the desirable properties of a distributed mechanism for the detection of node replication attacks. Second, we show that the known solutions for this problem do not completely meet our requirements. Third, we propose a new self-healing, Randomized, Efficient, and Distributed (RED) protocol for the detection of node replication attacks, and we show that it satisfies the introduced requirements. Finally, extensive simulations show that our protocol is highly efficient in communication, memory, and computation; is much more effective than competing solutions in the literature; and is resistant to the new kind of attacks introduced in this paper, while other solutions are not.
引用
收藏
页码:685 / 698
页数:14
相关论文
共 53 条
[1]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[2]  
Anderson R, 1996, PROCEEDINGS OF THE SECOND USENIX WORKSHOP ON ELECTRONIC COMMERCE, P1
[3]  
[Anonymous], 2002, P 9 ACM C COMPUT COM, DOI DOI 10.1145/586110.586117
[4]  
[Anonymous], AD HOC NETWORKS, DOI DOI 10.1016/S1570-8705(03)00008-8
[5]  
[Anonymous], **DROPPED REF**
[6]  
Becher A, 2006, LECT NOTES COMPUT SC, V3934, P104
[7]  
BETTSTETTER C, 2002, P 3 ACM INT S MOB AD, P80, DOI DOI 10.1145/513800.513811
[8]  
Bettstetter Christian., 2003, PROC ACM MSWIM, P28
[9]   On the detection of clones in sensor networks using random key predistribution [J].
Brooks, Richard ;
Govindaraju, P. Y. ;
Pirretti, Matthew ;
Vijaykrishnan, N. ;
Kandemir, Mahmut T. .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2007, 37 (06) :1246-1258
[10]  
Capkun S, 2005, IEEE INFOCOM SER, P1917