Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Towards Sensor Database Systems
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Database Systems Concepts
Duplicate detection in click streams
WWW '05 Proceedings of the 14th international conference on World Wide Web
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Operator placement for in-network stream query processing
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
REED: robust, efficient filtering and event detection in sensor networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On In-network Synopsis Join Processing for Sensor Networks
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Approximately detecting duplicates for streaming data using stable bloom filters
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Avrora: scalable sensor network simulation with precise timing
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
In-network execution of monitoring queries in sensor networks
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Improving distributed join efficiency with extended bloom filter operations
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Query Processing in Sensor Networks
IEEE Pervasive Computing
End-to-end support for joins in large-scale publish/subscribe systems
Proceedings of the VLDB Endowment
Towards Efficient Processing of General-Purpose Joins in Sensor Networks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
On Join Location in Sensor Networks
MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
Join of Multiple Data Streams in Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Adaptive and decentralized operator placement for in-network query processing
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Processing continuous join queries in sensor networks: a filtering approach
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Cardinality estimation and dynamic length adaptation for Bloom filters
Distributed and Parallel Databases
Dynamic join optimization in multi-hop wireless sensor networks
Proceedings of the VLDB Endowment
SNEE: a query processor for wireless sensor networks
Distributed and Parallel Databases
Cost based in-network join strategy in tree routing sensor networks
Information Sciences: an International Journal
Communication-Efficient implementation of range-joins in sensor networks
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Communication-Efficient implementation of join in sensor networks
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
| Hi-index | 0.07 |
Wireless sensor networks (WSNs) have recently received a lot of attention and several techniques have been proposed for in-network join processing. Since sensor readings are continuously collected and it is interesting to track the relationships between sensor readings in order to detect the events of interest, the in-network joins with time windows are very important for WSNs. Most of existing techniques on in-network join processing for sensor networks transmit sensor readings redundantly in a time window and result in a lot of unnecessary energy consumption. In this paper, we propose the energy-efficient time-windowed in-network join algorithm for Sensor networks (TWINS). We devise three optimization rules to reduce redundant transmissions of sensor data effectively by using compact representations of time durations and join attribute values. We conduct extensive experiments using synthetic and real-life data sets. Our experimental results confirm that the energy consumption of TWINS is much smaller than that of the existing state-of-the-art algorithms for time-windowed in-network joins.