Adaptive Voting Algorithms for Reliable Dissemintation of Data in Sensor Networks

A real-time data collection system in sensor network settings requires dealing with failures in the network and in the external environment: such as data corruptions by malicious devices and message timeliness violations in the network. Functional replication is employed to deal with such failures, with voting among the replica devices to move a correct data to the end-user. The goal of our paper is to develop a voting system that dynamically adapts its internal mechanisms to deal with various types of failures. The paper presents the design issues, with considerations of protocol correctness and performance. A goal is to reduce the message overhead - and hence the power drain on wireless connected sensor devices.

[1]  Nancy A. Lynch,et al.  Revisiting the PAXOS algorithm , 1997, Theor. Comput. Sci..

[2]  David H. Ackley,et al.  Building diverse computer systems , 1997, Proceedings. The Sixth Workshop on Hot Topics in Operating Systems (Cat. No.97TB100133).

[3]  Yunghsiang Sam Han,et al.  A witness-based approach for data fusion assurance in wireless sensor networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[4]  Shambhu Upadhyaya,et al.  Secure and fault-tolerant voting in distributed systems , 2001, 2001 IEEE Aerospace Conference Proceedings (Cat. No.01TH8542).

[5]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[6]  Michael K. Reiter,et al.  Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.

[7]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.