Gossip algorithms for distributed signal processing

Proceedings of the IEEE

Volumn 98, Issue 11, 2010, Pages 1847-1864

  Dimakis, Alexandros G ^a   Kar, Soummya ^b,c   Moura, José M F ^b   Rabbat, Michael G ^d   Scaglione, Anna ^e  

^a University of Southern California   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c PRINCETON UNIVERSITY   (United States)

^d MCGILL UNIVERSITY   (Canada)

^e University of California Davis   (United States)

Author keywords

Consensus protocols; distributed algorithms; distributed processing; gossip protocols; graph theory; information networks distributed averaging; network topology; peer to peer computing; protocols; random topologies; topology design; wireless sensor networks

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; INFORMATION SERVICES; NETWORK PROTOCOLS; PARALLEL ALGORITHMS; PEER TO PEER NETWORKS; QUANTIZATION (SIGNAL); SIGNAL PROCESSING; WIRELESS SENSOR NETWORKS;

CONSENSUS PROTOCOLS; DISTRIBUTED AVERAGING; DISTRIBUTED PROCESSING; GOSSIP PROTOCOLS; NETWORK TOPOLOGY; PEER-TO-PEER COMPUTING; RANDOM TOPOLOGY; TOPOLOGY DESIGN;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 77958154089     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2010.2052531     Document Type: Conference Paper

References (129)

