Analysis of max-consensus algorithms in wireless channels

IEEE Transactions on Signal Processing

Volumn 60, Issue 11, 2012, Pages 6103-6107

  Iutzeler, Franck ^a   Ciblat, Philippe ^a   Jakubowicz, Jérémie ^a,b  

^a TELECOM PARISTECH   (France)

^b INSTITUT NATIONAL DES TÉLÉCOMMUNICATIONS   (France)

Author keywords

Consensus; distributed algorithms; gossip; wireless sensor networks

Indexed keywords

CONSENSUS; CONVERGENCE TIME; GOSSIP; MAXIMAL VALUES; MEAN CONVERGENCES; THEORETICAL PERFORMANCE; WIRELESS CHANNEL; WIRELESS LINK;

ELECTRONICS ENGINEERING; PARALLEL ALGORITHMS; SIGNAL PROCESSING; WIRELESS SENSOR NETWORKS;

HEURISTIC ALGORITHMS;

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

References (28)

1. J. N. Tsitsiklis, "Problems in decentralized decision making and computation," Ph.D. dissertation, Inf. and Decision Syst. Lab., Massachusetts Inst. Technol., Cambridge, 1984.
2. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Analysis and optimization of randomized gossip algorithms," in Proc. 43rd IEEE Conf. CDC Decision Control, 2004, vol. 5, pp. 5310-5315. (Pubitemid 40297838)
3. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2508-2530, 2006. (Pubitemid 43898906)
4. A. D. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: Efficient averaging for sensor networks," IEEE Trans. Signal Process., vol. 56, no. 3, pp. 1205-1216, 2008. (Pubitemid 351386279)
5. T. C. Aysal, M. E. Yildiz, A. D. Sarwate, and A. Scaglione, "Broadcast gossip algorithms for consensus," IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2748-2761, 2009.
6. J. Cortés, "Distributed algorithms for reaching consensus on general functions," Automatica, vol. 44, no. 3, pp. 726-737, 2008.
7. I. Chlamtac and S. Kutten, "On broadcasting in radio networks-problem analysis and protocol design," IEEE Trans. Commun., vol. 33, no. 12, pp. 1240-1246, 1985. (Pubitemid 16539622)
8. O. Bar-Yehuda, R. Goldreich, and A. Itai, "On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization," J. Comput. Syst. Sci., vol. 45, no. 1, pp. 104-126, 1992.
9. E. Kushilevitz and Y. Mansour, "An lower bound for broadcast in radio networks," SIAM J. Comput., vol. 27, no. 3, pp. 702-712, 1998. (Pubitemid 128490835)
10. L. Chrobak, M. Gasieniec, and W. Rytter, "Fast broadcasting and gossiping in radio networks," J. Algorithms, vol. 43, no. 2, pp. 177-189, 2002.
11. A. Czumaj and W. Rytter, "Broadcasting algorithms in radio networks with unknown topology," in Proc. 44th Annu. IEEE Symp. Found. Comput. Sci., 2003, pp. 492-501.
12. N. A. Lynch, Distributed Algorithms, ser. Data Management Systems. San Mateo, CA: Morgan Kaufmann, 1996.
13. P. J. Slater, E. J. Cockayne, and S. T. Hedetniemi, "Information dissemination in trees," SIAM J. Comput., vol. 10, pp. 692-692, 1981.
14. B. Pittel, "On spreading a rumor," SIAM J. Appl. Math., vol. 47, pp. 213-223, 1987.
15. U. Feige, D. Peleg, P. Raghavan, and E. Upfal, "Randomized broadcast in networks," Random Struct. Algorithms, vol. 1, no. 4, pp. 447-460, 1990.
16. W. R. Heinzelman, J. Kulik, and H. Balakrishnan, "Adaptive protocols for information dissemination in wireless sensor networks," in Proc. 5th ACM/IEEE Int. Conf. Mobile Comput. Netw., 1999, pp. 174-185.
17. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, "Randomized rumor spreading," FOCS, p. 565, 2000.
18. S. Kashyap, S. Deb, K. V. M. Naidu, R. Rastogi, and A. Srinivasan, "Efficient gossip-based aggregate computation," in Proc. 25th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Syst., 2006, pp. 308-317. (Pubitemid 46946492)
19. B. Doerr, T. Friedrich, and T. Sauerwald, "Quasirandom rumor spreading: Expanders, push vs. pull, and robustness," Automata, Lang., Programming, pp. 366-377, 2009.
20. N. Fountoulakis, A. Huber, and K. Panagiotou, "Reliable broadcasting in random networks and the effect of density," in Proc. IEEE INFOCOM, 2010, pp. 1-9.
21. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, "Epidemic algorithms for replicated database maintenance," in Proc. 6th ACM Symp. Principles of Distrib. Comput., 1987, pp. 1-12.
22. T. Sauerwald and A. Stauffer, "Rumor spreading and vertex expansion on regular graphs," in Proc. 22nd ACM-SIAM Symp. Discrete Algorithms (SODA), 2011, pp. 462-475.
23. A. Frieze and G. Grimmett, "The shortest-path problem for graphs with random arc-lengths," Discrete Appl. Math., vol. 10, no. 1, pp. 57-77, 1985. (Pubitemid 15475455)
24. G. Giakkoupis and T. Sauerwald, "Rumor spreading and vertex expansion," in Proc. 23rd ACM-SIAM Symp. Discrete Algorithms (SODA), 2012, pp. 1623-1641.
25. M. Penrose, Random Geometric Graphs. New York: Oxford Univ. Press, 2003.
26. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
27. N. Biggs, Algebraic Graph Theory. Cambridge, U.K.: Cambridge Univ. Press, 1993, vol. 67.
28. H. Thorisson, Coupling, Stationarity, and Regeneration. New York: Springer-Verlag, 2000.