Skip to Main content Skip to Navigation
Conference papers

Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks

Chuanyou Li 1 Michel Hurfin 2 Yun Wang 1
2 CIDRE - Confidentialité, Intégrité, Disponibilité et Répartition
CentraleSupélec, Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
Abstract : 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.
Complete list of metadatas

https://hal.inria.fr/hal-00745112
Contributor : Michel Hurfin <>
Submitted on : Wednesday, October 24, 2012 - 3:56:14 PM
Last modification on : Friday, July 10, 2020 - 4:06:04 PM

Identifiers

Citation

Chuanyou Li, Michel Hurfin, Yun Wang. Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks. DISC - 26th International Symposium on Distributed Computing, Raimundo Macêdo, Oct 2012, Salvador, Brazil. pp.405-406, ⟨10.1007/978-3-642-33651-5⟩. ⟨hal-00745112⟩

Share

Metrics

Record views

458