Prize-collecting data fusion for cost-performance tradeoff in distributed inference

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2150-2158

  Anandkumar, Animashree ^a   Wang, Meng ^a   Tong, Lang ^a   Swami, Ananthram ^b  

^a School of Chemical and Molecular Engineering   (United States)

^b U S ARMY RESEARCH LABORATORY   (United States)

Author keywords

Detection; In network aggregation; Optimal node selection; Prize collecting steiner tree; Sensor networks

Indexed keywords

APPROXIMATION RATIOS; AUGMENTED GRAPH; CORRELATION MODELS; CORRELATION STRUCTURE; COST PERFORMANCE; DEPENDENCY GRAPHS; DETECTION; DISTRIBUTED INFERENCE; FUSION CENTER; IN-NETWORK; IN-NETWORK AGGREGATION; KULLBACK LEIBLER DIVERGENCE; MARKOV RANDOM FIELD; NODE SELECTION; OPTIMAL NODE SELECTION; OPTIMAL SENSOR; OPTIMAL TRADEOFFS; PRIZE-COLLECTING; PRIZE-COLLECTING STEINER TREE; SENSOR MEASUREMENTS; SPECIAL CLASS; STEINER TREES;

APPROXIMATION ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA ACQUISITION; GRAPH THEORY; HIDDEN MARKOV MODELS; INFORMATION FUSION; OPTIMIZATION; PROFITABILITY; PROGRAM PROCESSORS; SENSOR DATA FUSION;

SENSOR NETWORKS;

EID: 70349675370     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062139     Document Type: Conference Paper

References (15)

1. A. Anandkumar, L. Tong, A. Swami, and A. Ephremides, "Cost- Performance Tradeoff in Multi-hop Aggregation for Statistical Inference," in Proc. of IEEE ISIT, Toronto, Canada, July 2008.
2. H.V. Poor, An Introduction to Signal Detection and Estimation. New York: Springer-Verlag, 1994.
3. M. Goemans and D. Williamson, "A General Approximation Technique for Constrained Forest Problems," SIAM J. on Computing, vol. 24, p. 296, 1995.
4. P. Brémaud, Markov Chains: Gibbs fields, Monte Carlo simulation, and queues. Springer, 1999.
5. Y. Sung, S. Misra, L. Tong, and A. Ephremides, "Cooperative Routing for Signal Detection in Large Sensor Networks," IEEE J. Select. Area Comm., vol. 25, no. 2, pp. 471-483, 2007.
6. A. Giridhar and P. Kumar, "Computing and communicating functions over sensor networks," IEEE J. Selec. Area Comm., vol. 23, no. 4, pp. 755-764, 2005.
7. A. Anandkumar, A. Ephremides, A. Swami, and L. Tong, "Routing for statistical inference in sensor networks," in Handbook on Array Processing and Sensor Networks, S. Haykin and R. Liu, Eds. John Wiley & Sons, 2009, ch. 25.
8. A. Anandkumar, L. Tong, A. Swami, and A. Ephremides, "Minimum Cost Data Aggregation with Localized Processing for Statistical Inference," in Proc. of INFOCOM, Phoenix, USA, April 2008, pp. 780-788.
9. A. Anandkumar, L. Tong, and A. Swami, "Optimal Node Density for Detection in Energy Constrained Random Networks," IEEE Trans. Signal Proc., vol. 56, no. 10, pp. 5232-5245, Oct. 2008.
10. H. Rowaihy, S. Eswaran, M. Johnson, D. Verma, A. Bar-Noy, T. Brown, and T. La Porta, "A survey of sensor selection schemes in wireless sensor networks," in Proc. of SPIE, 2007.
11. Y. Nakamura, K. Tei, Y. Fukazawa, and S. Honiden, "Region-Based Sensor Selection for Wireless Sensor Networks," 2008, pp. 326-331.
12. T. Cover and J. Thomas, Elements of Information Theory. John Wiley & Sons, Inc., 1991.
13. A. Anandkumar, M. Wang, L. Tong, and A. Swami, "Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference," Cornell University, Tech. Rep., Jan. 2009. [Online]. Available: http://acsp.ece.cornell.edu/papers/Anandkumar09TR.pdf
14. A. Lawson and D. Denison, Spatial Cluster Modelling. CRC Press, 2002.
15. 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.