The anatomy study of consensus agreement in MANETs

Authors:
Mao-Lun Chiang;Shu-Ching Wang;Lin-Yu Tseng
Affiliations:
Department of Information and Communication Engineering, Chaoyang University of Technology, 168, Gifeng E. Road, Wufong, Township Taichung County, 413 Taiwan, ROC;Department of Information Management, Chaoyang University of Technology, 168, Gifeng E. Road, Wufong, Township Taichung County, 413 Taiwan, ROC;Department of Computer Science, National Chung-Hsing University, 250, Kuo Kuang Road, Taichung, 400 Taiwan, ROC
Venue:
Computers and Electrical Engineering
Year:
2010

Citing 13
Cited 0

Shifting gears: changing algorithms on the fly to expedite Byzantine agreement

Information and Computation
Data communications, computer networks and open systems (4th ed.)

Data communications, computer networks and open systems (4th ed.)
Bounds on information exchange for Byzantine agreement

Journal of the ACM (JACM)
A Note on Consensus on Dual Failure Modes

IEEE Transactions on Parallel and Distributed Systems
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Cluster-based networks

Ad hoc networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Consensus With Dual Failure Modes

IEEE Transactions on Parallel and Distributed Systems
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links

IEEE Transactions on Parallel and Distributed Systems
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Reaching fault diagnosis agreement on an unreliable general network

Information Sciences—Informatics and Computer Science: An International Journal
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Grouping Byzantine Agreement

Computer Standards & Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reliability is an important research topic of distributed systems. To achieve fault-tolerance in the distributed systems, healthy processors need to reach a common agreement before performing certain special tasks, even if faults exist in many circumstances. This problem is called as the Byzantine Agreement (BA) problem and it must be addressed. In general, the traditional BA problem is solved in well-defined networks. However, the MANETs (Mobile Ad-hoc Network) are increasing in popularity and its network topology is dynamic in nature. In this paper, the BA problem is re-examined in MANETs. Our protocol uses the minimum number of message exchanges to reach an agreement within the distributed system while tolerating the maximum number of faulty processors in MANETs.