Skip to main content
SpringerLink
Log in
Book cover

Information Sciences and Systems 2013 pp 57–65Cite as

Distributed Binary Consensus in Dynamic Networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 264))

Abstract

Motivated by the distributed binary interval consensus and the results on its convergence time we propose a distributed binary consensus algorithm which targets the shortfall of consensus algorithms when it comes to dynamic networks. We show that using our proposed algorithm nodes can join and leave the network at any time and the consensus result would always stay correct i.e. the consensus would always be based on the majority of the nodes which are currently present in the network. We then analyse our algorithm for the case of complete graphs and prove that the extra time it takes for nodes to implement our algorithm (to cope with the dynamic setting) does not depend on the size of the network and only depends on the voting margin. Our results are especially of interest in wireless sensor networks where nodes leave or join the network.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Kashyap A, Basar T, Srikant R (2007) Quantized consensus. Automatica 43.

    Google Scholar 

  2. Bénézit F, Thiran P, Vetterli M (2009) Interval consensus: from quantized gossip to voting. In: Proceedings of the (2009) IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP ’09. IEEE Computer Society Washington, DC, USA, pp 3661–3664

    Google Scholar 

  3. Perron E, Vasudevan D, Vojnović M (2009) Using three states for binary consensus on complete graphs. In: INFOCOM 2009, IEEE, pp 2527–2535.

    Google Scholar 

  4. Babaee A, Draief M (2013) Distributed multivalued consensus. Comput J.

    Google Scholar 

  5. Draief M, Vojnović M (2012) Convergence speed of binary interval consensus. SIAM J Control Optim 50(3):1087–1109

    Article  MATH  MathSciNet  Google Scholar 

  6. Babaee A, Draief M (2013) Optimization of binary interval consensus. Comput Inf Sci II I:281

    Google Scholar 

  7. Hassin Y, Peleg D (2002) Distributed probabilistic polling and applications to proportionate agreement. Inf Comput 171:248–268

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

Moez Draief is supported by QNRF through NPRP grant number 09-1150-2-148.

Author information

Authors and Affiliations

  1. Intelligent Systems and Networks Group, Department of Electrical and Electronic Engineering, Imperial College London, London, UK

    Arta Babaee & Moez Draief

Authors
  1. Arta Babaee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moez Draief
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arta Babaee .

Editor information

Editors and Affiliations

  1. Dept of Electrical and Electronics Eng, Imperial College, London, United Kingdom

    Erol Gelenbe

  2. Imperial College, London, United Kingdom

    Ricardo Lent

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Babaee, A., Draief, M. (2013). Distributed Binary Consensus in Dynamic Networks. In: Gelenbe, E., Lent, R. (eds) Information Sciences and Systems 2013. Lecture Notes in Electrical Engineering, vol 264. Springer, Cham. https://doi.org/10.1007/978-3-319-01604-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01604-7_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01603-0

  • Online ISBN: 978-3-319-01604-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation