Sciweavers

373 search results - page 2 / 75
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
IS
2006
13 years 4 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
IS
2011
12 years 8 months ago
Collection trees for event-monitoring queries
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Antonios Deligiannakis, Yannis Kotidis, Vassilis S...
BROADNETS
2004
IEEE
13 years 8 months ago
Structures for In-Network Moving Object Tracking in Wireless Sensor Networks
One important application of wireless sensor networks is tracking moving objects. The recent progress has made it possible for tiny sensors to have more computing power and storag...
Chih-Yu Lin, Yu-Chee Tseng
ICPADS
2008
IEEE
13 years 10 months ago
Response Time Constrained Top-k Query Evaluation in Sensor Networks
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...
Weifa Liang, Baichen Chen, Jeffrey Xu Yu
IPSN
2009
Springer
13 years 11 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...