Reaching Agreement among Virtual Subnets in Hybrid Failure Mode

For improving the accuracy under P2P networks, it must be assured that all non-faulty peers can reach agreement. As such, all the non-faulty peers need to work collaboratively despite disturbances caused by faulty peers. This agreement issue is usually called as the Byzantine Agreement (BA) problem. In previous works, (n-1)/3 + 1 bouts for exchanging message are necessary to allow all non-faulty peers reaching an agreement. Furthermore, the message complexity of these algorithms are O(n n ). Hence, the relevant algorithms are not suitable for mobile P2P networks in which there may have a great quantity of mobile peers. 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 nonfaulty 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.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Reaching Agreement among Virtual Subnets in Hybrid Failure Mode

Cited by 11 publications

References 22 publications

Eventually Byzantine Agreement on CDS-based mobile ad hoc network

Eventually Byzantine Agreement on CDS-based mobile ad hoc network

Achieving efficient agreement within a dual-failure cloud-computing environment

Improvement of the Byzantine Agreement Problem under Mobile P2P Network

Contact Info

Product

Resources

About