Brief announcement: reaching approximate byzantine consensus in partially-connected mobile networks

Authors:
Chuanyou Li;Michel Hurfin;Yun Wang
Affiliations:
Key Lab of Computer Network & Information Integration, Ministry of Education, School of Computer Science and Engineering, Southeast University, Nanjing, China;INRIA Rennes Bretagne Atlantique, Rennes, France;Key Lab of Computer Network & Information Integration, Ministry of Education, School of Computer Science and Engineering, Southeast University, Nanjing, China
Venue:
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Year:
2012

Citing 2
Cited 0

Consensus of multi-agent networks in the presence of adversaries using only local information

Proceedings of the 1st international conference on High Confidence Networked Systems
Iterative approximate byzantine consensus in arbitrary directed graphs

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

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.