A New Generalized Consensus Problem and Its CRT-Based Solution

This technical note introduces a new generalized consensus problem where nodes in a network are guaranteed to reach the final consensus on a common vector whose elements are exactly the initial values arbitrarily chosen by nodes. We propose a fully decentralized algorithm able to solve the above problem and derive conditions to guarantee that consensus is reached in a finite number of steps. In particular, we prove that in a network composed by n nodes, the proposed consensus problem is solvable in at most 2n steps. Moreover, we introduce a finite-field solution based on the Chinese Remainder Theorem (CRT) able to reduce the complexity of the proposed approach in the case of capacity constraints, and we discuss an illustrative case study.

[1]  Marc Van Barel,et al.  A FAST HANKEL SOLVER BASED ON AN INVERSION FORMULA FOR LOEWNER MATRICES , 1998 .

[2]  Antonio Bicchi,et al.  Observability and controllability verification in multi-agent systems through decentralized Laplacian spectrum estimation , 2010, 49th IEEE Conference on Decision and Control (CDC).

[3]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[4]  Soummya Kar,et al.  Finite-time distributed consensus through graph filters , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[5]  Feng Ding,et al.  Model order determination using the Hankel matrix of impulse responses , 2011, Appl. Math. Lett..

[6]  Alessandro Leonardi,et al.  On the Use of Chinese Remainder Theorem for Energy Saving in Wireless Sensor Networks , 2008, 2008 IEEE International Conference on Communications.

[7]  B. Schutter,et al.  Minimal state-space realization in linear system theory: an overview , 2000 .

[8]  Raphaël M. Jungers,et al.  Graph diameter, eigenvalues, and minimum-time consensus , 2012, Autom..

[9]  Mehmet E. Yildiz,et al.  Asymmetric information diffusion via gossiping on static and dynamic networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[10]  Avram Sidi,et al.  Quotient-difference type generalizations of the power method and their analysis , 1990 .

[11]  Wenwu Yu,et al.  An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination , 2012, IEEE Transactions on Industrial Informatics.

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

[13]  Soummya Kar,et al.  Gossip Algorithms for Distributed Signal Processing , 2010, Proceedings of the IEEE.

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

[15]  Alessandro Leonardi,et al.  Improving Energy Saving and Reliability in Wireless Sensor Networks Using a Simple CRT-Based Packet-Forwarding Solution , 2012, IEEE/ACM Transactions on Networking.

[16]  Ling Shi,et al.  Decentralised minimum-time consensus , 2013, Autom..

[17]  Alessandro Leonardi,et al.  A novel reliable and energy-saving forwarding technique for wireless sensor networks , 2009, MobiHoc '09.

[18]  Usman A. Khan,et al.  Revisiting Finite-Time Distributed Algorithms via Successive Nulling of Eigenvalues , 2015, IEEE Signal Processing Letters.

[19]  T. C. Aysal,et al.  Distributed Average Consensus With Dithered Quantization , 2008, IEEE Transactions on Signal Processing.

[20]  C.N. Hadjicostis,et al.  Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies , 2007, 2007 American Control Conference.

[21]  Soummya Kar,et al.  Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures , 2007, IEEE Transactions on Signal Processing.

[22]  Alain Y. Kibangou,et al.  Step-size sequence design for finite-time average consensus in secure wireless sensor networks , 2014, Syst. Control. Lett..

[23]  Christian Commault,et al.  Generic properties and control of linear structured systems: a survey , 2003, Autom..

[24]  Albert Y. Zomaya,et al.  Note on the Hankel matrix , 1991 .

[25]  Sandro Zampieri,et al.  Performance metrics in the consensus problem: a Survey , 2010 .

[26]  Karl Henrik Johansson,et al.  Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals , 2013, IEEE Transactions on Automatic Control.

[27]  R.W. Beard,et al.  Discrete-time average-consensus under switching network topologies , 2006, 2006 American Control Conference.

[28]  Shreyas Sundaram,et al.  Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent Systems , 2013, IEEE Transactions on Automatic Control.

[29]  Sonia Martínez,et al.  On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms , 2010, IEEE Transactions on Automatic Control.

[30]  Sanjeev R. Kulkarni,et al.  An upper bound on the convergence time for quantized consensus , 2013, INFOCOM.