This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 International Conferences on Computational Intelligence for Modelling, Control and Automation; Intelligent Agents, Web Technologies and Internet Commerce; and Innovation in Software Engineering
An Efficient Algorithm to Detect Faulty Reading in Wireless Sensor Network Using the Concept of Reputation
Vienna, Austria
December 10-December 12
ISBN: 978-0-7695-3514-2
This paper presents a novel approach for detecting faulty sensors as well as identifying the type of faults with a high degree of confidence using reputation concepts and introducing special nodes as beacon nodes to the network and with very low false alarm rate. Our algorithm is purely localized and thus scales well to large sensor networks as well as being efficient with respect to the amount of generated traffic and resource usage. The computational overhead for a sensor is low, since only simple operations are involved in each sensor node and main tasks are done in beacon nodes which have a lot of resources and number of them is low. The complexity of the algorithm is very low and the probability of correct diagnosis is very high even in the existence of large fault sets. Simulation results show the algorithm can clearly identify the faulty sensors with high degree of trust and low communications for sensors.
Index Terms:
Reputation-Fault detection-Wireless sensor network
Citation:
Zahra Taghikhaki, Mohsen Sharifi, "An Efficient Algorithm to Detect Faulty Reading in Wireless Sensor Network Using the Concept of Reputation," cimca, pp.969-974, 2008 International Conferences on Computational Intelligence for Modelling, Control and Automation; Intelligent Agents, Web Technologies and Internet Commerce; and Innovation in Software Engineering, 2008
Usage of this product signifies your acceptance of the Terms of Use.