Issue No. 12 - December (2008 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.80
Shan-Hung Wu , National Taiwan University, Taipei, Taiwan
Kun-Ta Chuang , National Taiwan University, Taipei, Taiwan
Chung-Min Chen , National Taiwan University, Taipei, Taiwan
Ming-Syan Chen , National Taiwan University, Taipei, Taiwan
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. Creation and maintenance of these index structures, to reflect the network dynamics due to sensor node mobility, may result in long query response time and low battery efficiency, thus limiting their practical use. We propose a maintenance-free, itinerary-based approach called Density-aware Itinerary KNN query processing (DIKNN). The DIKNN divides the search area into multiple cone-shape areas centered at the query point. It then performs a query dissemination and response collection itinerary in each of the cone-shape areas in parallel. The design of the DIKNN scheme takes into account several challenging issues such as the tradeoff between degree of parallelism and network interference on query response time, and the dynamic adjustment of the search radius (in terms of number of hops) according to spatial irregularity or mobility of sensor nodes. This model is validated by extensive simulations. The simulation results show that DIKNN yields substantially better performance and scalability over previous work, both as k increases and as the sensor node mobility increases.
Database Management, Information Storage and Retrieval, Query processing
K. Chuang, S. Wu, M. Chen and C. Chen, "Toward the Optimal Itinerary-Based KNN Query Processing in Mobile Sensor Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 20, no. , pp. 1655-1668, 2008.