skip to main content
10.1145/1098918.1098923acmconferencesArticle/Chapter ViewAbstractPublication PagessensysConference Proceedingsconference-collections
Article

TSAR: a two tier sensor storage architecture using interval skip graphs

Published: 02 November 2005 Publication History

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.

References

[1]
James Aspnes and Gauri Shah. Skip graphs. In Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 384--393, Baltimore, MD, USA, 12--14 January 2003.]]
[2]
Jon Louis Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509--517, 1975.]]
[3]
Philippe Bonnet, J. E. Gehrke, and Praveen Seshadri. Towards sensor database systems. In Proceedings of the Second International Conference on Mobile Data Management., January 2001.]]
[4]
Chipcon. CC2420 2.4 GHz IEEE 802.15.4 / ZigBee-ready RF transceiver, 2004.]]
[5]
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press and McGraw-Hill, second edition edition, 2001.]]
[6]
Adina Crainiceanu, Prakash Linga, Johannes Gehrke, and Jayavel Shanmugasundaram. Querying Peer-to-Peer Networks Using P-Trees. Technical Report TR2004-1926, Cornell University, 2004.]]
[7]
Hui Dai, Michael Neufeld, and Richard Han. ELF: an efficient log-structured flash file system for micro sensor nodes. In SenSys '04: Proceedings of the 2nd international conference on Embedded networked sensor systems, pages 176--187, New York, NY, USA, 2004. ACM Press.]]
[8]
Peter Desnoyers, Deepak Ganesan, Huan Li, and Prashant Shenoy. PRESTO: A predictive storage architecture for sensor networks. In Tenth Workshop on Hot Topics in Operating Systems (HotOS X)., June 2005.]]
[9]
Deepak Ganesan, Ben Greenstein, Denis Perelyubskiy, Deborah Estrin, and John Heidemann. An evaluation of multi-resolution storage in sensor networks. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys)., 2003.]]
[10]
L. Girod, T. Stathopoulos, N. Ramanathan, J. Elson, D. Estrin, E. Osterweil, and T. Schoellhammer. A system for simulation, emulation, and deployment of heterogeneous sensor networks. In Proceedings of the Second ACM Conference on Embedded Networked Sensor Systems, Baltimore, MD, 2004.]]
[11]
B. Greenstein, D. Estrin, R. Govindan, S. Ratnasamy, and S. Shenker. DIFS: A distributed index for features in sensor networks. Elsevier Journal of Ad Hoc Networks, 2003.]]
[12]
Antonin Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pages 47--57, New York, NY, USA, 1984. ACM Press.]]
[13]
Nicholas Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, and Alec Wolman. Skipnet: A scalable overlay network with practical locality properties. In In proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (USITS '03), Seattle, WA, March 2003.]]
[14]
Jason Hill, Robert Szewczyk, Alec Woo, Seth Hollar, David Culler, and Kristofer Pister. System architecture directions for networked sensors. In Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX), pages 93--104, Cambridge, MA, USA, November 2000. ACM.]]
[15]
Atmel Inc. 4-megabit 2.5-volt or 2.7-volt DataFlash AT45DB041B, 2005.]]
[16]
Samsung Semiconductor Inc. K9W8G08U1M, K9K4G08U0M: 512M x 8 bit / 1G x 8 bit NAND flash memory, 2003.]]
[17]
Chalermek Intanagonwiwat, Ramesh Govindan, and Deborah Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking, pages 56--67, Boston, MA, August 2000. ACM Press.]]
[18]
Xin Li, Young-Jin Kim, Ramesh Govindan, and Wei Hong. Multi-dimensional range queries in sensor networks. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys)., 2003. to appear.]]
[19]
Witold Litwin, Marie-Anne Neimat, and Donovan A. Schneider. RP*: A family of order preserving scalable distributed data structures. In VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases, pages 342--353, San Francisco, CA, USA, 1994.]]
[20]
Samuel Madden, Michael Franklin, Joseph Hellerstein, and Wei Hong. TAG: a tiny aggregation service for ad-hoc sensor networks. In OSDI, Boston, MA, 2002.]]
[21]
A. Mitra, A. Banerjee, W. Najjar, D. Zeinalipour-Yazti, D.Gunopulos, and V. Kalogeraki. High performance, low power sensor platforms featuring gigabyte scale storage. In SenMetrics 2005: Third International Workshop on Measurement, Modeling, and Performance Analysis of Wireless Sensor Networks, July 2005.]]
[22]
J. Polastre, J. Hill, and D. Culler. Versatile low power media access for wireless sensor networks. In Proceedings of the Second ACM Conference on Embedded Networked Sensor Systems (SenSys), November 2004.]]
[23]
William Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668--676, 1990.]]
[24]
S. Ratnasamy, D. Estrin, R. Govindan, B. Karp, L. Yin S. Shenker, and F. Yu. Data-centric storage in sensornets. In ACM First Workshop on Hot Topics in Networks, 2001.]]
[25]
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of the 2001 ACM SIGCOMM Conference, 2001.]]
[26]
S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker. GHT - a geographic hash-table for data-centric storage. In First ACM International Workshop on Wireless Sensor Networks and their Applications, 2002.]]
[27]
N. Xu, E. Osterweil, M. Hamilton, and D. Estrin. http://www.lecs.cs.ucla.edu/~nxu/ess/. James Reserve Data.]]

