Byzantine Agreement on Mobile Ad-Hoc Networks, M.Sc. Thesis Sharif University of Technology ; Izadi, Mohammad (Supervisor)
Abstract
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... Cataloging briefByzantine Agreement on Mobile Ad-Hoc Networks, M.Sc. Thesis Sharif University of Technology ; Izadi, Mohammad (Supervisor)
Abstract
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... Find in contentBookmark |
|