Which distributed averaging algorithm should I choose for my sensor network?

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 1660-1668

  Denantes, Patrick ^a,b   Bénézit, Florence ^a   Thiran, Patrick ^a   Vetterli, Martin ^a  

^a EPFL   (Switzerland)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARSENIC COMPOUNDS; COMPUTER NETWORKS; ELECTRIC NETWORK TOPOLOGY; MESSAGE PASSING; SENSORS; SPEED; TIME VARYING NETWORKS; WIRELESS SENSOR NETWORKS;

CONVERGENCE SPEEDS; GOSSIP ALGORITHMS;

SENSOR NETWORKS;

EID: 51349155228     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.152     Document Type: Conference Paper

References (22)

1. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing Markov chain on a graph," SIAM Rev., vol. 46, no. 4, pp. 667-689 (electronic). 2004.
2. _, "Fastest mixing markov chain on a path," The American Mathematical Monthly, vol. 113, no. 1, pp. 70-74, 2006.
3. P. Bremaud, Markov chains, ser. Texts in Applied Mathematics. New York: Springer-Verlag. 1999, vol. 31, gibbs fields, Monte Carlo simulation, and queues.
4. J. Rosenthal, "Convergence rates of markov chains," SIAM ReK, vol. 37, no. 3, pp. 387-405, 1995.
5. L. Xiao, S. Boyd, and S. Lall, "Distributed average consensus with time-varying metropolis weights," submitted to Automatica, June 2006.
6. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2508-2530, 2006.
7. _, "Gossip algorithms: Design, analysis and applications," in Proc. IEEE Infocom 2005. vol. 3, Miami, March 2005, pp. 1653-1664.
8. A. Kashyap, T. Başar, and R. Srikant, "Quantized consensus," Automatica, vol. 43, no. 7, pp. 1192-1203, 2007.
9. V. Blondel, J. Hendrickx, A. Olshevsky, and J. Tsitsiklis, "Convergence in multiagent coordination, consensus, and flocking," in CDC-ECC '05. 44th IEEE Conference on, 2005, pp. 2996-3000.
10. T. Schmid. H. Dubois-Ferrière, and M. Vetterli, "SensorScope: Experiences with a Wireless Building Monitoring Sensor Network," in Workshop on Real-World Wireless Sensor Networks (REALWSN'05).
11. H. Nguyen and P. Thiran, "Using End-to-End Data to Infer Lossy Links in Sensor Networks," in IEEE Infocom 2006, 2006. [Online]. Available: http://www.ieee-infocom.org/
12. P. Denantes, "Performance of averaging algorithms in time-varying networks," Master's thesis, TUM/EPFL. June 2007, availaible on http://people.epfl.ch/patrick.denantes.
13. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Analysis and optimization of randomized gossip algorithms," in Decision and Control, 2004. CDC. 43rd IEEE Conference on, December 2004, pp. 5310-5315.
14. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: efficient aggregation for sensor networks," in IPSN '06. New York, NY, USA: ACM Press, 2006, pp. 69-76.
15. F. Bénézit, A. Dimakis, P. Thiran, and M. Vetterli, "Geographic gossip with path averaging is order optimal," submitted to Allerton, 2007.
16. P. Walters, An intmduction to ergodic theory, ser. Graduate Texts in Mathematics. New York: Springer-Verlag, 1982, vol. 79.
17. R. A. Horn and C. R. Johnson, Matrix analysis. Cambridge: Cambridge University Press, 1990, corrected reprint of the 1985 original.
18. H. Furstenberg and H. Kesten, "Products of random matrices," Ann. Math. Statist, vol. 31, pp. 457-469, 1960.
19. V. I. Oseledec, "A multiplicative ergodic theorem. Characteristic Ljapunov. exponents of dynamical systems," Trudy Moskov. Mat. Obšč., vol. 19, pp. 179-210, 1968.
20. D. Ruelle, "Ergodic theory of differentiable dynamical systems," Inst. Hautes Études Sci. Publ. Math., no. 50, pp. 27-58, 1979.
21. M. S. Raghunathan, "A proof of Oseledec's multiplicative ergodic theorem," Israel J. Math., vol. 32, no. 4, pp. 356-362, 1979.
22. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Mixing times for random walks on geometric random graphs," in ALENEX/ANALCO. SIAM, 2005.