An efficient mechanism for processing similarity search queries in sensor networks

  • Authors:

  • Yu-Chi Chung;I-Fang Su;Chiang Lee

  • Affiliations:

  • Department of Computer Science and Information Engineering, Chang Jung Christian University, Taiwan, ROC;Department of Information Management, Fortune Institute of Technology, Taiwan, ROC;Department of Computer Science and Information Engineering, National Cheng-Kung University, Taiwan, ROC

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2011

Quantified Score

Hi-index 0.07

Visualization

Abstract

The similarity search problem has received considerable attention in database research community. In sensor network applications, this problem is even more important due to the imprecision of the sensor hardware, and variation of environmental parameters. Traditional similarity search mechanisms are both improper and inefficient for these highly energy-constrained sensors. A difficulty is that it is hard to predict which sensor has the most similar (or closest) data item such that many or even all sensors need to send their data to the query node for further comparison. In this paper, we propose a similarity search algorithm (SSA), which is a novel framework based on the concept of Hilbert curve over a data-centric storage structure, for efficiently processing similarity search queries in sensor networks. SSA successfully avoids the need of collecting data from all sensors in the network in searching for the most similar data item. The performance study reveals that this mechanism is highly efficient and significantly outperforms previous approaches in processing similarity search queries.