Abstract
It is now well recognized that the Byzantine Agreement (BA) problem is a fundamental problem in implementing fault-tolerant distributed services. Traditionally, the BA problem is solved in the fully connected network or in the broadcast network. In this paper, BA problem is reexamined under the mobile network. The proposed protocol Byzantine Agreement under Mobile Network (BAMN) uses the minimum number of message exchanges to reach an agreement while tolerating the maximum number of faulty processors in the distributed system. It makes all the fault-free processors reach a common value to keep the system from the influences of processor failures.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
