Skip to main content

Lightweight Distributed Adaptive Algorithm for Voting Procedures by Using Network Average Consensus

  • Conference paper
PRIMA 2013: Principles and Practice of Multi-Agent Systems (PRIMA 2013)

Abstract

Consensus Seeking (CS) is an important research area in which this work contributes by proposing a new distributed algorithm to solve Voting Procedures (VP) problems in mobile networks with link failures under strong constraints on communication capacity.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cortés, J.: Finite-time convergent gradient flows with applications to network consensus. Automatica 42(11), 1993–2000 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cortés, J.: Distributed algorithms for reaching consensus on general functions. Automatica 44(3), 726–737 (2008)

    Article  MathSciNet  Google Scholar 

  3. Hatano, Y., Mesbahi, M.: Agreement over random networks. IEEE Transactions on Automatic Control 50(11), 1867–1872 (2005)

    Article  MathSciNet  Google Scholar 

  4. Kar, S., Moura, J.: Distributed consensus algorithms in sensor networks with imperfect communication: Link failures and channel noise. IEEE Transactions on Signal Processing 57(1), 355–369 (2009)

    Article  MathSciNet  Google Scholar 

  5. Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE 95(1), 215–233 (2007)

    Article  Google Scholar 

  6. Olfati-Saber, R., Murray, R.M.: Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control 49(9), 1520–1533 (2004)

    Article  MathSciNet  Google Scholar 

  7. Patterson, S., Bamieh, B., El Abbadi, A.: Distributed average consensus with stochastic communication failures. In: 2007 46th IEEE Conference on Decision and Control, New Orleans, Louisiana, USA, pp. 4215–4220 (December 2007)

    Google Scholar 

  8. Ren, W., Beard, R.W.: Consensus of information under dynamically changing interaction topologies. In: Proceedings of the 2004 American Control Conference, Boston, USA, vol. 6, pp. 4939–4944. IEEE (June 2004)

    Google Scholar 

  9. Ren, W., Beard, R.W., Atkins, E.M.: A survey of consensus problems in multi-agent coordination. In: Proceedings of the 2005 American Control Conference, Portland Oregon, USA, pp. 1859–1864 (June 2005)

    Google Scholar 

  10. Wang, H., Guo, Y.: Consensus on scale-free network. In: American Control Conference, Seattle, Washington, USA, pp. 748–752. IEEE (June 2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duhart, C., Cotsaftis, M., Bertelle, C. (2013). Lightweight Distributed Adaptive Algorithm for Voting Procedures by Using Network Average Consensus. In: Boella, G., Elkind, E., Savarimuthu, B.T.R., Dignum, F., Purvis, M.K. (eds) PRIMA 2013: Principles and Practice of Multi-Agent Systems. PRIMA 2013. Lecture Notes in Computer Science(), vol 8291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44927-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-44927-7_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-44926-0

  • Online ISBN: 978-3-642-44927-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics