Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Byzantine Agreement in a Generalized Connected Network
IEEE Transactions on Parallel and Distributed Systems
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Consensus With Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
Optimistic Byzantine Agreement
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
How to Tolerate Half Less One Byzantine Nodes in Practical Distributed Systems
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Byzantine Agreement Protocol using Hierarchical Groups
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
SKIP: A Secure Key Issuing Scheme for Peer-to-Peer Networks
ICNS '09 Proceedings of the 2009 Fifth International Conference on Networking and Services
Distributed Key Generation for the Internet
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Computer Standards & Interfaces
Computers and Electrical Engineering
A fault-tolerant scheme for an autonomous local wireless sensor network
Computer Standards & Interfaces
Achieving efficient agreement within a dual-failure cloud-computing environment
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In an autonomous network environment, each independent node communicates with others by some agreement mechanism to make sure that the majority of nodes can take a common corresponding action. Under a constraint on the amount of faulty nodes, the classical solution, Byzantine Agreement (BA), has been proved to effectively make all healthy nodes able to obey the same command issued from the commander node. The major challenge for BA is its considerable amount of exchanged messages among nodes to reach the consensus, especially when BA is applied to a network environment, which comprises a lot of cooperative nodes. Such a situation may hinder BA from being practically applied in the modern network environment, such as an autonomous wireless sensor network. Thus, we propose a Virtual Grouping Byzantine Agreement (VGBA) scheme to compromise between the percentage of nodes, which can obtain the common command, and the number of exchanged messages produced in the network. That means that VGBA may suffer a lower tolerance capability of faulty nodes and a lower percentage of healthy nodes having the command, but it significantly reduces the message volume. Consequently, the improved VGBA scheme is still applicable while facing a larger number of nodes.