Near-optimal sensor placements: Maximizing information while minimizing communication cost

Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, IPSN '06

Volumn 2006, Issue , 2006, Pages 2-10

  Krause, Andreas ^a   Gupta, Anupam ^a   Guestrin, Carlos ^b   Kleinberg, Jon ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

Approximation algorithms; Communication cost; Gaussian processes; Information theory; Link quality; Sensor networks; Sensor placement; Spatial monitoring

Indexed keywords

COMMUNICATION COSTS; GAUSSIAN PROCESSES; SENSOR PLACEMENT; SPATIAL MONITORING; GAUSSIAN PROCESSES (GP);

APPROXIMATION ALGORITHMS; COST EFFECTIVENESS; GAUSSIAN DISTRIBUTION; INFORMATION RETRIEVAL; INFORMATION THEORY; PROBLEM SOLVING; COMPUTATIONAL COMPLEXITY; DATA TRANSFER; INFORMATION MANAGEMENT; OPTIMIZATION; UNCERTAINTY ANALYSIS;

WIRELESS SENSOR NETWORKS; SENSOR NETWORKS;

EID: 34247381191     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1127777.1127782     Document Type: Conference Paper

References (19)

1. B. Awerbuch, Y. Azar, A. Blum, and S. Vempala. New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM J. Computing, 28:254-262, 1999.
2. A. Cerpa, J. L. Wong, L. Kuang, M. Potkonjak, and D. Estrin. Statistical model of lossy links in wireless sensor networks. In IPSN, 2005.
3. N. A. Cressie. Statistics for Spatial Data. Wiley, 1991.
4. L. Csato, E. Fokue, M. Opper, B. Schottky, and O. Winther. Efficient approaches to gaussian process classification. In NIPS, 2000.
5. A. Deshpande, C. Guestrin, S. Madden, J. Hellerstein, and W. Hong. Model-driven data acquisition in sensor networks. In VLDB, 2004.
6. S. Funke, A. Kesselman, F. Kuhn, Z. Lotker, and M. Segal. Improved approximation algorithms for connected sensor cover. In ADHOC, 04.
7. N. Garg. Saving an epsilon: a 2-approximation for the k-mst problem in graphs. In STOC, 2005.
8. C. Guestrin, P. Bodik, R. Thibaux, M. Paskin, and S. Madden. Distributed regression: an efficient framework for modeling sensor network data. In IPSN, 2004.
9. C. Guestrin, A. Krause, and A. Singh. Near-optimal sensor placements in gaussian processes. In ICML, 2005.
10. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In FOCS, 2003.
11. H. Gupta, S. R. Das, and Q. Gu. Connected sensor cover: Self-organization of sensor networks for efficient query execution. In MobiHoc, 2003.
12. D. S. Johnson, M. Minkoff, and S. Phillips. The prize collecting steiner tree problem: theory and practice. In SODA, 2000.
13. K. Kar and S. Banerjee. Node placement for connected coverage in sensor networks. In WiOpt, 2003.
14. A. Krause, C. Guestrin, A. Gupta, and J. Kleinberg. Near-optimal sensor placements: Maximizing information while minimizing communication cost. Technical report, CMU-CALD-05-110, 2005.
15. A. Levin. A better approximation algorithm for the budget prize collecting tree problem. Ops. Res. Lett., 32:316-319, 2004.
16. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
17. D. J. Nott and W. T. M. Dunsmuir. Estimation of nonstationary spatial covariance structure. Biometrika, 89:819-829, 2002.
18. V. V. Vazirani. Approximation Algorithms. Springer, 2003.
19. M. Widmann and C. S. Bretherton. 50 km resolution daily precipitation for the pacific northwest. http://www.jisao.washington.edu/data_sets/widmann/, 1999.