An effective coreset compression algorithm for large scale sensor networks

IPSN'12 - Proceedings of the 11th International Conference on Information Processing in Sensor Networks

Volumn , Issue , 2012, Pages 257-268

  Feldman, Dan ^a   Sugaya, Andrew ^a   Rus, Daniela ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Coresets; Douglas peucker; GPS; Linear simplification; Streaming

Indexed keywords

COMPRESSION ALGORITHMS; CORE SET; DATA SETS; DISTRIBUTED SENSOR; DOUGLAS-PEUCKER; FITTING MODEL; GPS DATA; HIGH FREQUENCY DATA; LARGE SCALE SENSOR NETWORK; LINEAR SIMPLIFICATION; NETWORKED SENSORS; PARALLEL A; REAL TIME; SENSOR DATA; SENSOR PROBES; VEHICULAR SENSOR NETWORK;

ACOUSTIC STREAMING; ALGORITHMS; DATA PROCESSING; GLOBAL POSITIONING SYSTEM; SENSOR NETWORKS;

DATA COMPRESSION;

EID: 84860505035     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2185677.2185739     Document Type: Conference Paper

References (26)

1. Mobile millennium. Technical report.
2. M.A. Abam, M. de Berg, P. Hachenberger, and A. Zarei. Streaming algorithms for line simplification. Discrete and Computational Geometry, 43(3):497-515, 2010.
3. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Geometric approximations via coresets. Combinatorial and Computational Geometry - MSRI Publications, 52:1-30, 2005.
4. P. K. Agarwal, C. M. Procopiuc, and K. R. Varadarajan. Approximation algorithms for k-line center. In Proc. 10th Ann. European Symp. on Algorithms (ESA), volume 2461 of Lecture Notes in Computer Science, pages 54-63. Springer, 2002.
5. P.K. Agarwal and K.R. Varadarajan. Efficient algorithms for approximating polygonal chains. Discrete & Computational Geometry, 23(2):273-291, 2000.
6. J. Aslam, Z. Butler, F. Constantin, V. Crespi, G. Cybenko, and D. Rus. Tracking a moving object with a binary sensor network. In Proceedings of the 1st international conference on Embedded networked sensor systems, pages 150-161. ACM, 2003. (Pubitemid 40682342)
7. A. Biem, E. Bouillet, H. Feng, A. Ranganathan, A. Riabov, O. Verscheure, H. Koutsopoulos, and C. Moran. Ibm infosphere streams for scalable, real-time, intelligent transportation services. In Proceedings of the 2010 international conference on Management of data, pages 1093-1104. ACM, 2010.
8. H. Cao, O. Wolfson, and G. Trajcevski. Spatio-temporal data reduction with deterministic error bounds. The Very Large Databases (VLDB) Journal, 15(3):211-228, 2006. (Pubitemid 43938994)
9. K. Chakrabarti, M. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. The VLDB Journal, 10(2):199-223, 2001. (Pubitemid 33404198)
10. P. Cudre-Mauroux, E. Wu, and S. Madden. Trajstore: An adaptive storage system for very large trajectory data sets. In Data Engineering (ICDE), 2010 IEEE 26th International Conference on, pages 109-120. IEEE.
11. D.H. Douglas and T.K. Peucker. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica: The International Journal for Geographic Information and Geovisualization, 10(2):112-122, 1973.
12. M. Feigin, D. Feldman, and Nir Sochen. From high definition image to low space optimization. In Proc. 3rd Inter. Conf. on Scale Space and Variational Methods in Computer Vision (SSVM 2011), 2011.
13. D. Feldman and M. Langberg. A unified framework for approximating and clustering data. In Proc. 41th Ann. ACM Symp. on Theory of Computing (STOC), 2011.
14. L. Forlizzi, R.H. Güting, E. Nardelli, and M. Schneider. A data model and data structures for moving objects databases, volume 29. ACM, 2000.
15. S. Gandhi, S. Suri, and E. Welzl. Catching elephants with mice: sparse sampling for monitoring sensor networks. ACM Transactions on Sensor Networks (TOSN), 6(1):1, 2009.
16. S. Har-Peled. Coresets for discrete integration and clustering. FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, pages 33-44, 2006.
17. J.K. Hart and K. Martinez. Environmental sensor networks: A revolution in the earth system science? Earth-Science Reviews, 78(3-4):177-191, 2006. (Pubitemid 44356314)
18. J. Hershberger and J. Snoeyink. An o (n log n) implementation of the douglas-peucker algorithm for line simplification. In Proceedings of the tenth annual symposium on Computational geometry, pages 383-384. ACM, 1994.
19. * n) time. Computational Geometry, 11(3-4):175-185, 1998. (Pubitemid 128431617)
20. J.D. Hobby. Polygonal approximations that minimize the number of inflections. In Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, pages 93-102. Society for Industrial and Applied Mathematics, 1993.
21. U. Matlab. The mathworks. Inc., Natick, MA, 1992, 1760.
22. N. Meggido and A. Tamir. Finding least-distance lines. SIAM J. on Algebric and Discrete Methods, 4:207-211, 1983.
23. N. Meratnia and R.A. By. Spatiotemporal compression techniques for moving point objects. Advances in Database Technology-EDBT 2004, pages 561-562, 2004.
24. S. Owen, R. Anil, T. Dunning, and E. Friedman. Mahout in action. Online, pages 1-90, 2011.
25. Michal Piorkowski, Natasa Sarafijanovic-Djukic, and Matthias Grossglauser. CRAWDAD data set epfl/mobility (v. 2009-02-24). Downloaded from http://crawdad.cs.dartmouth.edu/epfl/mobility, February 2009.
26. S. Reddy, M. Mun, J. Burke, D. Estrin, M. Hansen, and M. Srivastava. Using mobile phones to determine transportation modes. ACM Transactions on Sensor Networks (TOSN), 6(2):13, 2010.