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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Human-Computer Interaction
- Computer Networks and Communications
- Computer Vision and Pattern Recognition
- Software
Cite this
}
KPT : A dynamic KNN query processing algorithm for location-aware sensor networks. / Winter, Julian; Lee, Wang-chien.
2004. 119-124 Paper presented at 1st International Workshop on Data Management for Sensor Networks, DMSN '04, in Conjunction with VLDB 2004, Toronto, ON, Canada.Research output: Contribution to conference › Paper
TY - CONF
T1 - KPT
T2 - A dynamic KNN query processing algorithm for location-aware sensor networks
AU - Winter, Julian
AU - Lee, Wang-chien
PY - 2004/12/1
Y1 - 2004/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77954452003&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954452003&partnerID=8YFLogxK
U2 - 10.1145/1052199.1052219
DO - 10.1145/1052199.1052219
M3 - Paper
SP - 119
EP - 124
ER -