Processing the v-KNN queries in wireless sensor networks

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2007, Pages

  Lai, Yongxuan ^a,b   Chen, Hong ^a,b   Li, Cuiping ^a,b  

^a RENMIN UNIVERSITY OF CHINA   (China)

^b MOE

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COSTS; DATA SETS; ENERGY CONSUMPTION; ENERGY EFFICIENT; GLOBAL KNOWLEDGE; HOT SPOTTING; INTERNATIONAL CONFERENCES; K NEAREST NEIGHBOR (KNN) QUERY; NEW ALGORITHM; PARALLEL PROCESSING; PUSH DOWN; SIMULATION RESULTS; VALUE-BASED; WIRELESS SENSORS;

CLUSTERING ALGORITHMS; CONSERVATION; DATA PROCESSING; DETECTORS; ENERGY EFFICIENCY; ENERGY POLICY; HYBRID SENSORS; SENSOR NETWORKS; SENSORS; WIRELESS NETWORKS;

WIRELESS SENSOR NETWORKS;

EID: 47249112200     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2007.68     Document Type: Conference Paper

References (18)

1. Intel Lab Data. http://db.csail.mit.edu/labdata/labdata.html.
2. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. Wireless sensor networks: a survey. Computer Networks, 38(4):393-422, 2002.
3. S. Berchtold, D. Keim, and H. Kriegel. The X-tree: An Index Structure for High-Dimensional Data. Proc. of VLDB, pages 28-39, 1996.
4. D. CRULLER, D. ESTRIN, and M. SRIVASTAVA. Overview of sensor networks. Computer(Long Beach, CA), 37(8):41-49, 2004.
5. M. Demirbas and H. Ferhatosmanoglu. Peer-to-peer spatial queries in sensor networks. Proc. of P2p Computing, pages 32-39, 2003.
6. D. Ganesan, G. Mathur, and P. Shenoy. Rethinking Data Management for Storage-centric Sensor Networks. Proceedings of the Third Biennial Conference on Innovative Data Systems Research, January 2007.
7. D. Goldin. Faster In-Network Evaluation of Spatial Aggregation in Sensor Networks. Proc. of ICDE, 2006.
8. A. Guttman. R-trees: a dynamic index structure for spatial searching. ACM Press New York, NY, USA, 1984.
9. B. Karp and H. Kung. GPSR: greedy perimeter stateless routing for wireless networks. Proceedings of the 6th annual international conference on Mobile computing and networking, pages 243-254, 2000.
10. L. Kaufman and P. Rousseeuw. Finding groups in data. an introduction to cluster analysis. Wiley Series in Probability and Mathematical Statistics. Applied Probability and Statistics, New York: Wiley, 1990, 1990.
11. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. TAG: a Tiny AGgregation Service for Ad-Hoc Sensor Networks. Proceedings of the ACM Symposium on Operating System Design and Implementation, 2002.
12. S. Madden, R. Szewczyk, M. Franklin, and D. Culler. Supporting aggregate queries over ad-hoc wireless sensor networks. Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications, pages 49-58, 2002.
13. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker. GHT: a geographic hash table for data-centric storage. Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, pages 78-87, 2002.
14. J. Robinson. The KDB-tree: a search structure for large multidimensional dynamic indexes. ACM Press New York, NY, USA, 1981.
15. S. Shenker, S. Ratnasamy, B. Karp, R. Govindan, and D. Estrin. Data-centric storage in sensornets. SIGCOMM Comput. Commun. Rev., 33(1):137-142, 2003.
16. J. Winter and W. Lee. KPT: a dynamic KNN query processing algorithm for location-aware sensor networks. Proc. of DMSN, pages 119-124, 2004.
17. M. Xu, K. Tong, H. Kong, X. Tang, andW. Lee. Monitoring Top-k Query in Wireless Sensor Networks. Proc. of ICDE, 2006.
18. Y. Yao, X. Tang, and E.-P. Lim. In-network processing of nearest neighbor queries for wireless sensor networks. Proc. of DASFAA, 3882:35-49, April 2006.