2015 Seventh International Symposium on Parallel Architectures, Algorithms and Programming (PAAP) (2015)
Dec. 12, 2015 to Dec. 14, 2015
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2015.19
In Wireless Sensor Networks (WSNs), the large amount of high-dimensional sensed data play a key role in many emerging WSN applications. Existing approaches to similarity search rely on the assumption that sensed data are centralized to deal with, or sensed data are simple enough to be stored in a relational database. In this article, we propose a distributed approximate similarity search (DASS) algorithm to retrieve similar sensed data for range queries by comparing the similarity score of each sensed data with a specified threshold, while taking into account search performance and energy efficiency. The results show that the proposed method provides significant performance gains in terms of precision and energy efficiency compared to existing algorithms.
Wireless sensor networks, Approximation algorithms, Distributed databases, Energy efficiency, Algorithm design and analysis, Search problems
H. Hu, J. He and J. Wu, "Distributed Processing of Approximate Range Queries in Wireless Sensor Networks," 2015 Seventh International Symposium on Parallel Architectures, Algorithms and Programming (PAAP), Nanjing, China, 2015, pp. 45-51.