The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A new method for similarity indexing of market basket data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Using semantic caching to manage location dependent data in mobile computing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Analysis of recommendation algorithms for e-commerce
Proceedings of the 2nd ACM conference on Electronic commerce
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Efficient and tumble similar set retrieval
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Spatial queries in wireless broadcast systems
Wireless Networks - Special issue: Pervasive computing and communications
Editorial: In memory of Mieso Denko
Journal of Network and Computer Applications
Performance Analysis and Improvement Content Discovery Protocols Over Vehicular Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Sensor networks build temporary wireless connections in environments where the stationary infrastructures are either destroyed or too expensive to construct. Most of the previous research in sensor networks focuses on routing protocols that adapt to the dynamic network topologies, and not much work has been done on data accessing. One important data accessing application is similarity search, which provides the foundation of content-based retrieval. Many traditional similarity search algorithms are based on centralized or flooding mechanisms, which are not effective in wireless sensor network environments due to the multiple limitations such as bandwidth and power. In this paper we tackle the problem of similarity search by using semantic-based caching to reflect the data content distribution in the network. The basic idea is analyzing the cached results of earlier queries and trying to resolve the later queries within a small collection of content-related mobile nodes. Based on a Hilbert space-filling curve, the data points in a multi-dimensional semantic space are described as a linear representation. These data points are further cached to facilitate query processing. Through extensive simulations, we show that our method can perform similarity search with improved performance in terms of search cost and response time.