Broadcast gossip algorithms: Design and analysis for consensus

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2008, Pages 4843-4848

  Aysal, Tuncer C ^a   Yildiz, Mehmet E ^a   Sarwate, Anand D ^b   Scaglione, Anna ^a  

^a Cornell University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; MEAN SQUARE ERROR;

CONVERGENCE RATES; DESIGN AND ANALYSIS; GOSSIP ALGORITHMS; GOSSIPING PROTOCOLS; MEAN-SQUARE-ERROR PERFORMANCE; MEASUREMENTS OF; OPTIMAL MIXING; WIRELESS SENSOR;

WIRELESS SENSOR NETWORKS;

EID: 62949144880     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2008.4739315     Document Type: Conference Paper

References (18)

1. C. C. Moallemi and B. V. Roy, "Consensus propagation," IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 4753-4766, Nov. 2006.
2. R. Olfati-Saber and R. Murray, "Consensus problems in networks of agents with switching topology and time delays," IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1520-1533, Sep. 2004.
3. W. Ren and R. Beard, "Consensus seeking in multiagent systems under dynamically changing interaction topologies," IEEE Trans. Autom. Control, vol. 50, no. 5, pp. 655-661, 2005.
4. L. Xiao, S. Boyd, and S. Lall, "A scheme for robust distributed sensor fusion based on average consensus," in Proceedings of the IEEE/ACM Int. Symp. on Inf. Proc. in Sens. Netw., Los Angeles, CA, Apr. 2005.
5. N. Lynch, Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1996.
6. J. Tsitsiklis, "Problems in decentralized decision making and computation," Ph.D. dissertation, Dept. of Electrical Engineering and Computer Science, M.I.T., Boston, MA, 1984.
7. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Info. Theory, vol. 52, no. 6, pp. 2508-2530, June 2006.
8. D. Kempe, A. Dobra, and J. Gehrke, "Computing aggregate information using gossip," in Proc. Foundations of Computer Science, Cambridge, MA, October 2003.
9. A. Nedić, A. Olshevsky, A. Ozdaglar, and J. N. Tsitsiklis, "On distributed averaging algorithms and quantization effects," LIDS Report 2274, MIT, Tech. Rep., Nov. 2007.
10. A. Nedić and A. Ozdaglar, "Convergence rate for consensus with delays," LIDS Report 2774, MIT, Tech. Rep., Oct. 2007.
11. T. C. Aysal, M. J. Coates, and M. G. Rabbat, "Rates of convergence of distributed average consensus with probabilistic qantization," in Proceedings of the Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sep. 2007.
12. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: Efficient averaging for sensor networks," IEEE Trans. Signal Process., vol. 56, no. 3, Mar. 2008.
13. F. Bénézit, A. G. Dimakis, P. Thiran, and M. Vetterli, "Orderoptimal consensus through randomized path averaging," February 2008, arXiv:0802.2587v1.
14. T. C. Aysal, M. E. Yildiz, and A. Scaglione, "Broadcast gossip algorithms," in Proceedings of the 2008 IEEE Information Theory Workshop, Porto, Portugal, May 2008.
15. A. Giridhar and P. R. Kumar, "Towards a theory of in-network computation in wireless sensor networks," IEEE Communications Magazine, vol. 44, no. 4, pp. 98-107, Apr. 2006.
16. T. C. Aysal, M. E. Yildiz, A. D. Sarwate, and A. Scaglione, "Broadcast gossip algorithms," IEEE Trans. Signal Process., Mar. 2008, submitted for publication, www.crips.cornell.edu.
17. 1, isoperimetric inequalities for graphs, and superconcentrators," Journal of Combinatorial Theory, Series B, vol. 38, pp. 73-88, 1985.
18. B. Mohar, Graph Theory, Combinatorics, and Applications. Wiley, 1991, vol. 2, ch. The Laplacian spectrum of graphs, pp. 871-898.