The Byzantine Agreement under Mobile Network

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.