Research Article
A Fault-Tolerant Algorithm for Agreement in CDS-Based Mobile Ad-hoc Networks
@INPROCEEDINGS{10.4108/icst.chinacom.2014.256377, author={Mao-Lun Chiang and Hui-Ching Hsieh and Chun-Cheng Peng}, title={A Fault-Tolerant Algorithm for Agreement in CDS-Based Mobile Ad-hoc Networks}, proceedings={9th International Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2015}, month={1}, keywords={byzantine agreement; distributed system; fault-tolerant; consensus; mobile ad-hoc network}, doi={10.4108/icst.chinacom.2014.256377} }- Mao-Lun Chiang
Hui-Ching Hsieh
Chun-Cheng Peng
Year: 2015
A Fault-Tolerant Algorithm for Agreement in CDS-Based Mobile Ad-hoc Networks
CHINACOM
IEEE
DOI: 10.4108/icst.chinacom.2014.256377
Abstract
To achieve reliable distributed systems, fault-tolerance must be studied. One of the most important problems of fault-tolerance issues lies in the Byzantine Agreement (BA) problem. The BA protocol allows each healthy processor to reach a common agreement in many circumstances in which faults exist. However, the reliability of the MANETs (Mobile Ad-hoc NETworks) needs to be enhanced. In this work, the byzantine problem is re-examined in a virtual backbone of MANET, the Connected Dominating Set (CDS), it is easy to account for the movement of individual processors. Therefore, the processors of our proposed protocol can still reach agreement even if some processors roam around in a MANET. Subsequently, each gateway processor can communicate with non-gateway processors by signature in this virtual backbone. Finally, the proposed protocol can reach an agreement while tolerating the maximum number of faulty processors in a MANET by using the minimum number of message exchanges.
