Rates of convergence for Greedy gossip with eavesdropping

46th Annual Allerton Conference on Communication, Control, and Computing

Volumn , Issue , 2008, Pages 367-374

  Üstebay, Deniz ^a   Oreshkin, Boris ^a   Coates, Mark ^a   Rabbat, Michael ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED NETWORKS; CONSENSUS ALGORITHMS; CONVERGENCE RATES; DATA-DRIVEN; GEOGRAPHIC LOCATIONS; GRID LIKES; LARGEST EIGENVALUE; NETWORK TOPOLOGIES; NON-TRIVIAL TASKS; RANDOMIZED GOSSIP ALGORITHMS; RATE OF CONVERGENCES; RATES OF CONVERGENCES; WIRELESS BROADCASTS; WIRELESS COMMUNICATIONS;

ALGORITHMS; BROADCASTING; COMMUNICATION; ELECTRIC NETWORK TOPOLOGY; SECURITY SYSTEMS; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 64549145820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797581     Document Type: Conference Paper

References (22)

1. S. Sundhar Ram, V. Veeravalli, and A. Nedic̀, "Distributed and recursive parameter estimation in parametrized linear state-space models," Submitted, Apr. 2008.
2. M. Rabbat, R. Nowak, and J. Bucklew, "Robust decentralized source localization via averaging," in Proc. IEEE ICASSP, Phil., PA, Mar. 2005.
3. M. Rabbat, J. Haupt, A. Singh, and R. Nowak, "Decentralized com-pression and predistribution via randomized gossiping," in Proc. Information Processing in Sensor Networks, Nashville, TN, Apr. 2006.
4. A. Kashyap, T. Basar, and R. Srikant, "Quantized consensus," Automatica, vol. 43, pp. 1192-1203, Jul. 2007.
5. S. Sundaram and C. Hadjicostis, "Distributed function calculation and consensus using linear iterative strategies," IEEE J. Selected Areas in Communications, vol. 26, no. 4, pp. 650-660, May 2008.
6. A. Dimakis, A. Sarwate, and M. Wainwright, "Geographic gossip: Efficient aggregation for sensor networks," in Proc. Int. Conf. Inf. Proc. in Sensor Networks (IPSN), Nashville, TN, Apr. 2006.
7. J. Tsitsiklis, "Problems in decentralized decision making and computation," Ph. D. dissertation, Massachusetts Institute of Technology, 1984.
8. D. Üstebay, M. Coates, and M. Rabbat, "Greedy gossip with eaves-dropping," in Proc. IEEE Int. Symp. on Wireless Pervasive Computing, Santorini, Greece, May 2008.
9. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging," Systems and Control Letters, vol. 53, no. 1, pp. 65-78, Sep. 2004.
10. 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.
11. P. Gupta and P. Kumar, "The capacity of wireless networks," IEEE Trans. Info. Theory, vol. 46, no. 2, pp. 388-404, March 2000.
12. W. Li and H. Dai, "Location-aided distributed averaging algorithms: Performance lower bounds and cluter-based variant," in Proc. Allerton Conf. on Comm., Control, and Computing, Urbana-Champaign, IL, Sep. 2007.
13. K. Jung, D. Shah, and J. Shin, "Fast gossip through lifted Markov chains," in Proc. Allerton Conf. on Comm., Control, and Computing, Urbana-Champaign, IL, Sep. 2007.
14. F. Benezit, A. Dimakis, P. Thiran, and M. Vetterli, "Gossip along the way: Order-optimal consensus through randomized path averaging," in Proc. Allerton Conf. on Comm., Control, and Computing, Urbana-Champaign, IL, Sep. 2007.
15. T. Aysal, M. Yildiz, and A. Scaglione, "Broadcast gossip algorithms," in Proc. IEEE Information Theory Workshop, Porto, Portugal, May 2008.
16. T. Aysal, M. Yildiz, A. Sarwate, and A. Scaglione, "Broadcast gossip algorithms: Design and analysis for consensus," in Proc. IEEE Conf. on Decision and Control, Cancun, Mexico, Dec. 2008.
17. S. Sundhar Ram, A. Nedic̀, and V. Veeravalli, "Incremental stochastic subgradient algorithms for convex optimization," Submitted, June 2008.
18. A. Nedić and A. Ozdaglar, "Distributed subgradient methods for multi-agent optimization," M. I. T. Lab. for Information and Decision Systems, Tech. Report 2755, Aug. 2007.
19. D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
20. A. Nedić and D. Bertsekas, "Incremental subgradient methods for nondifferentiable optimization," SIAM J. on Opt., vol. 12, no. 1, pp. 109-138, 2001.
21. M. Burnashev and K. Zigangirov, "An interval estimation problem for controlled observations," Problems in Information Transmission, vol. 10, pp. 223-231, 1974.
22. R. Castro and R. Nowak, "Active learning and sampling," in Foundations and Applications of Sensor Management, A. Hero, D. Castanon, D. Cochran, and K. Kastella, Eds. Springer-Verlag, 2007, pp. 177-200.