Title: Parallelizing Itinerary-Based KNN Query Processing in Wireless Sensor Networks
Authors: Fu, Tao-Yang
Peng, Wen-Chih
Lee, Wang-Chien
資訊工程學系
Department of Computer Science
Keywords: K-Nearest neighbor query;wireless sensor networks
Issue Date: 1-May-2010
Abstract: 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.
URI: http://dx.doi.org/10.1109/TKDE.2009.146
http://hdl.handle.net/11536/5463
ISSN: 1041-4347
DOI: 10.1109/TKDE.2009.146
Journal: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Volume: 22
Issue: 5
Begin Page: 711
End Page: 729
Appears in Collections:Articles


Files in This Item:

  1. 000275652400008.pdf