C-kNN Query Processing in Object Tracking Sensor Networks

Authors:
Jinghua Zhu;Jianzhong Li;Jizhou Luo;Wei Zhang;Hongzhi Wang
Affiliations:
School of Computer Science & Technology, Harbin Institute of Technology, Harbin, China 150001;School of Computer Science & Technology, Harbin Institute of Technology, Harbin, China 150001;School of Computer Science & Technology, Harbin Institute of Technology, Harbin, China 150001;School of Computer Science & Technology, Harbin Institute of Technology, Harbin, China 150001;School of Computer Science & Technology, Harbin Institute of Technology, Harbin, China 150001
Venue:
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Year:
2008

Citing 9
Cited 0

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects

IEEE Transactions on Computers
Peer-to-Peer Spatial Queries in Sensor Networks

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
KPT: a dynamic KNN query processing algorithm for location-aware sensor networks

DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Monitoring k-Nearest Neighbor Queries over Moving Objects

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Energy Efficient Processing of K Nearest Neighbor Queries in Location-aware Sensor Networks

MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
ProcessingWindow Queries in Wireless Sensor Networks

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
On target tracking with binary proximity sensors

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks (WSNs) are being developed for a variety of applications. Continuous k nearest neighbors (C-kNN) query is an essential class of spatial query in object tracking applications. Due to the limited power of individual node, energy is the most critical resource in sensor networks. In order to always report the up-to-date results, a centralized solution requires the transmission of a large number of location update messages. Intuitively, current information is necessary only for objects that may influence some query results. Motivated by this observation, we propose a threshold-based C-kNN search algorithm with the minimal message transmissions. The key idea is to set thresholds for moving objects corresponding to each query so that only the location updates which affect the final results are transmitted. The proposed method can be used with multiple, static or moving queries. The experiments results show the effectiveness and efficiency of our approach in terms of energy and latency.