Turquois: Byzantine consensus in wireless ad hoc networks

The operation of wireless ad hoc networks is intrinsically tied to the ability of nodes to coordinate their actions in a dependable and efficient manner. The failure of some nodes and momentary breakdown of communications, either of accidental or malicious nature, should not result in the failure of the entire system. This paper presents Turquois - an intrusion-tolerant consensus protocol specifically designed for resource-constrained wireless ad hoc networks. Turquois allows an efficient utilization of the broadcasting medium, avoids synchrony assumptions, and refrains from public-key cryptography during its normal operation. The protocol is safe despite the arbitrary failure of f < n over 3 processes from a total of n processes, and unrestricted message omissions. The protocol was prototyped and subject to a comparative performance evaluation against two well-known intrusion-tolerant consensus protocols. The results show that, as the system scales, Turquois outperforms the other protocols by more than an order of magnitude.

[1]  Miguel Correia,et al.  Intrusion-Tolerant Architectures: Concepts and Design , 2002, WADS.

[2]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[3]  Jiannong Cao,et al.  Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks , 2007, IEEE Transactions on Computers.

[4]  Nitin H. Vaidya,et al.  Reliable broadcast in radio networks: the bounded collision case , 2006, PODC '06.

[5]  Abdelmadjid Bouabdallah,et al.  Solving the consensus problem in a dynamic group: an approach suitable for a mobile environment , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[6]  André Schiper,et al.  The Heard-Of model: computing in distributed systems with benign faults , 2009, Distributed Computing.

[7]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[8]  Murat Demirbas,et al.  Consensus and collision detectors in wireless Ad Hoc networks , 2005, PODC '05.

[9]  Victor Shoup,et al.  Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.

[10]  Paul D. Ezhilchelvan,et al.  Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts , 2006, SAC '06.

[11]  Idit Keidar,et al.  Impossibility Results and Lower Bounds for Consensus under Link Failures , 2008, SIAM J. Comput..

[12]  Nicola Santoro,et al.  Time is Not a Healer , 1989, STACS.

[13]  Nicola Santoro,et al.  Agreement in synchronous networks with ubiquitous faults , 2007, Theor. Comput. Sci..

[14]  Nitin H. Vaidya,et al.  On reliable broadcast in a radio network , 2005, PODC '05.

[15]  Miguel Correia,et al.  Intrusion Tolerance in Wireless Environments: An Experimental Evaluation , 2007 .

[16]  Gabriel Bracha,et al.  An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.

[17]  Fred B. Schneider,et al.  COCA: a secure distributed online certification authority , 2002 .

[18]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[19]  Jonathan Kirsch,et al.  Scaling Byzantine Fault-Tolerant Replication toWide Area Networks , 2006, International Conference on Dependable Systems and Networks (DSN'06).

[20]  Miguel Correia,et al.  The Crutial Way of Critical Infrastructure Protection , 2008, IEEE Security & Privacy Magazine.

[21]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[22]  André Schiper,et al.  Tolerating corrupted communication , 2007, PODC '07.

[23]  Andrzej Pelc,et al.  Broadcasting with locally bounded Byzantine faults , 2005, Inf. Process. Lett..

[24]  Mike Hibler,et al.  An integrated experimental environment for distributed systems and networks , 2002, OPSR.

[25]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[26]  Miguel Correia,et al.  Randomization can be a healer: consensus with dynamic omission failures , 2010, Distributed Computing.

[27]  Alysson Neves Bessani,et al.  Byzantine Consensus with Unknown Participants , 2008, OPODIS.

[28]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[29]  André Schiper,et al.  Extending Paxos/LastVoting with an Adequate Communication Layer for Wireless Ad Hoc Networks , 2008, 2008 Symposium on Reliable Distributed Systems.

[30]  Michael K. Reiter,et al.  The Rampart Toolkit for Building High-Integrity Services , 1994, Dagstuhl Seminar on Distributed Systems.

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

[32]  Miguel Correia,et al.  Worm-IT - A wormhole-based intrusion-tolerant group communication system , 2007, J. Syst. Softw..

[33]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[34]  Roy Friedman,et al.  Efficient Byzantine broadcast in wireless ad-hoc networks , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[35]  Chiu-Yuen Koo,et al.  Broadcast in radio networks tolerating byzantine adversarial behavior , 2004, PODC '04.

[36]  Raimundo José de Araújo Macêdo,et al.  Solving the consensus problem in a mobile environment , 1999, 1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305).

[37]  Paul D. Ezhilchelvan,et al.  Design and performance-study of crash-tolerant protocols for broadcasting and reaching consensus in MANETs , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

[38]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .