Data Acquisition in Sensor Networks with Large Memories

Authors:
D. Zeinalipour-Yazti;Neema, V. Kalogeraki;D. Gunopulos;W. Najjar
Affiliations:
University of California - Riverside;University of California - Riverside;University of California - Riverside;University of California - Riverside
Venue:
ICDEW '05 Proceedings of the 21st International Conference on Data Engineering Workshops
Year:
2005

Citing 0
Cited 5

The threshold join algorithm for top-k queries in distributed sensor networks

DMSN '05 Proceedings of the 2nd international workshop on Data management for sensor networks
Efficient indexing data structures for flash-based sensor devices

ACM Transactions on Storage (TOS)
Exploiting Spatio-temporal Correlations for Data Processing in Sensor Networks

GeoSensor Networks
Finding the K highest-ranked answers in a distributed network

Computer Networks: The International Journal of Computer and Telecommunications Networking
Supporting historic queries in sensor networks with flash storage

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sensor Networks will soon become ubiquitous, making them essential tools for monitoring the activity and evolution of our surrounding environment. However such environments are expected to generate vast amounts of temporal data that needs to be processed in a power-effective manner. To this date sensor nodes feature small amounts of memory which mostly limits their capabilities to queries that only refer to the current point in time. In this paper we initiate a study on the deployment of large memories at sensor nodes. Such an approach gives birth to an array of new temporal and top-k queries which have been extensively studied by the database community. Our discussion is in the context of the RISE (RIverside SEnsor) hardware platform, in which sensor nodes feature external flash card memories that provides them several Megabytes of storage.