The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Information and Computation
Byzantine Agreement in a Generalized Connected Network
IEEE Transactions on Parallel and Distributed Systems
A Note on Consensus on Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reaching Fault Diagnosis Agreement under a Hybrid Fault Model
IEEE Transactions on Computers
Making link-state routing scale for ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Logic Programming - New Frontiers
Logic Programming - New Frontiers
Operating System Concepts
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
IEEE Transactions on Knowledge and Data Engineering
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Byzantine Fault Tolerance for Agent Systems
DEPCOS-RELCOMEX '06 Proceedings of the International Conference on Dependability of Computer Systems
Agreement among unacquainted byzantine generals
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Eventually Dual Failure Agreement
Fundamenta Informaticae
Hi-index | 0.00 |
Since wireless communication and mobile computing are becomingmore and more ubiquitous, the reliability and fault tolerance of the Mobile Ad-hoc Network (MANET) has become an important topic. In order to provide a reliable environment, a mechanism that allows a set of nodes to reach a common agreement, even in the presence of faulty nodes, is needed. Therefore, the Byzantine Agreement (BA) problem has drawn attention of more researchers. Traditionally, the BA problem was focused on wired networks. We know that the physical topology of a wired network is static, but the physical topology of an MANET is dynamic. Thus, previous BA protocols are not applicable in an MANET. In this paper, a new protocol is proposed to solve the BA problem with malicious faulty components in dynamic MANET. Furthermore, we also propose a new Fault Diagnosis Agreement (FDA) protocol to detect/locate faulty components to provide a highly reliable environment. From the performance perspective, the proposed protocols use the minimum number of message exchanges and can tolerate/detect/locate the maximum number of faulty nodes allowed in the dynamic network.