Improvement of the Byzantine Agreement Problem under Mobile P2P Network

In this study, a more efficient algorithm has been proposed to decrease the required bouts for exchanging message. Our proposed algorithm only need to run three bouts for exchanging message to allow all non-faulty peers to reach an agreement despite some peers roaming among the different network. It also can decrease the message complexity to O(n 2). It is more suitable and efficient than previous efforts aimed at the mobile P2P network.
Source: IERI Procedia - Category: Biomedical Engineering Source Type: research