Skip to main content
SpringerLink
Log in

Byzantine consensus for unknown dynamic networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In a distributed system, each solution for the problem of Byzantine agreement requires that some of the correct processes reach a common decision value from a set of proposed values while Byzantine processes may behave arbitrarily. While the problem has been widely studied in fully connected fixed networks, few studies have been carried out in the context of self-organizing mobile networks such as mobile ad hoc networks. We present a randomized consensus protocol with three additional modules for the case of dynamic networks: participant detectors, failure detectors and maintainer. We assume an asynchronous network with unknown participants where processes can be fixed or move continuously for departing or joining the network. We suppose that the channels are fair-lossy and the number of processes is unknown. In comparison with the related works, our system model is weaker which is more realistic. Also, the proposed protocol is more scalable and satisfies the strongest possible mobility condition in Byzantine agreement. Our experiments and case studies show that the number of execution rounds is significantly less than what is expected in the theoretical analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Pease M, Shostak R, Lamport L (1980) Reaching agreement in the presence of faults. J ACM (JACM) 27(2):228–234

    Article  MATH  MathSciNet  Google Scholar 

  2. Pease M, Shostak R, Lamport L (1982) The Byzantine generals problem. ACM Trans Program Lang Syst 4(3):382–401

    Article  MATH  Google Scholar 

  3. Correia M, Veronese GS, Neves NF, Verissimo P (2011) Byzantine consensus in asynchronous message-passing systems: a survey. Int J Crit Comput Based Syst 2(2):141–161

    Article  Google Scholar 

  4. Wang SS, Yan K-Q, Wang S-C (2010) An optimal solution for Byzantine agreement under a hierarchical. Comput Electric Eng (Elsevier) 36(1):100–113

    Article  MATH  Google Scholar 

  5. Chiang M-L (2012) Eventually Byzantine agreement on CDS-based mobile ad hoc network. Ad Hoc Netw 10(3):388–400

    Article  Google Scholar 

  6. Krings A, Feyer T (1999) The Byzantine agreement problem: optimal early stopping. In: Proceedings of the 32nd annual Hawaii international conference on systems sciences, 1999, HICSS-32, Maui

  7. Wu J (2002) Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Trans Parallel Distrib Syst 13(9):866–881

    Article  Google Scholar 

  8. Borran F, Prakash R, Schiper A (2008) Extending Paxos/LastVoting with an adequate communication layer for wireless ad hoc networks. In: Proceedings of the symposium on reliable distributed systems, SRDS, pp 227–236

  9. Charron-Bost B, Schiper A (2009) The heard-of model: computing in distributed systems with benign faults. Distribut Comput DC 22(1):49–71

    Article  MATH  Google Scholar 

  10. Arabnia HR, Bhandarkar SM (1996) Parallel stereocorrelation on a reconfigurable multi-ring network. J Supercomput 10(3):243–269

    Article  MATH  Google Scholar 

  11. Bhandarkar SM, Arabnia HR (1995) The REFINE multiprocessor: theoretical properties and algorithms. J Parallel Comput 21(11):1783–1805

    Article  Google Scholar 

  12. Cavin D, Sasson Y, Schiper A (2004) Consensus with unknown participants or fundamental self-organization, ad-hoc networks and wireless. In: Proceedings of the third international conference, ADHOC-NOW 2004, Vancouver, 22–24 July 2004, pp 135–148

  13. Cavin D, Sasson Y, Schiper A (2005) Reaching agreement with unknown participants in mobile self-organized networks in spite of process crashes. In: EPFL—LSR research report

  14. Greve F, Tixeuil S (2007) Knowledge connectivity vs. synchrony requirements for fault- tolerant agreement in unknown networks. In: 37th annual iEEE/IFIP international conference on dependable systems and networks, 2007, DSN ’07, pp 82–91, 25–28 June 2007

  15. Greve F, Tixeuil S (2010) Conditions for the solvability of fault-tolerant consensus in asynchronous unknown networks. In: Proceedings of the third international workshop on reliability, availability, and security, WRAS ’10

  16. Alchieri EAP, Bessani AN, Fraga JdS, Greve F (2008) Byzantine consensus with unknown participants, principles of distributed systems. In: Proceedings of the 12th international conference, OPODIS 2008, vol 5401, pp 22–40, Luxor, 15–18 December 2008

  17. Tsai J, Chang C-C (2010) A weaker knowledge connectivity condition sufficient for fault-tolerant consensus with unknown participants. In: Proceeding of the international computer software and applications conference, COMPSAC, pp 273–278

  18. Fisher M, Lynch N, Paterson M (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):374–382

    Article  Google Scholar 

  19. Costa V, Greve F (2008) Implementing fault-tolerant consensus over unknown networks. In: 7th international information and telecommunication technologies symposium

  20. Moniz H, Neves NF, Correia M, Veríssimo P (2006) Experimental comparison of local and shared coin randomized consensus protocols. In: Proceeding, reliable distributed systems, 2006. 25th IEEE symposium on SRDS ’06, pp 235–244

  21. Bracha G (1984) An asynchronous (n-1)/3-resilient consensus protocol. In: Proceedings of the third annual ACM symposium on principles of distributed computing, pp 154–162

  22. Cachin C, Kursawe K, Shoup V (2000) Random oracles in constantinople: practical asynchronous Byzantine agreement using cryptography. In: 19th ACM symposium on principles of distributed computing (PODC)

  23. Mostefaoui A, Mourgaya E, Raynal M (2003) Asynchronous implementation of failure detectors. In: Proceedings of the international IEEE conference on dependable systems and networks (DSN’03), pp 351–360

  24. Greve F, Sens P, Arantes L, Simon V (2012) Eventually strong failure detector with unknown membership. Comput J 55(12):1507–1524

    Article  Google Scholar 

  25. Lynch, N.: Distributed algorithms. Morgan Kaufmann, San Francisco (1997)

  26. Wanga S-C, Yanb K-Q (2006) Byzantine agreement under dual failure mobile network. Comput Stand Interfaces (Elsevier) 28(4):475–492

    Article  Google Scholar 

  27. Cornejo A, Lynch N, Viqar S, Welch JL (2009) Neighbor discovery in mobile ad hoc networks using an abstract MAC layer. In: Annual Allerton conference on communication, control, and computing, Allerton, Monticello

  28. Cornejo A, Viqar S, Welch JL (2010) Reliable neighbor discovery for mobile ad hoc networks. In: Proceeding DIALM-POMC ’10, Proceedings of the 6th international workshop on foundations of mobile computing, pp 259–277

  29. Chandra TD, Hadzilacos V, Toueg S (1996) The weakest failure detector for solving consensus. J ACM 43(4):685–722

    Article  MATH  MathSciNet  Google Scholar 

  30. Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225–267

    Article  MATH  MathSciNet  Google Scholar 

  31. Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Commun ACM 21(7):558–565

    Article  MATH  Google Scholar 

  32. Moniz H, Neves NF, Correia aM (2010) Turquois: Byzantine consensus in wireless ad hoc networks. In: Dependable systems and networks—DSN, pp 537–546

  33. Awerbuch B, Holmer D, Nita-Rotaru C, Rubens H (2002) An on-demand secure routing protocol resilient to byzantine failures. In: Proceedings of the 1st ACM workshop on wireless security, WiSE ’02, pp 21–30

  34. Casteigts A, Flocchini P, Quattrociocchi W, Santoro N (2011) Time-varying graphs and dynamic networks. In: Proceeding of the 10th international conference on ad hoc networks and wireless (ADHOC-NOW’11), pp 346–359

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Sharif University of Technology, Tehran, Iran

    Erfan Taheri & Mohammad Izadi

Authors
  1. Erfan Taheri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Izadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad Izadi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Taheri, E., Izadi, M. Byzantine consensus for unknown dynamic networks. J Supercomput 71, 1587–1603 (2015). https://doi.org/10.1007/s11227-015-1379-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-015-1379-y

Keywords

Search

Navigation