Peer-to-peer spatial queries in sensor networks

Proceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003

Volumn , Issue , 2003, Pages 32-39

  Demirbas, M ^a   Ferhatosmanoglu, H ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Acoustic sensors; Context; Indexing; Magnetic sensors; Peer to peer computing; Query processing; Sensor systems; Thermal sensors; Wireless communication; Wireless sensor networks

Indexed keywords

DECISION TREES; DISTRIBUTED COMPUTER SYSTEMS; ENERGY UTILIZATION; FORESTRY; IMAGE SEGMENTATION; INDEXING (MATERIALS WORKING); INDEXING (OF INFORMATION); MAGNETIC SENSORS; NEAREST NEIGHBOR SEARCH; QUERY LANGUAGES; QUERY PROCESSING; SENSOR NODES; TREES (MATHEMATICS); WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

ACOUSTIC SENSORS; CONTEXT; PEER-TO-PEER COMPUTING; SENSOR SYSTEMS; THERMAL SENSORS; WIRELESS COMMUNICATIONS;

PEER TO PEER NETWORKS;

EID: 84943805294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PTP.2003.1231501     Document Type: Conference Paper

References (33)

1. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R∗ tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322-331, May 23-25 1990.
2. S. Berchtold, C. Bohm, D. Keim, and H. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proc. ACM Symp. on Principles of Database Systems, pages 78-86, Tuscon, Arizona, June 1997.
3. S. Berchtold and H.-P. Kriegel. S3: Similarity search in CAD database systems. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 564-567, Tuscon, Arizona, 1997.
4. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful. In Int. Conf. on Database Theory, pages 217-225, Jerusalem, Israel, January 1999.
5. N. Bulusu, J. Heidemann, and D. Estrin. Adaptive beacon placement. In Proceedings of the 21st International Conference on Distributed Computing Systems, pages 489-498, 2001.
6. X. Cheng, R. Dolin, M. Neary, S. Prabhakar, K. Ravikanth, D. Wu, D. Agrawal, A. El Abbadi, M. Freeston, A. Singh, T. Smith, and J. Su. Scalable access within the context of digital libraries. In IEEE Proceedings of the International Conference on Advances in Digital Libraries, ADL, pages 70-81, Washington, D.C., 1997.
7. Y. Choi, M. Gouda, M. C. Kim, and A. Arora. The mote connectivity protocol. Technical Report TR03-08, Department of Computer Sciences, The University of Texas at Austin, 2003.
8. A. Cournier, A.K. Datta, F. Petit, and V. Villain. Self-stabilizing PIF algorithms in arbitrary networks. International Conference on Distributed Computing Systems (ICDCS), pages 91-98, 2001.
9. M. Demirbas, A. Arora, and M. Gouda. A pursuer-evader game for sensor networks. Sixth Symposium on Self-Stabilizing Systems(SSS'03), pages 1-16, 2003.
10. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11), 1974.
11. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz. Efficient and effective querying by image content. Journal of Intelligent Information Systems, 3:231-262, 1994.
12. H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. El Abbadi. Constrained nearest neighbor queries. In Proc. of the 7th International Symposium on Spatial and Temporal Databases (SSTD), pages 257-276, Los Angeles, CA, July 2001.
13. Gnutella. http://www.gnutella.com.
14. A. Gupta, D. Agrawal, and A. El Abbadi. Approximate range selection queries in peer-to-peer systems. In First Biennial Conference on Innovative Data Systems Research, Asilomar, CA, January 2003.
15. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47-57, 1984.
16. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems, 2003.
17. J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pister. System architecture directions for network sensors. ASPLOS, pages 93-104, 2000.
18. G. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Transactions on Database Systems, 24(2):265-318, 1999.
19. G. R. Hjaltason and H. Samet. Ranking in spatial databases. In Proc. of 4th Int. Symp. on Large Spatial Databases, pages 83-95, Portland,ME, 1995.
20. Kazaa. http://www.kazaa.com.
21. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, Dallas, USA, May 2000.
22. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast nearest neighbor search in medical image databases. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 215-226, Mumbai, India, 1996.
23. S. R. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. The design of an acquisitional query processor for sensor networks. In Proc. ACM SIGMOD Int. Conf. on Management of Data, San Diego, June 2003. To appear.
24. A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson. Wireless sensor networks for habitat monitoring. ACM Int. Workshop on Wireless Sensor Networks and Applications, September 2002.
25. V. Mittal, M. Demirbas, and A. Arora. LOCI: Local clustering in large scale wireless networks. Technical Report OSU-CISRC-2/03-TR07, The Ohio State University, February 2003.
26. Napster. http://www.napster.com.
27. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, San Diego, CA, August 2001.
28. N. Roussopoulos, S. Kelly, and F. Vincent. Nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 71-79, San Jose, California, May 1995.
29. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM, San Diego, CA, August 2001.
30. Y.-M. Wang, W. Russell, A. Arora, J. Xu, and R. Jagannathan. Towards dependable home networking: An experience report. International Conference on Dependable Systems and Networks, 2000.
31. C. Yang and K.-Ip Lin. An index structure for efficient reverse nearest neighbor queries. In Proceedings of the 17th International Conference on Data Engineering, Rome, Italy, 2001.
32. 3: Scalable self-configuration and self-healing in wireless networks. In 21st ACM Symposium on Principles of Distributed Computing, July 2002.
33. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report CSD-01-1141, U. C. Berkeley, April 2001.