Detecting Compromised Sensor Nodes with Group Verification

Abstract

Abstract. To detect compromised sensor node, current solutions fail to resist the collusion attack. To address it, in this paper, we propose a novel solution called group verification. The key idea of group verification is that neighbor nodes and sink node cooperate to detect the compromised node. If one sink node want to check one suspicious node, every neighbor node contribute to pose a question for the suspicious node with secret sharing scheme, and sink node introduces its random number into the question. Thus one compromised neighbor node fail to disturb the question distribution. To expose illegal question, every question is accompanying with one checking token which is generated with one private checking key. The suspicious node recovers the question by collecting enough shares. After that, the suspicious node floods the answer, and its neighbor nodes all verify the answer with the help of sink node. Our discussion shows our solution is capable of detecting the collusion attack.