Visiting Byzantine Agreement underlying ad hoc environment

DOI10.1134/S1064230707010157MaRDI QIDQ367989zbMATH OpenOpenAlexFDO

Authors K.-Q. Yan, S.-C. Wang

Publication date 17 September 2013

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064230707010157

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Large-scale systems (93A15) Applications of graph theory to circuits and networks (94C15)

Recommendations

• An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network
• scientific article; zbMATH DE number 5506092
• The anatomy study of consensus agreement in MANETs
• A new solution for the Byzantine agreement problem
• The incremental agreement

Cites work

• A lower bound for the time to assure interactive consistency
• Impossibility of distributed consensus with one faulty process
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• The Byzantine Generals Problem

Cited in

(4)

• A distributed fault identification protocol for wireless and mobile ad hoc networks
• scientific article; zbMATH DE number 5506092 (Why is no real title available?)
• An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network
• The anatomy study of consensus agreement in MANETs

This page was built for publication: Visiting Byzantine Agreement underlying ad hoc environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367989)