Sensor selection for minimizing worst-case prediction error

Proceedings - 2008 International Conference on Information Processing in Sensor Networks, IPSN 2008

Volumn , Issue , 2008, Pages 97-108

  Das, Abhimanyu ^a   Kempe, David ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

K-MEDIAN CLUSTERING; PREDICTION ERRORS;

AGGREGATES; APPROXIMATION ALGORITHMS; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; COMPUTER NETWORKS; DATA STRUCTURES; ERROR ANALYSIS; FLOW OF SOLIDS; FORECASTING; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; WIRELESS SENSOR NETWORKS;

SENSOR NETWORKS;

EID: 51249111157     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPSN.2008.40     Document Type: Conference Paper

References (29)

1. Intel Research Berkeley Lab Sensor Data, 2004. http://db.csail.mit.edu/ labdata/labdata.html.
2. The SensorScope Project. http://sensorscope.epfl.ch.
3. Z. Abrams, A. Goel, and S. Plotkin. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In Proc. 3rd Intl. Symp. on Information Processing in Sensor Networks, 2004.
4. K. Anstreicher, M. Fampa, J. Lee, and J. Williams. An exact algorithm for maximum entropy sampling. Operations Research, 43(4):684-691, 1995.
5. K. Anstreicher, M. Fampa, J. Lee, and J. Williams. Maximum-entropy remote sampling. Discrete Applied Mathematics, 108(3):211-226, 2001.
6. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. In Proc. 33rd ACM Symp. on Theory of Computing, 2001.
7. B. Bash, J. Byers, and J. Considine. Approximately uniform random sampling in sensor networks. In Proc. 1st Intl. Workshop on Data Management for Sensor Networks, pages 32-39, 2004.
8. F. Bian, D. Kempe, and R. Govindan. Utility-based sensor selection. In Proc. 5th Intl. Symp. on Information Processing in Sensor Networks. 2006.
9. J. Byers and G. Nasser. Utility-based decision-making in wireless sensor networks. In IEEE MobiHoc, pages 143-144, 2000.
10. M. Charikar and S. Guha. Improved combinatorial algorithms for facility location problems. SIAM J. on Computing, 34:803-824, 2005.
11. M. Charikar, S. Guha, D. Shmoys, and E. Tardos. A constant-factor approximation algorithm for the k-median problem. Journal of Computer and System Sciences, 65:129-149, 2002.
12. A. Das and D. Kempe. Algorithms for subset selection in linear regression. In ACM Symposium on Theory of Computing, 2008.
13. A. Deshpande, C. Guestrin, S. Madden, J. Hellerstein, and W. Hong. Model driven data acquisition in sensor networks. In Proc. 30th Intl. Conf on Very Large Data Bases, 2004.
14. S. Ganeriwal, C. Han, and M. Srivastava. Going beyond spatial aggregates in sensor networks. Technical report, NESL, 2004.
15. C. Guestrin, A. Krause, and A. Singh. Near-optimal sensor placements in gaussian processes. In Proc. Intl. Conference on Machine Learning, 2005.
16. H. Gupta, V. Navda, S. Das, and V. Chowdhary. Efficient gathering of correlated data in sensor networks. In Proc. 6th ACM Symp. on Mobile Ad Hoc Networking and Computing, 2005.
17. D. Hochbaum and D. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10:180-184, 1985.
18. W. Hsu and G. Nemhauser. Easy and hard bottleneck location problems. Discrete Applied Mathematics, 1:209-216, 1979.
19. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problem. In Proc. 34th ACM Symp. on Theory of Computing, pages 731-740, 2002.
20. K. Jain and V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. In Proc. 40th IEEE Symp. on Foundations of Computer Science, pages 2-13, 1999.
21. R. Johnson and D. Wichern. Applied Multivariate Statistical Analysis. Prentice Hall, 2002.
22. P. Liaskovitis and C. Schurgers. Leveraging redundancy in sampling-interpolation applications for sensor networks. In Proc. Intl. Conf. on Distributed Computing in Sensor Systems, 2007.
23. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In Proc. 20th IEEE INFOCOM Conference, pages 1380-1387, 2001.
24. A. Miller. Subset Selection in Regression. Chapman and Hall, second edition, 2002.
25. S. Pattern, B. Krishnamachari, and R. Govindan. The impact of spatial correlation on routing with compression in wireless sensor networks. In Proc. 3rd Intl. Symp. on Information Processing in Sensor Networks, 2004.
26. J. Tropp. Topics in Sparse Approximation. PhD thesis, University of Texas, Austin, 2004.
27. V Vazirani. Approximation Algorithms. Springer, 2001.
28. Z. Xiong, A. Livens, and S. Cheng. Distributed source coding for sensor networks. In IEEE Signal Processing Magazine, 1998.
29. S. Yoon and C. Shahabi. The clustered aggregation (cag) technique leveraging spatial and temporal correlations in wireless sensor networks. ACM Transactions on Sensor Networks, 3, 2007.