Parallelizing Itinerary-Based KNN Query Processing in Wireless Sensor Networks

doi:10.1109/TKDE.2009.146

Return

Parallelizing Itinerary-Based KNN Query Processing in Wireless Sensor Networks

2010-05-01

PRE

Tao-Yang Fu *

Wang-Chien Lee (Wang-Chien Lee)

DOI：10.1109/TKDE.2009.146

Original

Original request for help

Save

Abstract

En 中文

Wireless sensor networks have been proposed for facilitating various monitoring applications (e. g., environmental monitoring and military surveillance) over a wide geographical region. In these applications, spatial queries that collect data from wireless sensor networks play an important role. One such query is the K-Nearest Neighbor (KNN) query that facilitates collection of sensor data samples based on a given query location and the number of samples specified (i.e., K). Recently, itinerary-based KNN query processing techniques, which propagate queries and collect data along a predetermined itinerary, have been developed. Prior studies demonstrate that itinerary-based KNN query processing algorithms are able to achieve better energy efficiency than other existing algorithms developed upon tree-based network infrastructures. However, how to derive itineraries for KNN query based on different performance requirements remains a challenging problem. In this paper, we propose a Parallel Concentric-circle Itinerary-based KNN (PCIKNN) query processing technique that derives different itineraries by optimizing either query latency or energy consumption. The performance of PCIKNN is analyzed mathematically and evaluated through extensive experiments. Experimental results show that PCIKNN outperforms the state-of-the-art techniques.

Keywords:

K-Nearest neighbor query

wireless sensor networks

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.