Minimum cost data aggregation with localized processing for statistical inference

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 1454-1462

  Anandkumar, Animashree ^a   Tong, Lang ^a   Swamit, Ananthram ^b   Ephremides, Anthony ^c  

^a School of Operations Research and Industrial Engineering   (United States)

^b U S ARMY RESEARCH LABORATORY   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Cost minimization; In network processing and aggregation; Sensor networks; Statistical inference

Indexed keywords

COST MINIMIZATION; IN-NETWORK PROCESSING AND AGGREGATION; MINIMUM COSTS; STATISTICAL INFERENCE;

AGGLOMERATION; COSTS; DATA PROCESSING; FUSION REACTIONS; HEURISTIC PROGRAMMING; HIDDEN MARKOV MODELS; POLYNOMIAL APPROXIMATION; SENSOR NETWORKS; STATISTICAL METHODS; TREES (MATHEMATICS);

COMPUTER NETWORKS;

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

References (43)

1. K. Akkaya and M. Younis, "A Survey of Routing Protocols in Wireless Sensor Networks," Elsevier Adhoc Networks, vol. 3, pp. 325-349, 2005.
2. S. Misra, L. Tong, and A. Ephremides, "Application dependent shortest path routing in ad-hoc sensor networks," in Wireless sensor networks: signal processing & comm. J. Wiley & Sons, 2007, ch. 11, pp. 277-310.
3. R. Cristescu, B. Beferull-Lozano, M. Vetterli, and R. Wattenhofer. "Network correlated data gathering with explicit communication: NP-completeness and algorithms," IEEE/ACM Trannsactions on Networking (TON), vol. 14, no. 1, pp. 41-54, 2006.
4. A. Goel and D. Estrin, "Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk." Algorithmica. vol. 43, no. 1, pp. 5-15, 2005.
5. A. Scaglione and S. Servetto, "On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks," in Proc. MobiCom 2002, Atlanta, Georgia, September 2002.
6. S. Madden, M. Franklin, J. Hellerstein, and W. Hong, "TinyDB: an acquisitional query processing system for sensor networks," ACM Transactions on Database Systems, vol. 30. no. 1, pp. 122-173, 2005.
7. J. Gehrke and S. Madden, "Query processing in sensor networks," IEEE Pervasive Computing, vol. 03, no. 1, pp. 46-55, 2004.
8. C. Intanagonwiwat. R. Govindan, and D. Esterin, "Directed Diffusion : A Scalable and Robust Paradigm for Sensor Networks.'" in Proc. 6th ACM/Mobicom Conference, Boston,MA, 2000, pp. pp 56-67.
9. B. Krishnamachari, D. Estrin, and S. Wicker, "Modeling data centric routing in wireless sensor networks." in INFOCOM, New York. 2002.
10. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "An application-specific protocol architecture for wireless microsensor networks," IEEE Tran. on W. Comm., vol. 1, no. 4, pp. 660-670, Oct. 2002.
11. A. Giridhar and P. Kumar, "In-network information processing in wireless sensor networks," in Wirless sensor networks: signal processing & comm. J. Wiley & Sons, 2007, ch. 3, pp. 43-68.
12. R. Rajagopalan and P. Varshney, "Data aggregation techniques in sensor networks: A survey," Comm. Surveys & Tutorials, IEEE, vol. 8, no. 4., pp. 48-63, 2006.
13. A. Deshpande, C. Guestrin, S. Madden, J. Hellerstein, and W. Hong, "Model-driven data acquisition in sensor networks," in VLDB, 2004.
14. R. Cristescu, B. Beferull-Lozano, and M. Vetterli, "On Network Correlated Data Gathering," in IEEE Infocom. Hong-Kong, March 2004.
15. D. Marco, E. Duarte-Melo, M. Liu, and D. Neuhoff, "On the manyto-one transport capacity of a dense wireless sensor network and the compressibility of its data," in Proc. IPSN, 2003, pp. 1-16.
16. S. Yoon and C. Shahabi, "The Clustered Aggregation technique leveraging spatial and temporal correlations in wireless sensor networks," ACM Tmnsactions on Sensor Networks, vol. 3, no. 1, 2007.
17. A. Jindal and K. Psounis, "Modeling spatially correlated data in sensor networks," ACM Tran. on Sensor Net., vol. 2, no. 4, pp. 466-499, 2006.
18. M. Cetin, L. Chen. J. Fisher, A. Ihler, R. Moses, and A. Willsky, "Distributed fusion in sensor networks: A graphical models perspective," in Wireless sensor networks: signal processing & comm. J. Wiley & Sons, 2007. ch. 9. pp. 215-250.
19. S. Li, Markov random field modeling in computer vision. Springer-Verlag London, 1995.
20. N. Cressie, Statistics for spatial data. J. Wiley, 1993.
21. S. Sanghavi, V. Tan, and A. Willsky. "Learning Graphical Models for Hypothesis Testing," in IEEE Workshop on Stat. Signal Proc. 2007.
22. W. Zhang and G. Cao, "Optimizing tree reconfiguration for mobile target tracking in sensor networks," in INFOCOM, Hong Kong, 2004.
23. N. Katenka, E. Levina. and G. Michailidis, "Local vote decision fusion for target detection in wireless sensor networks," in Joint Research Conf. on Statistics in Quality Industry and Tech., Knoxville. USA, June 2006.
24. Y. Sung, S. Misra, L. Tong, and A. Emphremides, "Cooperative Routing for Signal Detection in Large Sensor Networks," IEEE J. Select. Area Comm., vol. 25, no. 2, pp. 471-483, 2007.
25. J. Williams, J. Fisher III. and A. Willsky, "An Approximate Dynamic Programming Approach to a Communication Constrained Sensor Management Problem," in Intl. Conf. on Infoimation Fusion, vol. 1, 2005.
26. O. Kreidl and A. Willsky, "Inference with Minimal Communication: a Decision-Theoretic Variational Approach," in Advances in Neural Information Pmcessing Systems. 2006.
27. A. Anandkumar, L. Tong, and A. Swami, "Detection of Gauss-Markov Random Fields under Routing Energy Constraint," in Proc. of 45-th Allerton Conf. on Communication, Control and Computing, Sept. 2007.
28. J. Hammersley and P. Clifford, "Markov fields on finite graphs and lattices." Unpublished manuscript, 1971.
29. K. Jung and D. Shah, "Approximate message-passing inference algorithm," in IEEE ITW, 2007, pp. 224-229.
30. J. Besag, "Statistical analysis of non-lattice data," The Statistician. vol. 24, no. 3, pp. 179-195, 1975.
31. D. Eppstein, "All maximal independent sets and dynamic dominance for sparse graphs," Proc of ACM-SIAM symp. on discrete algorithms, pp. 451-459. 2005.
32. B. Wu and K. Chao. Spanning Trees and Optimization Problems. Chapman & Hall, 2004.
33. X. Li. "Algorithmic, geometric and graphs issues in wireless networks," Wireless Comm. and Mobile Computing, vol. 3. no. 2, March 2003.
34. H. V. Poor, An Introduction to Signal Detection and Estimation. New York: Springer-Verlag, 1994.
35. E. Dynkin, "Necessary and sufficient statistics for a family of probability distributions." Tran. Math, Stat. and Prob., vol. 1, pp. 23-41, 1961.
36. L. Devroye, "The expected size of some graphs in computational geometry." Comp. & math. with app., vol. 15, no. 1, pp. 53-64, 1988.
37. A. Anandkumar, L. Tong, and A. Swami, "Energy-efficient data fusion in Gauss-Markov random field," Cornell University, Tech. Rep. ACSP TR 07-07-01, July 2007. [Online]. Available: http://acsp.ece.cornell.edu/papers/ AnandkumarlnfocomReport.pdf
38. V. Vazirani, Approximation Algorithms. Springer, 2001.
39. G. Reich and P. Widmayer, "Beyond steiner's problem: a vlsi oriented generalization," in Proc. of Intl. workshop on Graph-theoivtic concepts in computer science. 1990, pp. 196-210.
40. G. Robins and A. Zelikovsky, "Tighter Bounds for Graph Steiner Tree Approximation," SIAM Journal on Discrete Mathematics, vol. 19, no. 1, pp. 122-134, 2005.
41. M. Penrose and J. Yukich. "Limit Theory for Random Sequential Packing and Deposition," Annals of Applied probability, vol. 12, no. 1, pp. 272-301, 2002.
42. A. Pettitt, I. Weir, and A. Hart, "A Conditional Autoregressive Gaussian Process for Irregularly Spaced Multivariate Data with Application to Modelling Large Sets of Binary Data," Statistics and Computing, vol. 12, no. 4, pp. 353-367, 2002.
43. V. Stix, "Finding All Maximal Cliques in Dynamic Graphs." Comp. Optimization and Applications, vol. 27, no. 2, pp. 173-186, 2004.