Network-based consensus averaging with general noisy channels

IEEE Transactions on Signal Processing

Volumn 59, Issue 1, 2011, Pages 373-385

  Rajagopal, Ram ^a   Wainwright, Martin J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Consensus protocols; distributed averaging; gossip algorithms; graph Laplacian; message passing; sensor networks; stochastic approximation

Indexed keywords

CONSENSUS PROTOCOLS; DISTRIBUTED AVERAGING; GOSSIP ALGORITHMS; GRAPH LAPLACIAN; STOCHASTIC APPROXIMATIONS;

ALGORITHMS; ELECTRONIC DATA INTERCHANGE; MESSAGE PASSING; ORDINARY DIFFERENTIAL EQUATIONS; SENSOR NETWORKS;

LAPLACE TRANSFORMS;

EID: 79955783625     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2077282     Document Type: Article

References (32)

1. N. Alon, "Eigenvalues and expanders," Combinatorica, vol. 6, no. 2, pp. 83-96, 1986.
2. N. Alon and J. Spencer, The Probabilistic Method. New York: Wiley Intersci., 2000.
3. T. C. Aysal, M. J. Coates, and M. G. Rabbat, "Distributed average con- sensus with dithered quantization," IEEE Trans. Signal Process., vol. 56, pp. 4905-4918, Oct. 2008.
4. T. C. Aysal, M. E. Yildiz, and A. Scaglione, "Broadcast gossip algo- rithms," in Proc. IEEE Inf. Theory Workshop, Porto, Portugal, 2008.
5. F.Benezit,A.G.Dimakis,P.Thiran,andM.Vetterli,"Gossipalongthe way: Order-optimal consensus through randomized path averaging," in Proc. 45th Allerton Conf., 2007.
6. A. Benveniste, M. Metivier, and P. Priouret, Adaptive Algorithms and Stochastic Approximations. New York: Springer-Verlag, 1990.
7. V.BorkarandP.Varaiya,"Asymptoticagreementindistributedestima- tion," IEEE Trans. Autom. Control, vol. 27, no. 3, pp. 650-655, 1982.
8. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, pp. 2508-2530, 2006.
9. R. Carli, F. Fagnani, P. Frasca, T. Taylor, and S. Zampieri, "Average consensus on networks with transmission noise or quantization," in Proc. Eur. Contr. Conf., 2007.
10. F. R. K. Chung, Spectral Graph Theory. Providence, RI: Amer. Math. Soc., 1991.
11. M. H. deGroot, "Reaching a consensus," J. Amer. Statist. Assoc., vol. 69, no. 345, pp. 118-121, Mar. 1974.
12. P. Denantes, F. Benezit, and P. T. Vetterli, "Which distributed aver- aging algorithm should i choose for my sensor network," in Proc. 27th IEEE Conf. Comput. Commun. (INFOCOM 2008), 2008, pp. 986-994.
13. A. G. Dimakis, A. Sarwate,and M. J. Wainwright, "Geographic gossip: Efcient averaging for sensor networks," IEEE Trans. Signal Process., vol. 53, pp. 1205-1216, Mar. 2008.
14. F.Fagnani andS.Zampieri, "Average consensuswithpacketdrop com- munication," SIAM J. Contr. Optimiz., 2007.
15. J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J. Wainwright, "LP decoding corrects a constant fraction of errors," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 82-89, Jan. 2007.
16. Y. Hatano, A. K. Das, and M. Mesbahi, "Agreement in presence of noise: Pseudogradients on random geometric networks," in Proc. 44th IEEE Conf. Decision and Contr., and Eur. Contr. Conf., Dec. 2005.
17. S. Kar and J. M. F. Moura, "Distributed average consensus in sensor networks with quantized inter-sensor communication," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP 2008), 2008, pp. 2281-2284.
18. S. Kar and J. M. F. Moura, "Distributed consensus algorithms in sensor networks with imperfect communication: Link failures and channel noise," IEEE Trans. Signal Process., vol. 57, pp. 355-369, Jan. 2009.
19. S. Kar and J. M. F. Moura, "Distributed consensus algorithms in sensor networks: Quantized data and random link failures," IEEE Trans. Signal Process., vol. 58, pp. 1383-1400, 2010.
20. S. Kar and J. M. F. Moura, "A mixed time-scale algorithm for dis- tributed parameter estimation: Nonlinear observation models and im- perfect communication," ICASSP, 2009.
21. A. Kashyap, T. Basar, and R. Srikant, "Quantized consensus," Auto- matica, vol. 43, pp. 1192-1203, 2007.
22. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of ag- gregate information," Proc. 44th Ann. IEEE FOCS, pp. 482-491, 2003.
23. H. J. Kushner and G. G. Yin, Stochastic Approximation Algorithms and Applications, 2nd ed. New York: Springer-Verlag, 2003.
24. L. Ljung, "Analysis of recursive stochastic algorithms," IEEE Trans. Autom. Control, vol. 22, pp. 551-575, 1977.
25. R. Olfati-Saber, J. A. Fax, and R. M. Murray, "Consensus and coop- eration in networked multi-agent systems," Proc. IEEE, vol. 95, pp. 215-233, 2007.
26. M. Penrose, Random Geometric Graphs. Oxford Studies in Proba- bility. Oxford, U.K.: Oxford Univ. Press, 2003.
27. G. Picci and T. Taylor, "Almost sure convergence of random gossip algorithms," in Proc. 46th IEEE Conf. Decision and Contr., 2007, pp. 282-287.
28. I. D. Schizas, A. Ribeiro, and G. B. Giannakis, "Consensus in ad hoc WSNS with noisy links: Part I distributed estimation of deterministic signals," IEEE Trans. Signal Process., vol. 56, pp. 350-364, 2008.
29. J.Tsitsiklis,"Problemsindecentralizeddecision-makingandcomputa- tion,"Ph.D.dissertation,Dep.EECS,Mass.Inst.Technol.(MIT),Cam- bridge, 1984.
30. L. X. Boyd, "Fast linear iterations for distributed averaging," Syst. Contr. Lett., vol. 52, pp. 65-78, 2004.
31. L. Xiao, S. Boyd, and S.-J. Kim, "Distributed average consensus with least-mean-square deviation," J. Parallel Distrib. Comput., vol. 67, no. 1, pp. 33-46, 2007.
32. M. E. Yildiz and A. Scaglione, "Coding with side information for rate constrained consensus," IEEE Trans. Signal Process., 2008.