Cited By

View all
  • (2021)Aspects of Security for Accelerating Artificial Intelligence inside Internet of Things Centric Distributed Storage Network2021 6th International Multi-Topic ICT Conference (IMTIC)10.1109/IMTIC53841.2021.9719866(1-9)Online publication date: 10-Nov-2021
  • (2020)Demo: Skip Graph Middleware Implementation2020 International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS51746.2020.00042(335-337)Online publication date: Sep-2020
  • (2018)Creating a secure index for distributed data on the sensor networkInternational Journal of Sensor Networks10.5555/3272272.327227727:3(180-199)Online publication date: 1-Jan-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SenSys '05: Proceedings of the 3rd international conference on Embedded networked sensor systems
November 2005
340 pages
ISBN:159593054X
DOI:10.1145/1098918
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 November 2005

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. archival storage
  2. indexing methods
  3. wireless sensor networks

Qualifiers

  • Article

Conference

SenSys05: ACM Conference on Embedded Network Sensor Systems
November 2 - 4, 2005
California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 198 of 990 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)2
Reflects downloads up to 18 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Aspects of Security for Accelerating Artificial Intelligence inside Internet of Things Centric Distributed Storage Network2021 6th International Multi-Topic ICT Conference (IMTIC)10.1109/IMTIC53841.2021.9719866(1-9)Online publication date: 10-Nov-2021
  • (2020)Demo: Skip Graph Middleware Implementation2020 International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS51746.2020.00042(335-337)Online publication date: Sep-2020
  • (2018)Creating a secure index for distributed data on the sensor networkInternational Journal of Sensor Networks10.5555/3272272.327227727:3(180-199)Online publication date: 1-Jan-2018
  • (2018)Creating a secure index for distributed data on the sensor networkInternational Journal of Sensor Networks10.5555/3272258.327226327:3(180-199)Online publication date: 1-Jan-2018
  • (2018)Creating a secure index for distributed data on the sensor networkInternational Journal of Sensor Networks10.1504/IJSNET.2018.09312927:3(180-199)Online publication date: 1-Jan-2018
  • (2017)A scalable and hierarchical P2P architecture based on Pancake graph for group communicationJournal of High Speed Networks10.3233/JHS-17057223:4(287-309)Online publication date: 2-Nov-2017
  • (2017)An Optimal Clustering Routing Algorithm for Wireless Sensor Networks with Small-World PropertyWireless Personal Communications: An International Journal10.1007/s11277-017-4335-896:2(2983-2998)Online publication date: 1-Sep-2017
  • (2016)CSRQ: Communication-Efficient Secure Range Queries in Two-Tiered Sensor NetworksSensors10.3390/s1602025916:2(259)Online publication date: 20-Feb-2016
  • (2016)A virtual replica node-based flash crowds alleviation method for sensor overlay networksJournal of Network and Computer Applications10.1016/j.jnca.2016.09.00675:C(374-384)Online publication date: 1-Nov-2016
  • (2015)Verifiable top-k query processing in tiered mobile sensor networksInternational Journal of Distributed Sensor Networks10.1155/2015/4376782015(14-14)Online publication date: 1-Jan-2015
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media