Efficient processing of aggregation queries in sensor networks
Distributed and Parallel Databases
Processing k nearest neighbor queries in location-aware sensor networks
Signal Processing
Optimizing parallel itineraries for knn query processing in wireless sensor networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
MLDS: A flexible location directory service for tiered sensor networks
Computer Communications
C-kNN Query Processing in Object Tracking Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Localized monitoring of kNN queries in wireless sensor networks
The VLDB Journal — The International Journal on Very Large Data Bases
An optimized algorithm for approximate k-NN queries in wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Data aggregation in sensor networks using learning automata
Wireless Networks
Design and implementation of a flexible location directory service for tiered sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
| Hi-index | 0.00 |
The k nearest neighbor (KNN) query, an essential query for information processing in sensor networks, has not received sufficient attention in the research community of sensor networks. In this paper, we examine in-network processing of KNN queries by proposing two alternative algorithms, namely the GeoRouting Tree (GRT) and the KNN Boundary Tree (KBT). The former is based on a distributed spatial index structure and prunes off the irrelevant nodes during query propagation. The latter is based upon ad-hoc geographic routing and first obtains a region within which at least k nearest sensor nodes are enclosed and then decides the k nearest nodes to the query point. We provide an extensive performance evaluation to study the impact of various system factors and protocol parameters. Our results show that GRT yields a good tradeoff between energy consumption and query accuracy in static scenarios. On the other hand, KBT achieves better energy efficiency while being more tolerant to network dynamics.