A note-based randomized and distributed protocol for detecting node replication attacks in wireless sensor networks

  • Authors:
  • Xiangshan Meng;Kai Lin;Keqiu Li

  • Affiliations:
  • Department of Computer Science and Engineering, Dalian University of Technology, Dalian, China;Department of Computer Science and Engineering, Dalian University of Technology, Dalian, China;Department of Computer Science and Engineering, Dalian University of Technology, Dalian, China

  • Venue:
  • ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Wireless sensor networks are often deployed in hostile environments and sensor nodes are lack hardware support for resistance; thus, leaving them vulnerable to several kinds of threats and attacks While most of threats and attacks can be prevented by using cryptographic approaches provided by key management, such as eavesdropping, intrusion and node compromising Unfortunately node replication attacks can still go undetectable In node replication attacks, an attacker compromising a node, uses its secret cryptographic key materials to populate the network with several clones of it Several node replication detect protocols were proposed However, centralized protocols have a single point of failure, local protocols fail to detect distributed replications, and distributed protocols need nodes know their exact geographic locations This paper proposes a note-based protocol for detecting node replication attacks, which introduces no significant overhead on the resource-constrained sensors The proposed protocol needn't the geographic locations of nodes as well Moreover, further analysis shows that it achieves a much higher probability of detecting replications.