{"title":"Detection of Node Failure in Wireless Image Sensor Networks","authors":"A. Mahapatro, P. M. Khilar","doi":"10.5402/2012/342514","DOIUrl":null,"url":null,"abstract":"A sequenced process of fault detection followed by dissemination of decision made at each node characterizes the sustained operations of a fault-tolerant wireless image sensor network (WISN). This paper presents a distributed self-fault diagnosis model for WISN where fault diagnosis is achieved by disseminating decision made at each node. Architecture of fault-tolerant wireless image sensor nodes is presented. Simulation results show that sensor nodes with hard and soft faults are identified with high accuracy for a wide range of fault rate. Both time and message complexity of the proposed algorithm are 𝑂(𝑛) for an 𝑛-node WISN.","PeriodicalId":314840,"journal":{"name":"ISRN Sensor Networks","volume":"337 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISRN Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5402/2012/342514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26
Abstract
A sequenced process of fault detection followed by dissemination of decision made at each node characterizes the sustained operations of a fault-tolerant wireless image sensor network (WISN). This paper presents a distributed self-fault diagnosis model for WISN where fault diagnosis is achieved by disseminating decision made at each node. Architecture of fault-tolerant wireless image sensor nodes is presented. Simulation results show that sensor nodes with hard and soft faults are identified with high accuracy for a wide range of fault rate. Both time and message complexity of the proposed algorithm are 𝑂(𝑛) for an 𝑛-node WISN.