Self‐healing wireless sensor networks. (8th April 2015)

• Record Type: Journal Article
• Authors: Miyaji, Atsuko; Omote, Kazumasa; Xiang, Yang; Pathan, Mukaddim; Wei, Guiyi; Fortino, Giancarlo
• Is Part Of: Concurrency and computation. Volume 27:Number 10(2015:Jul.)
• Page Start: 2547
• Page End: 2568
• Publication Date: 2015-04-08
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3434
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3434-abs-0001"> <title>Summary</title> <p id="cpe3434-para-0001">Availability is very important for long‐term use of wireless sensor networks (WSNs), assuming the presence of an attacker. It is thus important to achieve secure communication among WSNs even if some sensor nodes are compromised. Self‐healing WSNs possess the feature that a network automatically <italic>self‐heals</italic> after node‐capture attacks in order to achieve availability. The self‐healing means that the ratio of compromised links decreases with time, even if the attacker corrupts sensor nodes of the network. In this paper, three kinds of self‐healing schemes for WSNs are described, a polynomial‐based self‐healing scheme, a simple random key pre‐distribution scheme with self‐healing, and a proactive co‐operative link self‐healing scheme. Our contributions are the self‐healing schemes with security evaluation, in which we conduct analytical evaluation and a simulation experiment of our schemes, and results obtained from both analysis and simulations indicate that our schemes are effective in self‐healing. Furthermore, comparing three schemes, we clarify each difference and discuss optimal scheme under each different environments. © 2015 The Authors. <italic>Concurrency and Computation: Practice and Experience</italic> Published by John Wiley &amp; Sons Ltd.</p> </abstract>