Byzantine Algorithms in Wireless Sensors Network

Abstract

In this paper we discuss classic concepts of byzantine failure tolerance that can be applied in fault-tolerant system design. Through replication of services (algorithmic computations) in a wireless sensors network, the system can operate in a reasonably correct manner even in presence of errors (e.g. faults). In distributed systems similar to wireless sensors networks - local disturbances or distortion problems can be resolved locally without involving the whole infrastructure. Our proposition is to demonstrate suitability of variants of byzantine algorithms based on additional information flow for solving such problems locally. By using byzantine algorithms we can ensure reduction of disturbances and fake or invalid alarms in a sensors field as well limit their range to a minimum. Whole problem is presented using a simulator that shows this algorithms during operation.