Abstract
A peer-to-peer (P2P) network is composed of several peers. All peers may analyze data and then take some activities collaborate. Thus, assuring all healthy peers can reach agreement become very important. In real world, both peers and the transmission between peers may be malfunction, and this will cause the overall system works incorrectly. Furthermore, peers have mobility, and that will increase the complexity while managing the network. To overcome the mention problems, we improve the Byzantine Agreement (BA) Problem algorithm to make it more suitable for the mobile P2P network. The proposed protocol can use less rounds of message exchange than the traditional BA problem algorithm, and increase the reliability, correctness and efficiency for the mobile P2P network.
Sign-in/Register to access full text options 
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.
