ACM Home Page
Please provide us with feedback. Feedback
Reporter node determination of replicated node detection in wireless sensor networks
Full text PdfPdf (769 KB)
Source Conference On Ubiquitous Information Management And Communication archive
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication table of contents
Suwon, Korea
SESSION: Sensor networks table of contents
Pages 566-573  
Year of Publication: 2009
ISBN:978-1-60558-405-8
Authors
Yuichi Sei  The University of Tokyo, Bunkyo-ku, Tokyo, Japan
Shinichi Honiden  National Institute of Informatics, Chiyoda-ku, Tokyo, Japan and The University of Tokyo, Bunkyo-ku, Tokyo, Japan
Sponsor
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 76,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1516241.1516340
What is a DOI?

ABSTRACT

In large-scale sensor networks, sensor nodes are at high risk of being captured and compromised. Once a sensor node is compromised, all the secret keys, data, and code stored on it are exposed to the attacker. The attacker can insert arbitrary malicious code in the compromised node. Moreover, he can easily replicate such code in a large number of clones and deploy them on the network. This node replication attack can form the basis of a variety of attacks such as DoS attacks and Sybil attacks. In the related studies, as a means of detecting compromised nodes, each node reports its neighbor's ID and location to a witness node with some probability p. The value of p is determined beforehand or from only the number of neighbor nodes. In this paper, we change p according to the locations of nodes. We aim to increase the detection rate of replicated node attacks and decrease the amount of messages. Our analysis and simulations demonstrate that using our protocol in combination with the methods of other studies is more effective than using the methods of the related studies by themselves.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
S. Capkun and J.-P. Hubaux. Secure positioning of wireless devices with application to sensor networks. In INFOCOM, pp. 1917--1928, 2005.
 
4
5
 
6
 
7
 
8
W. Du, J. Deng, Y. S. Han, S. Chen, and P. K. Varshney. A key management scheme for wireless sensor networks using deployment knowledge. In IEEE INFOCOM, 2004.
 
9
10
11
12
13
14
 
15
 
16
17
 
18
G. Wang, W. Zhang, G. Cao, and T. Porta. On supporting distributed collaboration in sensor networks. In IEEE MILCOM, 2003.
 
19
 
20
 
21
H. Yang, J. Shu, X. Meng, and S. Lu. SCAN: Self-organized network layer security in mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 24(2):261--273, 2006.
 
22
B. Zhu, V. G. K. Addada, S. Setia, S. Jajodia, and S. Roy. Efficient distributed detection of node replication attacks in sensor networks. In IEEE ACSAC, pp. 257--267, 2007.

Collaborative Colleagues:
Yuichi Sei: colleagues
Shinichi Honiden: colleagues