Skip to main content

Data-Centric Routing and Storage in Sensor Networks

  • Chapter
Wireless Sensor Networks

Abstract

Early sensor network data access systems were built upon the the idea of data-centric routing. Data-centricity allows robust and energy-efficient communication by abstracting the physical location of data. In this chapter, we introduce a complementary idea called data-centric storage. Data-centric storage provides efficient rendezvous between the producer of a data item, and its consumer. The primitives underlying data-centric storage can be used to construct different distributed data structures for efficiently answering a variety of queries.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. Abhishek Ghose, Jens Grossklags, John Chuang (2003). Resilient data-centric storage in wireless ad-hoc sensor networks. In Mobile Data Management-MDM 2003, pages 45–62.

    Google Scholar 

  2. Adjie-Winoto, W., Schwartz, E., Balakrishnan, H., and Lilley, J. (1999). The Design and Implementation of an Intentional Naming System. In Proceedings of the Symposium on Operating Systems Principles, Kiawah Island, SC.

    Google Scholar 

  3. Bentley, J. L. (1975). Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM, 18(9): 475–484.

    Article  MathSciNet  Google Scholar 

  4. Chakrabarti, Kaushik, Garofalakis, Minos, Rastogi, Rajeev, and Shim, Kyuseok (2001). Approximate query processing using wavelets. VLDB Journal: Very Large Data Bases, 10(2–3): 199–223.

    Google Scholar 

  5. Elson, Jeremy, Girod, Lewis, and Estrin, Deborah (2002). Fine-grained network time synchronization using reference broadcasts. In Proceedings of the Fifth USENIX Symposiuni on Operating Systems Design and Implementation, Boston, MA, USA. USENIX.

    Google Scholar 

  6. Ganesan, D., Greenstein, B., Perelyubskiy, D., Estrin, D., and Heidemann, J. (2003). An Evaluation of Multi-Resolution Search and Storage in Resource-Constrained Sensor Networks. In Proceedings of the ACM Sensys, Los Angeles, CA.

    Google Scholar 

  7. Ganesan, Deepak, Estrin, Deborah, and Heidemann, John (2002). DIMENSIONS: Why do we need a new data handling architecture for sensor networks? In Proceedings of the ACM Workshop on Hot Topics in Networks, Princeton, NJ, USA. ACM.

    Google Scholar 

  8. Greenstein, B., Estrin, D., Govindan, R., Ratnasamy, S., and Shenker, S. (2003). DIFS: A Distributed Index for Features In Sensor Networks. In Proceedings of the IEEE ICC Workshop on Sensor Network Protocols and Applications, Anchorage, AK.

    Google Scholar 

  9. Heidemann, John, Silva, Fabio, Intanagonwiwat, Chalermek, Govindan, Ramesh, Estrin, Deborah, and Ganesan, Deepak (2001). Building efficient wireless sensor networks with low-level naming. In Proceedings of the Symposium on Operating Systems Principles, pages 146–159, Chateau Lake Louise, Banff, Alberta, Canada. ACM.

    Google Scholar 

  10. Intanagonwiwat, Chalermek, Govindan, Ramesh, Estrin, Deborah, Heidemann, John, and Silva, Fabio (2002). Directed diffusion for wireless sensor networking. ACM/IEEE Transactions on Networking.

    Google Scholar 

  11. Karp, B. (2000). Geographic Routing for Wireless Networks. PhD thesis, Harvard University.

    Google Scholar 

  12. Karp, Brad and Kung, H. T. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, pages 243–254, Boston, Mass., USA. ACM.

    Google Scholar 

  13. Li, X., Kim, Y. J., Govindan, R., and Hong, W. (2003). Multi-Dimensional Range Queries in Sensor Networks. In Proceedings of the ACM Sensys, Los Angeles, CA.

    Google Scholar 

  14. Madden, Samuel, Franklin, Michael J., Hellerstein, Joseph, and Hong, Wei (2002). TAG: Tiny AGgregate queries in ad-hoc sensor networks. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation, page to appear, Boston, Massachusetts, USA. USENIX.

    Google Scholar 

  15. Ratnasamy, Sylvia, Francis, Paul, Handley, Mark, Karp, Richard, and Shenker, Scott (2001). A scalable content-addressable network. In Proceedings of the ACM SIGCOMM Conference, pages 13–25, San Diego, CA, USA. ACM.

    Google Scholar 

  16. Rowstron, A. and Druschel, P. (2001). Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-peer Systems. In Proc. 18th IFIP/ACM Conference on Distributed Systems Platforms, Heidelberg, Germany.

    Google Scholar 

  17. Savvides, Andreas, Han, Chih-Chien, and Srivastava, Mani (2001). Dynamic fine-grained localization in ad-hoc networks of sensors. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, page to appear, Rome, Italy. ACM.

    Google Scholar 

  18. Shenker, Scott, Ratnasarny, Sylvia, Karp, Brad, Govindan, Ramesh, and Estrin, Deborah (2002). Data-Centric Storage in Sensornets. In Proc. ACM SIGCOMM Workshop on Hot Topics In Networks, Princeton, NJ.

    Google Scholar 

  19. Stoica, Ion, Morris, Robert, Karger, David, Kaashoek, M. Frans, and Balakrishnan, Hari (2000). Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM Conference, Stockholm, Sweden. ACM.

    Google Scholar 

  20. Yao, Kung, Hudson, Ralph E., Reed, Chris W., Chen, Daching, and Lorenzelli, Flavio (1998). Blind beamforming on a randomly distributed sensor array system. IEEE Journal of Selected Areas in Communication, 16(8): 1555–1567.

    Article  Google Scholar 

  21. Ye, Wei, Heidemann, John, and Estrin, Deborah (2003). Medium access control with coordinated, adaptive sleeping for wireless sensor networks. Technical Report ISI-TR-567, USC/Information Sciences Institute.

    Google Scholar 

  22. Yu, Yan, Govindan, Ramesh, and Estrin, Deborah (2001). Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. Technical Report TR-01-0023, University of California, Los Angeles, Computer Science Department.

    Google Scholar 

  23. Zhao, B. Y., Kubatowicz, J., and Joseph, A. (2001). Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. Technical Report UCBICSD-01-1141, University of California Berkeley.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Govindan, R. (2004). Data-Centric Routing and Storage in Sensor Networks. In: Raghavendra, C.S., Sivalingam, K.M., Znati, T. (eds) Wireless Sensor Networks. Springer, Boston, MA. https://doi.org/10.1007/978-1-4020-7884-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-7884-2_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-35269-5

  • Online ISBN: 978-1-4020-7884-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics