TSAR
- 2 November 2005
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems are designed primarily for flat hierarchies of homogeneous sensor nodes and do not fully exploit the multi-tier nature of emerging sensor networks, where an application can comprise tens of tethered proxies, each managing tens to hundreds of untethered sensors. We present TSAR, a fundamentally different storage architecture that envisions separation of data from metadata by employing local archiving at the sensors and distributed indexing at the proxies. At the proxy tier, TSAR employs a novel multi-resolution ordered distributed index structure, the Interval Skip Graph, for efficiently supporting spatio-temporal and value queries. At the sensor tier,TSAR supports energy-aware adaptive summarization that can trade off the cost of transmitting metadata to the proxies against the overhead of false hits resulting from querying a coarse-grain index. We implement TSAR in a two-tier sensor testbed comprising Stargate-based proxies and Mote-based sensors. Our experiments demonstrate the benefits and feasibility of using our energy-efficient storage architecture in multi-tier sensor networks.Keywords
This publication has 13 references indexed in Scilit:
- A system for simulation, emulation, and deployment of heterogeneous sensor networksPublished by Association for Computing Machinery (ACM) ,2004
- Versatile low power media access for wireless sensor networksPublished by Association for Computing Machinery (ACM) ,2004
- An evaluation of multi-resolution storage for sensor networksPublished by Association for Computing Machinery (ACM) ,2003
- DIFS: a distributed index for features in sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- GHTPublished by Association for Computing Machinery (ACM) ,2002
- A scalable content-addressable networkPublished by Association for Computing Machinery (ACM) ,2001
- Directed diffusionPublished by Association for Computing Machinery (ACM) ,2000
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975