Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Best-effort cache synchronization with source cooperation
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Maintaining variance and k-medians over data stream windows
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dimensions: why do we need a new data handling architecture for sensor networks?
ACM SIGCOMM Computer Communication Review
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Energy Efficient Data Collection in Distributed Sensor Environments
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
From ethnography to design in a vineyard
Proceedings of the 2003 conference on Designing for user experiences
Adaptive stream resource management using Kalman Filters
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A resource--efficient time estimation for wireless sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Snapshot Queries: Towards Data-Centric Sensor Networks
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Sketching streams through the net: distributed approximate query tracking
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Approximate Data Collection in Sensor Networks using Probabilistic Models
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
PAQ: time series forecasting for approximate query answering in sensor networks
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Distributed Online Simultaneous Fault Detection for Multiple Sensors
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
Energy-efficient data acquisition by adaptive sampling for wireless sensor networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
EDGES: Efficient data gathering in sensor networks using temporal and spatial correlations
Journal of Systems and Software
A wavelet transform for efficient consolidation of sensor relations with quality guarantees
Proceedings of the VLDB Endowment
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Hi-index | 0.00 |
We propose an energy-efficient framework, called SAF, for approximate querying and clustering of nodes in a sensor network. SAF uses simple time series forecasting models to predict sensor readings. The idea is to build these local models at each node, transmit them to the root of the network (the "sink"), and use them to approximately answer user queries. Our approach dramatically reduces communication relative to previous approaches for querying sensor networks by exploiting properties of these local models, since each sensor communicates with the sink only when its local model varies due to changes in the underlying data distribution. In our experimental results performed on a trace of real data, we observed on average about 150 message transmissions from each sensor over a week (including the learning phase) to correctly predict temperatures to within +/- 0.5°C.SAF also provides a mechanism to detect data similarities between nodes and organize nodes into clusters at the sink at no additional communication cost. This is again achieved by exploiting properties of our local time series models, and by means of a novel definition of data similarity between nodes that is based not on raw data but on the prediction values. Our clustering algorithm is both very efficient and provably optimal in the number of clusters. Our clusters have several interesting features: first, they can capture similarity between far away nodes that are not geographically adjacent; second, cluster membership to variations in sensors' local models; third, nodes within a cluster are not required to track the membership of other nodes in the cluster. We present a number of simulation-based experimental results that demonstrate these properties of SAF.