Sciweavers

Share
DMSN
2004
ACM

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

10 years 3 months ago
KPT: a dynamic KNN query processing algorithm for location-aware sensor networks
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.
Julian Winter, Wang-Chien Lee
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where DMSN
Authors Julian Winter, Wang-Chien Lee
Comments (0)
books