DocumentCode
3574153
Title
A fault-tolerant algorithm for agreement in CDS-based mobile ad-hoc networks
Author
Mao-Lun Chiang ; Hui-Ching Hsieh ; Chun-Cheng Peng
Author_Institution
Dept. of Inf. & Commun. Eng., Chaoyang Univ. of Technol., Taichung, Taiwan
fYear
2014
Firstpage
636
Lastpage
637
Abstract
One of the most important problems of fault-tolerance issues lies in the Byzantine Agreement (BA) problem. In this work, the byzantine problem is re-examined in a virtual backbone of MANET, the Connected Dominating Set (CDS) 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.
Keywords
fault tolerance; mobile ad hoc networks; protocols; CDS; MANET; byzantine agreement problem; connected dominating set; fault tolerant algorithm; faulty processors; mobile ad hoc networks; protocol; virtual backbone; Fault tolerance; Logic gates; Mobile ad hoc networks; Program processors; Protocols; Vectors; Byzantine Agreement; Consensus; Distributed System; Fault-tolerant; Mobile Ad-hoc Network;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Networking in China (CHINACOM), 2014 9th International Conference on
Type
conf
DOI
10.1109/CHINACOM.2014.7054374
Filename
7054374
Link To Document