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

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.

[1]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[2]  R. Beard,et al.  Consensus of information under dynamically changing interaction topologies , 2004, Proceedings of the 2004 American Control Conference.

[3]  Hua Wang,et al.  Consensus on scale-free network , 2008, 2008 American Control Conference.

[4]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[5]  Jorge Cortés,et al.  Distributed algorithms for reaching consensus on general functions , 2008, Autom..

[6]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

[7]  Jorge Cortés,et al.  Finite-time convergent gradient flows with applications to network consensus , 2006, Autom..

[8]  M. Mesbahi,et al.  Agreement over random networks , 2004, CDC.

[9]  Amr El Abbadi,et al.  Distributed average consensus with stochastic communication failures , 2007, 2007 46th IEEE Conference on Decision and Control.

[10]  Soummya Kar,et al.  Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise , 2007, IEEE Transactions on Signal Processing.