Efficient Malicious Agreement in a Virtual Subnet Network

The fault-tolerance is an important research topic in the study of distributed systems. To cope with the influence from faulty processors, reaching a common agreement in the presence of faults before performing certain special tasks is essential. Therefore, the Byzantine Agreement (BA) problem has drawn more researcher attention as they explore deeper into the world of distributed systems. Traditionally, the BA problem is solved in a wired network. However, the mobile computers have become increasingly popular. This environment encourages distributed system design and practices that support mobile processors. A mobile ad-hoc network (MANET) is different from a wired network. The processors have high mobility. Therefore, to enhance fault-tolerance and MANET reliability, the BA problem in virtual subnet of MANET is revised in this paper. The proposed protocol uses a minimum number of message exchange rounds and can tolerate the maximum number of allowable faulty components and make each fault-free processor reach a common agreement in the virtual subnet of MANET