SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
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
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
Optimizing parallel itineraries for knn query processing in wireless sensor networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Context-aware systems: A literature review and classification
Expert Systems with Applications: An International Journal
Searching K-nearest neighbor nodes based on node density in ad hoc networks
Proceedings of the 10th International Conference on Advances in Mobile Computing & Multimedia
Spatial query processing in wireless sensor networks - A survey
Information Fusion
| Hi-index | 0.08 |
Efficient search for k nearest neighbors to a given location point (called a KNN query) is an important problem arising in a variety of sensor network applications. In this paper, we investigate in-network query processing strategies under a KNN query processing framework in location-aware wireless sensor networks. A set of algorithms, namely the geo-routing tree, the KNN boundary tree and the itinerary-based KNN algorithms, are designed in accordance with the global infrastructure-based, local infrastructure-based and infrastructure-free strategies, respectively. They have distinctive performance characteristics and are desirable under different contexts. We evaluate the performance of these algorithms under several sensor network scenarios and application requirements, and identify the conditions under which the various approaches are preferable.