CA based quick consensus in distributed system through network partitioning

This work reports an efficient solution of reaching agreement in a distributed system. The proposed solution operates on a system with faulty processes that take arbitrary finite time before crash. It is set to tolerate more faults compared to the classical Byzantine simultaneously reducing the volume of message exchanges. The introduction of Cellular Automata (CA) based network partitioning scheme minimizes the message exchange overhead while reaching an agreement. The simulation results establish that the proposed solution significantly reduces the message complexity as well as enhances the fault-tolerance of a system. The solution proposed is also found to be effective for the self-configuring, easily deployable, infrastructure free Mobile-Ad-Hoc-Network (MANET).