Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Information and Computation
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logic Programming - New Frontiers
Logic Programming - New Frontiers
The Byzantine Agreement Problem: Optimal Early Stopping
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
IEEE Transactions on Computers
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts
IEEE Transactions on Software Engineering
Operating System Concepts
Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing
IEEE Transactions on Dependable and Secure Computing
An Efficient Byzantine-Resilient Tuple Space
IEEE Transactions on Computers
Series editorial: military communications
IEEE Communications Magazine
Cognitive MANET design for mission-critical networks
IEEE Communications Magazine
Protected seamless content delivery in P2P wireless and wired networks
IEEE Wireless Communications - Special issue on seamless content delivery in the future mobile internet
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks
IEEE Transactions on Dependable and Secure Computing
Practical aspects of mobility in wireless self-organizing networks [Guest Editorial]
IEEE Wireless Communications
Unlinkability Measure for IEEE 802.11 Based MANETs
IEEE Transactions on Wireless Communications
Fault Detection and Diagnosis in IP-Based Mission Critical Industrial Process Control Networks
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Communication Requirements and Interconnect Optimization for High-End Scientific Applications
IEEE Transactions on Parallel and Distributed Systems
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
Eventually Dual Failure Agreement
Fundamenta Informaticae
| Hi-index | 0.00 |
With the rapid advancement of wireless networking technology, networks have evolved from static to dynamic. Reliability of dynamic networks has virtually become an important issue. Fortunately, a solution to the above issue can be derived from solutions to the Byzantine Agreement (BA) problem. BA problem can be solved by protocols that make processors reach an agreement through message exchange. Protocols used to solve the problem can be divided into Immediate Byzantine Agreement (IBA) protocols and Eventual Byzantine Agreement (EBA) protocols. In IBA protocols, the number of rounds of message exchange is determined by the total number of processors in the network. Even if no faulty processor is present in the network, IBA protocols still require a fixed number of rounds of message exchange, causing a waste of time. In contrast, EBA protocols dynamically adjust the number of rounds of message exchange according to the interference of faulty processors. In terms of efficiency, EBA protocols certainly outperform IBA protocols. Due to the fact that the existing EBA protocols have been designed for static networks, they cannot work on dynamic networks. In this paper, we revisit the EBA problem in dynamic networks to increase the reliability of dynamic networks. Simulations will be conducted to validate that the proposed protocol requires the minimum rounds of message exchange and can tolerate the maximum number of malicious faulty processors compared to other existing protocols.