Towards efficient stabilizing code dissemination in wireless sensor networks

Sain Saginbekov, Arshad Jhumka

Research output: Contribution to journalArticle

Abstract

One important component of network reprogramming is code dissemination (CD), when the updated program code is distributed to the relevant nodes. Very few CD protocols tolerate transient faults that corrupt the state and these faults can cause the old code to disseminate in the network. We propose two protocols called BestEffort-Repair and Consistent-Repair that transform fault-intolerant CD protocols into non-masking fault-tolerant protocols where, eventually, all nodes obtain the new code. We conduct experiments with both protocols on TelosB-like motes and over TOSSIM simulations to show their correctness and also their performance. We conduct a case study whereby both protocols are added to a state-of-the-art CD protocol, namely Varuna to evaluate their impact on Varuna. Our results show that (i) Varuna, which is fault-intolerant, is transformed into a stabilizing CD protocol; (ii) they induce low overhead on Varuna, and cause all nodes to eventually receive the new code. BestEffort-Repair is biased towards fast recovery, whereas Consistent-Repair attempts to reduce the number of erroneous downloads in the network. Our main contribution is the first corrector protocols that correct CD in the presence of transient faults.

Original languageEnglish
Pages (from-to)1790-1816
Number of pages27
JournalComputer Journal
Volume57
Issue number12
DOIs
Publication statusPublished - Jul 5 2013
Externally publishedYes

Fingerprint

Wireless sensor networks
Network protocols
Repair
Transform faults
Recovery

Keywords

  • code dissemination
  • error detection
  • non-masking fault tolerance
  • transient faults
  • wireless sensor networks

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Towards efficient stabilizing code dissemination in wireless sensor networks. / Saginbekov, Sain; Jhumka, Arshad.

In: Computer Journal, Vol. 57, No. 12, 05.07.2013, p. 1790-1816.

Research output: Contribution to journalArticle

@article{8fc1df8e38394359b9d53e41bedcef6b,
title = "Towards efficient stabilizing code dissemination in wireless sensor networks",
abstract = "One important component of network reprogramming is code dissemination (CD), when the updated program code is distributed to the relevant nodes. Very few CD protocols tolerate transient faults that corrupt the state and these faults can cause the old code to disseminate in the network. We propose two protocols called BestEffort-Repair and Consistent-Repair that transform fault-intolerant CD protocols into non-masking fault-tolerant protocols where, eventually, all nodes obtain the new code. We conduct experiments with both protocols on TelosB-like motes and over TOSSIM simulations to show their correctness and also their performance. We conduct a case study whereby both protocols are added to a state-of-the-art CD protocol, namely Varuna to evaluate their impact on Varuna. Our results show that (i) Varuna, which is fault-intolerant, is transformed into a stabilizing CD protocol; (ii) they induce low overhead on Varuna, and cause all nodes to eventually receive the new code. BestEffort-Repair is biased towards fast recovery, whereas Consistent-Repair attempts to reduce the number of erroneous downloads in the network. Our main contribution is the first corrector protocols that correct CD in the presence of transient faults.",
keywords = "code dissemination, error detection, non-masking fault tolerance, transient faults, wireless sensor networks",
author = "Sain Saginbekov and Arshad Jhumka",
year = "2013",
month = "7",
day = "5",
doi = "10.1093/comjnl/bxt110",
language = "English",
volume = "57",
pages = "1790--1816",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "12",

}

TY - JOUR

T1 - Towards efficient stabilizing code dissemination in wireless sensor networks

AU - Saginbekov, Sain

AU - Jhumka, Arshad

PY - 2013/7/5

Y1 - 2013/7/5

N2 - One important component of network reprogramming is code dissemination (CD), when the updated program code is distributed to the relevant nodes. Very few CD protocols tolerate transient faults that corrupt the state and these faults can cause the old code to disseminate in the network. We propose two protocols called BestEffort-Repair and Consistent-Repair that transform fault-intolerant CD protocols into non-masking fault-tolerant protocols where, eventually, all nodes obtain the new code. We conduct experiments with both protocols on TelosB-like motes and over TOSSIM simulations to show their correctness and also their performance. We conduct a case study whereby both protocols are added to a state-of-the-art CD protocol, namely Varuna to evaluate their impact on Varuna. Our results show that (i) Varuna, which is fault-intolerant, is transformed into a stabilizing CD protocol; (ii) they induce low overhead on Varuna, and cause all nodes to eventually receive the new code. BestEffort-Repair is biased towards fast recovery, whereas Consistent-Repair attempts to reduce the number of erroneous downloads in the network. Our main contribution is the first corrector protocols that correct CD in the presence of transient faults.

AB - One important component of network reprogramming is code dissemination (CD), when the updated program code is distributed to the relevant nodes. Very few CD protocols tolerate transient faults that corrupt the state and these faults can cause the old code to disseminate in the network. We propose two protocols called BestEffort-Repair and Consistent-Repair that transform fault-intolerant CD protocols into non-masking fault-tolerant protocols where, eventually, all nodes obtain the new code. We conduct experiments with both protocols on TelosB-like motes and over TOSSIM simulations to show their correctness and also their performance. We conduct a case study whereby both protocols are added to a state-of-the-art CD protocol, namely Varuna to evaluate their impact on Varuna. Our results show that (i) Varuna, which is fault-intolerant, is transformed into a stabilizing CD protocol; (ii) they induce low overhead on Varuna, and cause all nodes to eventually receive the new code. BestEffort-Repair is biased towards fast recovery, whereas Consistent-Repair attempts to reduce the number of erroneous downloads in the network. Our main contribution is the first corrector protocols that correct CD in the presence of transient faults.

KW - code dissemination

KW - error detection

KW - non-masking fault tolerance

KW - transient faults

KW - wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=84922489417&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84922489417&partnerID=8YFLogxK

U2 - 10.1093/comjnl/bxt110

DO - 10.1093/comjnl/bxt110

M3 - Article

VL - 57

SP - 1790

EP - 1816

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 12

ER -