1. F. Zhao and L. Guibas, Wireless Sensor Networks: An Information Processing Approach. San Mateo, CA: Morgan Kaufmann, 2004.
2. F. Zhao, J. Liu, J. Liu, L. Guibas, and J. Reich, Collaborative signal and information processing: An information-directed approach,[ Proc. IEEE, vol. 91, no. 8, pp. 1199-1209, Aug. 2003.
3. B. Sinopoli, C. Sharp, L. Schenato, S. Schaffert, and S. Sastry, Distributed control applications within sensor networks,[ Proc. IEEE, vol. 91, no. 8, pp. 1235-1246, Aug. 2003.
4. C. Chong and S. Kumar, Sensor networks: Evolution, opportunities, and challenges,[ Proc. IEEE, vol. 91, no. 8, pp. 1247-1256, Aug. 2003.
5. R. Brooks, P. Ramanathan, and A. Sayeed, Distributed target classification and tracking in sensor networks,[ Proc. IEEE, vol. 91, no. 8, pp. 1163-1171, Aug. 2003. (Pubitemid 40890827)
6. G. Pottie and W. Kaiser, Wireless integrated network sensors,[ Commun. ACM, vol. 43, no. 5, pp. 51-58, 2000.
7. V. Shnayder, M. Hempstead, B. Chen,G. Werner-Allen, and M. Welsh, Simulating the power consumption of large-scale sensor network applications,[ in Proc. ACM Conf. Embedded Netw. Sensor Syst., Baltimore, Nov. 2004, pp. 188-200.
8. Y. Yu, B. Krishnamachari, and V. Prasanna, Energy-latency tradeoffs for data gathering in wireless sensor networks,[ in Proc. IEEE Infocom, Hong Kong, Mar. 2004, DOI: 10.1109/INFCOM.2004.1354498.
9. M. Rabbat and R. Nowak, Distributed optimization in sensor networks,[ in Proc. IEEE/ACM Symp. Inf. Process. Sensor Netw., Berkeley, CA, Apr. 2004, pp. 20-27.
10. D. Blatt and A. Hero, Energy based sensor network source localization via projection onto convex sets (POCS),[ IEEE Trans. Signal Process., vol. 54, no. 9, pp. 3614-3619, Sep. 2006.
11. S. Son, M. Chiang, S. Kulkarni, andS. Schwartz, The value of clustering in distributed estimation for sensor networks,[ in Proc. IEEE Int. Conf. Wireless Netw. Commun. Mobile Comput., Maui, Jun. 2005, vol. 2, pp. 969-974.
12. A. Ciancio, S. Pattem, A. Ortega, andB. Krishnamachari, Energy-efficient data representation and routing for wireless sensor networks based on a distributed wavelet compression algorithm,[ in Proc. IEEE/ACM Symp. Inf. Process. Sensor Netw., Nashville, TN, Apr. 2006, pp. 309-316.
13. S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin, and F. Yu, Data-centric storage in sensornets with GHT, a geographic hash table,[ Mobile Nets. Appl., vol. 8, no. 4, pp. 427-442, 2003.
14. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, Randomized rumor spreading,[ in Proc. Annu. Symp. Found. Comput. Sci., 2000, vol. 41, pp. 565-574.
15. D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information,[ in Proc. Found. Comput. Sci., Cambridge, MA, Oct. 2003, pp. 482-491.
16. P. Levis, N. Patel, D. Culler, and S. Shenker, Trickle: A self-regulating algorithm for code propagation and maintenance in wireless sensor networks,[ in Proc. USENIX/ACM Symp. Netw. Syst. Design Implement., 2004, vol. 1, p. 2.
17. J. Tsitsiklis, Problems in decentralized decision making and computation,[ Ph.D. dissertation, Dept. Electr. Eng. Comput. Sci.,Massachusetts Inst. Technol., Cambridge, MA, Nov. 1984.
18. J. Tsitsiklis, D. Bertsekas, and M. Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms,[ IEEE Trans. Autom. Control, vol. AC-31, no. 9, pp. 803-812, Sep. 1986.
19. G. V. Cybenko, Dynamic load balancing for distributed memory multiprocessors,[ J. Parallel Distrib. Comput., vol. 7, pp. 279-301, 1989.
20. A. Jadbabaie, J. Lin, and A. S. Morse, Coordination of groups of mobile autonomous agents using nearest neighbor rules,[ IEEE Trans. Autom. Control, vol. 48, no. 6, pp. 988-1001, Jun. 2003.
21. R. Olfati-Saber and R. M. 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.
22. J. A. Fax and R. M. Murray, Information flow and cooperative control of vehicle formations,[ IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1465-1476, Sep. 2004.
23. V. Saligrama and D. Castanon, Reliable distributed estimation with intermittent communications,[ in Proc. 45th IEEE Conf. Decision Control, San Diego, CA, Dec. 2006, pp. 6763-6768. (Pubitemid 351284110)
24. S. Kar, S. A. Aldosari, and J. M. F. Moura, Topology for distributed inference on graphs,[ IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2609-2613, Jun. 2008.
25. S. Boyd, A. Ghosh, B. Prabhakar, andD. Shah, Randomized gossip algorithms,[ IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2508-2530, Jun. 2006.
26. L. Xiao and S. Boyd, Fast linear iterations for distributed averaging,[ in Proc. IEEEConf. Decision Control, Dec. 2003, vol. 5, pp. 4997-5002.
27. D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
28. R. Olfati-Saber, J. Fax, and R. Murray, Consensus and cooperation in networked multi-agent systems,[ Proc. IEEE, vol. 95, no. 1, pp. 215-233, Jan. 2007.
29. W. Ren, R. Beard, and E. Atkins, Information consensus in multivehicle cooperative control,[ IEEE Control Syst. Mag., vol. 27, no. 2, pp. 71-82, Apr. 2007. (Pubitemid 46562979)
30. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Analysis and optimization of randomized gossip algorithms,[ in Proc. 43rd IEEE Conf. Decision Control, 2004, vol. 5, pp. 5310-5315.
31. F. Fagnani and S. Zampieri, Randomized consensus algorithms over large scale networks,[ IEEE J. Sel. Areas Commun., vol. 26, no. 4, pp. 634-649, May 2008.
32. A. Sinclair, Improved bounds for mixingrates of Markov chains and multicommodity flow,[ Combinat. Probab. Comput., vol. 1, pp. 351-370, 1992.
33. S. Boyd, P. Diaconis, and L. Xiao, Fastest mixing Markov chain on a graph,[ SIAM Rev., vol. 46, pp. 667-689, 2003. (Pubitemid 40072140)
34. P. Gupta and P. R. Kumar, Critical power for asymptotic connectivity in wireless networks,[ in Proc. Stochastic Anal. Control Optim. Appl., Boston, MA, 1998, pp. 1106-1110.
35. A. G. Dimakis, A. D. Sarwate, andM. J. Wainwright, Geographic gossip: Efficient aggregation for sensor networks,[ in Proc. ACM/IEEE Symp. Inf. Process. Sensor Netw., 2006, pp. 69-76.
36. W. Li and H. Dai, Location-aidedfast distributed consensus,[ IEEE Trans. Inf. Theory, 2008.
37. P. Diaconis, S. Holmes, and R. Neal, Analysis of a nonreversible Markov chain sampler,[ Ann. Appl. Probab., pp. 726-752, 2000.
38. F. Chen, L. Lovasz, and I. Pak, LiftingMarkov chains to speed up mixing,[ in Proc. 31st Annu. ACM Symp. Theory Comput., 1999, pp. 275-281.
39. K. Jung, D. Shah, and J. Shin, Fast gossip through lifted Markov chains,[ in Proc. Allerton Conf. Commun. Control Comput., Urbana, IL, Sep. 2007.
40. K. Jung, D. Shah, and J. Shin, Minimizing the rate of convergence for iterative algorithms,[ IEEE Trans. Inf. Theory, 2009.
41. D. Mosk-Aoyama and D. Shah, Fast distributed algorithms for computing separable functions," IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 2997-3007, Jul. 2008.
42. P. Flajolet and G. Martin, Probabilistic counting algorithms for data base applications,[ J. Comput. Syst. Sci., vol. 31, no. 2, pp. 182-209, 1985.
43. M. Cao, D. A. Spielman, and E. M. Yeh, Accelerated gossip algorithms for distributed computation,[ in Proc. 44th Annu. Allerton Conf. Commun. Control Comput., Monticello, IL, Sep. 2006.
44. E. Kokiopoulou and P. Frossard, Polynomial filtering for fast convergence in distributed consensus,[ IEEE Trans. Signal Process., vol. 57, no. 1, pp. 342-354, Jan. 2009.
45. B. Johansson and M. Johansson, Faster linear iterations for distributed averaging,[ in Proc. IFAC World Congr., Seoul, South Korea, Jul. 2008.
46. B. Oreshkin, M. Coates, and M. Rabbat, Optimization and analysis of distributed averaging with short node memory,[ IEEE Trans. Signal Process., vol. 58, no. 5, pp. 2850-2865, May 2010.
47. F. Benezit, A. G. Dimakis, P. Thiran, and M. Vetterli, Gossip along the way: Order-optimal consensus through randomized path averaging,[ in Allerton Conf. Commun. Control Comput., Monticello, IL, 2007.
48. O. Savas, M. Alanyali, and V. Saligrama, Efficient in-network processing through local ad-hoc information coalescence," Distributed Computing in Sensor Systems, Berlin, Germany: Springer-Verlag, 2006, pp. 252-265.
49. T. Aysal, M. Yildiz, A. Sarwate, andA. Scaglione, Broadcast gossip algorithms for consensus,[ IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2748-2761, Jul. 2009.
50. D. Ustebay, B. Oreshkin, M. Coates, andM. Rabbat, Rates of convergence for greedy gossip with eavesdropping,[ in Proc. Allerton Conf. Commun. Control Comput., Monticello, IL, 2008, pp. 367-374.
51. W. Li and H. Dai, Cluster-based distributed consensus,[ IEEE Trans. Wireless Commun., vol. 8, no. 1, pp. 28-31, Jan. 2009.
52. A. Ortega and K. Ramchandran, Rate-distortion methods for image and video compression,[ IEEE Signal Process. Mag., vol. 15, no. 6, pp. 23-50, Nov. 1998.
53. A. Orlitsky and A. El Gamal, Average and randomized communication complexity,[ IEEE Trans. Inf. Theory, vol. 36, no. 1, pp. 3-16, Jan. 1990.
54. B. Nazer and M. Gastpar, Computation over multiple-access channels,[ IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3498-3516, Oct. 2007.
55. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
56. S. Kar and J. M. F. Moura, Sensor networks with random links: Topology design for distributed consensus,[ IEEE Trans. Signal Process., vol. 56, no. 7, pp. 3315-3326, Jul. 2008.
57. Y. Hatano and M. Mesbahi, Agreement over random networks,[ in Proc. 43rd IEEE Conf. Decision Control, Dec. 2004, vol. 2, pp. 2010-2015.
58. M. G. Rabbat, R. D. Nowak, andJ. A. Bucklew, Generalized consensus computation in networked systems with erasure links,[ in Proc. 6th Int. Workshop Signal Process. Adv. Wireless Commun., New York, 2005, pp. 1088-1092.
59. S. Patterson and B. Bamieh, Distributed consensus with link failures as a structured stochastic uncertainty problem,[ in Proc. 46th Allerton Conf. Commun. Control Comput., Monticello, IL, Sep. 2008, pp. 623-627.
60. C. Wu, Synchronization and convergence of linear dynamics in random directed networks,[ IEEE Trans. Autom. Control, vol. 51, no. 7, pp. 1207-1210, Jul. 2006.
61. M. Porfiri and D. Stilwell, Stochastic consensus over weighted directed networks,[ in Proc. Amer. Control Conf., New York, Jul. 11-13, 2007, pp. 1425-1430.
62. D. Jakovetic, J. Xavier, and J. M. F. Moura, Weight optimization for consensus algorithms with correlated switching topology,[ IEEE Trans. Signal Process., vol. 58, no. 7, pp. 3788-3801, Jul. 2009.
63. A. T. Salehi and A. Jadbabaie, On consensus in random networks,[ in Proc. Allerton Conf. Commun. Control Comput., Monticello, IL, Sep. 2006.
64. 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, no. 1, pp. 355-369, Jan. 2009.
65. A. Nedic, A. Ozdaglar, and P. Parrilo, Constrained consensus and optimization in multi-agent networks,[ IEEE Trans. Autom. Control, vol. 55, no. 4, pp. 922-938, Apr. 2009.
66. A. Kashyap, T. Basar, and R. Srikant, Quantized consensus,[ Automatica, vol. 43, no. 7, pp. 1192-1203, 2007.
67. R. Subramanian and I. D. Scherson, An analysis of diffusive load-balancing,[ in Proc. 6th Annu. ACM Symp. Parallel Algorithms Architectures, New York, 1994, pp. 220-225.
68. Y. Rabani, A. Sinclair, and R. Wanka, Local divergence of Markov chains and the analysis of iterative load-balancing schemes,[ in Proc. 39th IEEE Symp. Found. Computer Sci., 1998, pp. 694-703.
69. W. Aiello, B. Awerbuch, B. Maggs, and S. Rao, Approximate load balancing on dynamic and asynchronous networks,[ in Proc. 25th Annu. ACM Symp. Theory Comput., New York, 1993, pp. 632-641.
70. B. Ghosh and S. Muthukrishnan, Dynamic load balancing by random matchings,[ J. Comput. Syst. Sci., vol. 53, no. 3, pp. 357-370, 1996.
71. J. Lavaei and R. Murray, On quantized consensus by means of gossip algorithmVPart I: Convergence proof,[ in Proc. Amer. Control Conf., Jun. 2009, pp. 394-401.
72. J. Lavaei and R. Murray, On quantized consensus by means of gossip algorithmVPart II: Convergence time,[ in Proc. Amer. Control Conf., Jun. 2009, pp. 2958-2965.
73. F. Benezit, P. Thiran, and M. Vetterli, Interval consensus: From quantized gossip to voting,[ in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., 2009, pp. 3661-3664.
74. 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, no. 3, pt. 1, pp. 1383-1400, Mar. 2009.
75. T. C. Aysal, M. Coates, and M. Rabbat, Distributed average consensus using probabilistic quantization,[ in Proc. IEEE/SP 14th Workshop Stat. Signal Process., Aug. 2007, pp. 640-644.
76. T. Aysal, M. Coates, and M. Rabbat, Distributed average consensus with dithered quantization,[ IEEE Trans. Signal Process., vol. 56, no. 10, pp. 4905-4918, Oct. 2008.
77. R. Carli, F. Fagnani, A. Speranzon, andS. Zampieri, Communication constraints in the average consensus problem,[ Automatica, vol. 44, no. 3, pp. 671-684, 2008.
78. N. Elia and S. Mitter, Stabilization of linear systems with limited information,[ IEEE Trans. Autom. Control, vol. 46, no. 9, pp. 1384-1400, Sep. 2001.
79. M. Yildiz and A. Scaglione, Differential nested lattice encoding for consensus problems,[ in Proc. Inf. Process. Sensor Netw., Apr. 2007, pp. 89-98.
80. M. Yildiz and A. Scaglione, Coding with side information for rate-constrained consensus,[ IEEE Trans. Signal Process., vol. 56, no. 8, pp. 3753-3764, Aug. 2008.
81. A. Wyner and J. Ziv, The rate-distortion function for source coding with side information at the decoder,[ IEEE Trans. Inf. Theory, vol. IT-22, no. 1, pp. 1-10, Jan. 1976.
82. R. Zamir, S. Shamai, and U. Erez, Nested linear/lattice codes for structured multiterminal binning,[ IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1250-1276, Jun. 2002.
83. O. Ayaso, D. Shah, and M. Dahleh, Distributed computation under bit constraints,[ in Proc. 47th IEEE Conf. Decision Control, Dec. 2008, pp. 4837-4842.
84. A. El Gamal and H.-I. Su, Distributed lossy averaging,[ in Proc. IEEE Int. Symp. Inf. Theory, 2009, pp. 1453-1457.
85. B. Nazer, A. G. Dimakis, and M. Gastpar, Neighborhood gossip: Concurrent averaging through local interference,[ in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., Apr. 2009, pp. 3657-3660.
86. S. Kar and J. Moura, Consensus based detection in sensor networks: Topology optimization under practical constraints,[ in Proc. Int. Workshop Inf. Theory Sensor Netw., Santa Fe, NM, Jun. 2007.
87. V. Saligrama, M. Alanyali, and O. Savas, Distributed detection in sensor networks with packet loss and finite capacity links,[ IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4118-4132, Nov. 2006.
88. C. Moallemi and B. Van Roy, Consensus propagation,[ IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 4753-4766, Nov. 2006.
89. R. Tron, R. Vidal, and A. Terzis, Distributed pose averaging in camera networks via consensus on SE3,[ in Proc. IEEE Conf. Distrib. Smart Cameras, Palo Alto, CA, Sep. 2008, DOI: 10.1109/ICDSC.2008.4635701.
90. A. Jorstad, P. Burlina, I. Wang, D. Lucarelli, and D. DeMenthon, Model-based pose estimation by consensus,[ in Proc. Intell. Sens. Sens. Netw. Inf. Process., Sydney, Australia, Dec. 2008, pp. 569-574.
91. S. Kar and J. M. F. Moura, A lineariterative algorithm for distributed sensor localization,[ in Proc. 42nd Asilomar Conf. Signals Syst. Comput., Pacific Grove, CA, Oct. 2008, pp. 1160-1164.
92. S. Kar, J. M. F. Moura, and K. Ramanan, Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication, Aug. 2008. [Online]. Available: http://arxiv.org/abs/0809.0009.
93. C. G. Lopes and A. H. Sayed, Diffusionleast-mean squares over adaptive networks: Formulation and performance analysis,[ IEEE Trans. Signal Process., vol. 56, no. 7, pp. 3122-3136, Jul. 2008.
94. S. Stankovic, M. Stankovic, andD. Stipanovic, Decentralized parameter estimation by consensus based stochastic approximation,[ in Proc. 46th IEEE Conf. Decision Control, New Orleans, LA, Dec. 12-14, 2007, pp. 1535-1540.
95. I. Schizas, G. Mateos, and G. Giannakis, Stability analysis of the consensus-based distributed LMS algorithm,[ in Proc. 33rd Int. Conf. Acoust. Speech Signal Process., Las Vegas, NV, Apr. 1-4, 2008, pp. 3289-3292.
96. S. Ram, V. Veeravalli, and A. Nedic, Distributed and recursive parameterestimation in parametrized linear state-space models IEEE Trans. Autom. Control, vol. 55, no. 2, pp. 488-492, Feb. 2010.
97. S. S. Ram, V. V. Veeravalli, and A. Nedic, Distributed and recursive nonlinear least square parameter estimation: Linear and separable models,[ in Sensor Networks: Where Theory Meets Practice, G. Ferrari, Ed. New York: Springer-Verlag, 2009.
98. R. Olfati-Saber, Distributed Kalman filter with embedded consensus filters,[ in Proc. 44th IEEE Conf. Decision Control/Eur. Control Conf., 2005, pp. 8179-8184.
99. S. Kirti and A. Scaglione, Scalable distributed Kalman filtering through consensus,[ in Proc. 33rd Int. Conf. Acoust. Speech Signal Process., Las Vegas, NV, Apr. 1-4, 2008, pp. 2725-2728.
100. U. A. Khan and J. M. F. Moura, Distributing the Kalman filter for large-scale systems,[ IEEE Trans. Signal Process., vol. 56, no. 10, pt. 1, pp. 4919-4935, Oct. 2008.
101. A. Ribeiro, I. D. Schizas, S. I. Roumeliotis, and G. B. Giannakis, Kalman filtering in wireless sensor networks: Incorporating communication cost in state estimation problems,[ IEEE Control Syst. Mag., 2009.
102. R. Carli, A. Chiuso, L. Schenato, andS. Zampieri, Distributed Kalman filtering based on consensus strategies,[ IEEE J. Sel. Areas Commun., vol. 26, no. 4, pp. 622-633, May 2008.
103. A. Das and M. Mesbahi, Distributed linear parameter estimation in sensor networks based on Laplacian dynamics consensus algorithm,[ in Proc. 3rd Annu. IEEE Commun. Soc. Sensor Ad Hoc Commun. Netw., Reston, VA, Sep. 28-28, 2006, vol. 2, pp. 440-449.
104. I. D. Schizas, A. Ribeiro, and G. B. Giannakis, Consensus in ad hoc WSNS with noisy linksVPart I: Distributed estimation of deterministic signals,[ IEEE Trans. Signal Process., vol. 56, no. 1, pp. 350-364, Jan. 2008.
105. M. Nevel'son and R. Has'minskii, Stochastic Approximation and Recursive Estimation. Providence, RI: AMS, 1973.
106. M. Huang and J. Manton, StochasticLyapunov analysis for consensus algorithms with noisy measurements,[ in Proc. Amer. Control Conf., New York, Jul. 2007, pp. 1419-1424.
107. S. Kar and J. M. F. Moura, A mixed time scale algorithm for distributed parameter estimation: Nonlinear observation models and imperfect communication,[ in Proc. 34th Int. Conf. Acoust. Speech Signal Process., Taipei, Taiwan, Apr. 2009, pp. 3669-3672.
108. N. Patwari, J. Ash, S. Kyperountas, A. Hero, R. Moses, and N. Correal, Locating the nodes: Cooperative localization in wireless sensor networks,[ IEEE Signal Process. Mag., vol. 22, no. 4, pp. 54-69, Jul. 2005.
109. D. Li and Y. Hu, Energy based collaborative source localization using acoustic micro-sensor array,[ J. EUROSIP Appl. Signal Process., vol. 2003, no. 4, pp. 321-337, 2003.
110. X. Sheng and Y. Hu, Energy based acoustic source localization,[ in Proc. ACM/IEEE Int. Conf. Inf. Process. Sensor Netw., Palo Alto, CA, Apr. 2003, pp. 285-300.
111. X. Sheng and Y. Hu, Maximum likelihood multiple-source localization using acoustic energy measurements with wireless sensornetworks,[ IEEE Trans. Signal Process., vol. 53, no. 1, pp. 44-53, Jan. 2005.
112. M. Rabbat, R. Nowak, and J. Bucklew, Robust decentralized source localization via averaging,[ in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., Philadelphia, PA, Mar. 2005, vol. 5, pp. 1057-1060.
113. U. Khan, S. Kar, and J. Moura, Distributed sensor localization in random environments using minimal number of anchor nodes,[ IEEE Trans. Signal Process., vol. 57, no. 5, pp. 2000-2016, May 2009.
114. D. Slepian and J. Wolf, Noiseless coding of correlated information sources,[ IEEE Trans. Inf. Theory, vol. 19, no. 4, pp. 471-480, Jul. 1973.
115. S. Servetto, On the feasibility oflarge-scale wireless sensor networks,[ in Proc. Allerton Conf. Commun. Control Comput., 2002.
116. S. Pradhan, J. Kusuma, and K. Ramchandran, Distributed compression in a dense microsensor network,[ IEEE Signal Process. Mag., vol. 19, no. 2, pp. 51-60, Mar. 2002.
117. S. Mallat, A Wavelet Tour of SignalProcessing. New York: Academic, 1999.
118. R. DeVore, Nonlinear approximation,[ Acta Numerica, vol. 7, pp. 51-150, 1998.
119. F. Chung, Spectral Graph Theory. Providence, RI: AMS, 1997.
120. E. J. Candes and T. Tao, Decoding by linear programming,[ IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
121. D. L. Donoho, Compressed sensing,[ IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
122. E. J. Candes and T. Tao, Near-optimalsignal recovery from random projections: Universal encoding strategies?[ IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
123. M. Rabbat, J. Haupt, A. Singh, andR. Nowak, Decentralized compression and predistribution via randomized gossiping,[ in Proc. Int. Conf. Inf. Process. Sensor Netw., Nashville, TN, Apr. 2006, pp. 51-59.
124. J. Haupt, W. Bajwa, M. Rabbat, and R. Nowak, Compressed sensing for networked data,[ IEEE Signal Process. Mag., vol. 25, no. 2, pp. 92-101, Mar. 2008.
125. A. Schmidt and J. Moura, A distributed sensor fusion algorithm for the inversion of sparse fields,[ in Proc. Asilomar Conf. Signals Syst. Comput., Pacific Grove, CA, Nov. 2009, pp. 1332-1336.
126. R. Sarkar, X. Zhu, and J. Gao, Hierarchical spatial gossip for multi-resolution representations in sensor networks,[ in Proc. Int. Conf. Inf. Process. Sensor Netw., Apr. 2007, pp. 420-429.
127. S. S. Ram, A. Nedíc, and V. Veeravalli, Asynchronous gossip algorithms for stochastic optimization,[ in Proc. IEEE Conf. Decision Control, Shanghai, China, Dec. 2009, pp. 3581-3586.
128. M. Cetin, L. Chen, J. Fisher, A. Ihler,R. Moses, M. Wainwright, and A. Willsky, Distributed fusion in sensor networks,[ IEEE Signal Process. Mag., vol. 23, no. 4, pp. 42-55, Jul. 2006.
129. A. Sarwate and A. Dimakis, The impact of mobility on gossip algorithms,[ in Proc. IEEE Infocom, 2009, pp. 2088-2096.