Part of the book series:Lecture Notes in Computer Science ((LNTCS,volume 7611))
Included in the following conference series:
1106Accesses
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.
This work is partially supported by Natural Science Foundation, China under grant 60973122, by National 863 Hi-Tech Program, China under grant 2011AA040502 and by the ANR INS French program (grant #ANR-11-INSE-010, project AMORES).
This is a preview of subscription content,log in via an institution to check access.
Access this chapter
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
- Chapter
- JPY 3498
- Price includes VAT (Japan)
- eBook
- JPY 5719
- Price includes VAT (Japan)
- Softcover Book
- JPY 7149
- Price includes VAT (Japan)
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Dolev, D., Lynch, A.N., Pinter, S., Stark, W.E., Weihl, E.W.: Reaching approximate agreement in the presence of faults. In: Proc. of 3rd IEEE Symp. on Reliability in Distributed Software and Database Systems, pp. 145–154 (1983)
Sundaram, S., Hadjicostis, C.N.: Distributed function calculation via linear iterations in presence of malicious agents - part i: Attacking the networks. In: Proc. of the American Control Conference, pp. 1350–1355 (2008)
Vaidya, N., Tseng, L., Liang, G.: Iterative approximate byzantine consensus in arbitrary directed graphs. In: Proc. of 31st Symp. on PODC (2012)
Le Blanc, H., Zhang, H., Sundaram, S., Koutsoukos, X.: Consensus of multi-agent networks in the presence of adversaries using only local information. In: Proc. of the 1st Int. Conf. on High Confidence Networked Systems, pp. 1–10 (2012)
Li, C., Hurfin, M., Wang, Y.: Reaching approximate byzantine consensus in partially-connected mobile networks. Technical Report 7985, INRIA (May 2012)
Author information
Authors and Affiliations
Key Lab of Computer Network & Information Integration, Ministry of Education, School of Computer Science and Engineering, Southeast University, Nanjing, China
Chuanyou Li & Yun Wang
INRIA Rennes Bretagne Atlantique, Campus de Beaulieu, Rennes, France
Michel Hurfin
- Chuanyou Li
You can also search for this author inPubMed Google Scholar
- Michel Hurfin
You can also search for this author inPubMed Google Scholar
- Yun Wang
You can also search for this author inPubMed Google Scholar
Editor information
Editors and Affiliations
Microsoft Corporation, Building SVC6, 1065 La Avenida, 94043, Mountain View, CA, USA
Marcos K. Aguilera
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, C., Hurfin, M., Wang, Y. (2012). Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks. In: Aguilera, M.K. (eds) Distributed Computing. DISC 2012. Lecture Notes in Computer Science, vol 7611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_30
Download citation
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-642-33650-8
Online ISBN:978-3-642-33651-5
eBook Packages:Computer ScienceComputer Science (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative