By Topic

Towards Spatial Window Queries Over Continuous Phenomena in Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guang Jin ; Univ. of Maine, Boardman ; Nittel, S.

Recent research on sensor networks has focused on the efficient processing of declarative SQL queries over sensor nodes. Users are often interested in querying an underlying continuous phenomenon such as a toxic plume, whereas only discrete readings of sensor nodes are available. Therefore, additional information estimation methods are necessary to process the sensor readings to generate the required query results. Most estimation methods are computationally intensive, even when computed in a traditional centralized setting. Furthermore, energy and communication constraints of sensor networks challenge the efficient application of established estimation methods in sensor networks. In this paper, we present an approach using Gaussian kernel estimation to process spatial window queries over continuous phenomena in sensor networks. The key contribution of our approach is the use of a small number of Hermite coefficients to approximate the Gaussian kernel function for subclustered sensor nodes. As a result, our algorithm reduces the size of messages transmitted in the network by logarithmic order, thus saving resources while still providing high-quality query results.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:19 ,  Issue: 4 )