Distributed Efficient Similarity Search Mechanism in Wireless Sensor Networks

Sensors

Khandakar Ahmed¹  Mark A. Gregory¹ 

关键词: Wireless Sensor Networks;    distributed data centric storage;    similarity search;    range query;    K-nearest neighbor query;    sector based distance routing;   

DOI  :  10.3390/s150305474

来源: mdpi

【 摘 要 】

The Wireless Sensor Network similarity search problem has received considerable research attention due to sensor hardware imprecision and environmental parameter variations. Most of the state-of-the-art distributed data centric storage (DCS) schemes lack optimization for similarity queries of events. In this paper, a DCS scheme with metric based similarity searching (DCSMSS) is proposed. DCSMSS takes motivation from vector distance index, called iDistance, in order to transform the issue of similarity searching into the problem of an interval search in one dimension. In addition, a sector based distance routing algorithm is used to efficiently route messages. Extensive simulation results reveal that DCSMSS is highly efficient and significantly outperforms previous approaches in processing similarity search queries.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland.