On the Detection of Clones in Sensor Networks Using Random Key Predistribution

  • Authors:
  • R. Brooks;P. Y. Govindaraju;M. Pirretti;N. Vijaykrishnan;M. T. Kandemir

  • Affiliations:
  • Clemson Univ., Clemson;-;-;-;-

  • Venue:
  • IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Random key predistribution security schemes are well suited for use in sensor networks due to their low overhead. However, the security of a network using predistributed keys can be compromised by cloning attacks. In this attack, an adversary breaks into a sensor node, reprograms it, and inserts several copies of the node back into the sensor network. Cloning gives the adversary an easy way to build an army of malicious nodes that can cripple the sensor network. In this paper, we propose an algorithm that a sensor network can use to detect the presence of clones. Keys that are present on the cloned nodes are detected by looking at how often they are used to authenticate nodes in the network. Simulations verify that the proposed method accurately detects the presence of clones in the system and supports their removal. We quantify the extent of false positives and false negatives in the clone detection process.