Distributed Average Consensus in Sensor Networks with Random Link Failures and Communication Channel Noise

In this paper we study distributed average consensus type algorithms in sensor networks with random network link failures and communication channel. Specifically, the network links fail randomly across iterations, and communication through an active link incurs additive stochastic noise. We consider the A - ND algorithm for distributed average consensus under such imperfect communication scenario. Using results from the theory of controlled Markov processes and stochastic approximation, we show that the A - ND algorithm leads to consensus of the sensor states. In particular, all the sensor states converge a.s. to a finite random variable thetas, the latter being an unbiased estimate of the desired average. We explicitly characterize the resulting the mean-squared error (m.s.e.) and show that the m.s.e. can be made arbitrarily small by tuning certain parameters of the algorithm. But, reducing the m.s.e. in this way, decrease the convergence rate of the algorithm, and we obtain an interesting trade-off between the m.s.e. and the convergence rate of the algorithm. Our results show that the sensor network topology plays a significant role in determining the convergence rate of these algorithms.

[1]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[2]  Soummya Kar,et al.  Distributed average consensus in sensor networks with quantized inter-sensor communication , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

[4]  Soummya Kar,et al.  Distributed Consensus Algorithms in Sensor Networks: Link Failures and Channel Noise , 2007, ArXiv.

[5]  Soummya Kar,et al.  Topology for Distributed Inference on Graphs , 2006, IEEE Transactions on Signal Processing.

[6]  Ιωαννησ Τσιτσικλησ,et al.  PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION , 1984 .

[7]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[8]  H. Kushner,et al.  Stochastic Approximation and Recursive Algorithms and Applications , 2003 .

[9]  Michael William Newman,et al.  The Laplacian spectrum of graphs , 2001 .

[10]  R. Murray,et al.  Consensus protocols for networks of dynamic agents , 2003, Proceedings of the 2003 American Control Conference, 2003..

[11]  M. Mesbahi,et al.  Agreement in presence of noise: pseudogradients on random geometric networks , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[12]  J.M.F. Moura,et al.  Distributed Detection in Sensor Networks: Connectivity Graph and Small World Networks , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[13]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[14]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[15]  R. Has’minskiĭ,et al.  Stochastic Approximation and Recursive Estimation , 1976 .

[16]  Silvana Stefani,et al.  Matrices and Graphs: Theory and Applications to Economics Proceedings of the Conferences , 1996 .

[17]  Frank Harary,et al.  Graph Theory , 2016 .

[18]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[19]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .