DocumentCode
2882981
Title
Byzantine Algorithms in Wireless Sensors Network
Author
Klempous, Ryszard ; Nikodem, Jan ; Radosz, Lukasz ; Raus, Norbert
Author_Institution
Wroclaw Univ. of Technol., Wroclaw
fYear
2006
fDate
15-17 Dec. 2006
Firstpage
319
Lastpage
324
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.
Keywords
fault tolerance; wireless sensor networks; Byzantine algorithm; Byzantine failure tolerance; fault-tolerant system design; wireless sensors network; Clustering algorithms; Computer errors; Computer networks; Energy consumption; Energy management; Fault tolerance; Fault tolerant systems; Power system reliability; Sensor systems; Wireless sensor networks; component; formatting; insert; style; styling;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Automation, 2006. ICIA 2006. International Conference on
Conference_Location
Shandong
Print_ISBN
1-4244-0555-6
Electronic_ISBN
1-4244-0555-6
Type
conf
DOI
10.1109/ICINFA.2006.374140
Filename
4250230
Link To Document