Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks
verfasst von : Chuanyou Li, Michel Hurfin, Yun Wang
Erschienen in: Distributed Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider the problem of approximate consensus in mobile ad hoc networks in the presence of Byzantine nodes. Due to nodes’ mobility, the topology is dynamic and unpredictable. We propose an approximate Byzantine consensus protocol which is based on the linear iteration method. In this protocol, nodes are allowed to collect information during several consecutive rounds: thus moving gives them the opportunity to gather progressively enough values. A novel sufficient and necessary condition guarantees the final convergence of the consensus protocol. At each stage of the computation, a single correct node is concerned by the requirement expressed by this new condition.