Visiting Byzantine Agreement underlying ad hoc environment

DOI10.1134/S1064230707010157zbMATH Open1272.93012OpenAlexW1862042950MaRDI QIDQ367989FDOQ367989

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

Recommendations

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network
• The anatomy study of consensus agreement in MANETs
• Title not available (Why is that?)
• A distributed fault identification protocol for wireless and mobile ad hoc networks

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)