Loading...

Byzantine Agreement on Mobile Ad-Hoc Networks

Taheri, Erfan | 2014

893 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 45657 (52)
  4. University: Sharif University of Technology, International Campus, Kish Island
  5. Advisor(s): Izadi, Mohammad
  6. Abstract:
  7. In a distributed system, each solution for the problem of Byzantine Agreement requires that some of correct processes reach a common decision value from a set of proposed values while Byzantine processes may behave arbitrary. This problem is one of the most fundamental problems in the theory of distributed systems. 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.
    This research presents 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, move continuously, depart or join the network. We also take into consideration 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 and the proposed protocol has a more scalable approach. Moreover, the proposed protocol satisfies strongest possible mobility condition in Byzantine Agreement problem. In all of our experiments on the proposed protocol, rounds of execution is much lower than what is expected in theoretical analysis.
    An Asynchronous Accurate Byzantine Consensus is presented in order to minimize the effect of undetectable Byzantine failures when the system is required to reach agreement multiple times. Inaccurate processes are penalized after each independent inaccurate decision based on a reliable reward which is offered by the environment. We assume known participants and reliable links. In our proposed protocol, adversary is unable to determine its associated weights. Moreover, the proposed protocol utilizes a semantic message validation to ensure that the received message is congruent with the received messages in previous round of execution.
  8. Keywords:
  9. Distributed System ; Mobile Ad Hoc Network ; Byzantine Agreement ; Byzantine Consensus ; Fault-tolerant Consensus ; Accurate Agreement

 Digital Object List

 Bookmark

No TOC