Loading...

Byzantine consensus for unknown dynamic networks

Taheri, E ; Sharif University of Technology | 2015

732 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s11227-015-1379-y
  3. Publisher: Kluwer Academic Publishers , 2015
  4. Abstract:
  5. 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
  6. Keywords:
  7. Byzantine fault-tolerant consensus ; Fault tolerant computer systems ; Telecommunication networks ; Asynchronous networks ; Byzantine Agreement ; Byzantine consensus ; Byzantine fault ; Consensus protocols ; Distributed systems ; Experiments and case studies ; Self-organizing systems ; Mobile ad hoc networks
  8. Source: Journal of Supercomputing ; Volume 71, Issue 4 , April , 2015 , Pages 1587-1603 ; 09208542 (ISSN)
  9. URL: http://link.springer.com/article/10.1007%2Fs11227-015-1379-y