In-Network Historical Data Storage and Query Processing Based on Distributed Indexing Techniques in Wireless Sensor Networks

Authors:
Chunyu Ai;Ruiying Du;Minghong Zhang;Yingshu Li
Affiliations:
Georgia State University, Atlanta, USA;Georgia State University, Atlanta, USA and Wuhan Computer School of Wuhan University, Wuhan, China;Georgia State University, Atlanta, USA and Department of Mathematics, Graduate University, Chinese Academy of Sciences, Beijing, China;Georgia State University, Atlanta, USA
Venue:
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Year:
2009

Citing 5
Cited 1

Data-centric storage in sensornets

ACM SIGCOMM Computer Communication Review
Multi-dimensional range queries in sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
TinyDB: an acquisitional query processing system for sensor networks

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
DIST: a distributed spatio-temporal index structure for sensor networks

Proceedings of the 14th ACM international conference on Information and knowledge management
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management

Energy-efficient query management scheme for a wireless sensor database system

EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of existing data processing approaches of wireless sensor networks are real-time. However, historical data of wireless sensor networks are also significant for various applications. No previous study has specifically addressed distributed historical data query processing. In this paper, we propose an Index based Historical Data Query Processing scheme which stores historical data locally and processes queries energy-efficiently by using a distributed index tree. The simulation study shows that our scheme achieves good performance on both query responding delay and network traffic.