KPT: a dynamic KNN query processing algorithm for location-aware sensor networks

Authors:
Julian Winter;Wang-Chien Lee
Affiliations:
Pennsylvania State University, University Park, PA;Pennsylvania State University, University Park, PA
Venue:
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Year:
2004

Citing 3
Cited 3

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Peer-to-Peer Spatial Queries in Sensor Networks

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing

Processing k nearest neighbor queries in location-aware sensor networks

Signal Processing
C-kNN Query Processing in Object Tracking Sensor Networks

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
In-Network processing of nearest neighbor queries for wireless sensor networks

DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important type of spatial queries for sensor networks are K Nearest Neighbor (KNN) queries. Currently, research proposals for KNN query processing is based on index structures, which are typically expensive in terms of energy consumption. In addition, they are vulnerable to node failure and are difficult to maintain in dynamic sensor networks. In this paper, we propose KPT, an algorithm for dynamically processing KNN queries in location-aware sensor networks. KPT shows great potential for energy savings and improved query latency. Since the tree infrastructure is constructed only temporarily, KPT is less vulnerable to sensor node failure.