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.
| Original language | English (US) |
|---|---|
| Pages | 119-124 |
| Number of pages | 6 |
| DOIs | |
| State | Published - Dec 1 2004 |
| Event | 1st International Workshop on Data Management for Sensor Networks, DMSN '04, in Conjunction with VLDB 2004 - Toronto, ON, Canada Duration: Aug 30 2004 → Aug 30 2004 |
Other
| Other | 1st International Workshop on Data Management for Sensor Networks, DMSN '04, in Conjunction with VLDB 2004 |
|---|---|
| Country | Canada |
| City | Toronto, ON |
| Period | 8/30/04 → 8/30/04 |
All Science Journal Classification (ASJC) codes
- Human-Computer Interaction
- Computer Networks and Communications
- Computer Vision and Pattern Recognition
- Software