Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithms and Architectures for Parallel Processing

ICA3PP 2014: Algorithms and Architectures for Parallel Processing pp 822–835Cite as

A Distributed Storage Model for Sensor Networks

  • Conference paper

  • 2533 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8630))

Abstract

In this paper we present a novel efficient, simple, local, memoryless and deterministic storage aggregation model for large wireless sensor networks (WSNs). Our goal is to maximize the system storage utilization. While normally most of WSN systems have a vast amount of global storage reserves, their storage capacity may not be fully explored due to the fact that each sensor individually has a very limited low storage capacity. We suggest an aggregated storage model that overcomes this drawback of low individual storage capacity. Our model constructs “on-demand” distributed storage chains (DSCs) which search for available un-occupied storage space inside WSNs. Those chains are constructed via deterministic geographic walks; however, their behavior resembles random walks. Simulation has revealed that the proposed storage distribution model is capable of maximizing utilization of WSN storage capacity as well as maintaining network loads geographically uniformly distributed.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Estrin, D., Govindan, R., Hiedemann, J.: Next century challenges: Scalable coor-dination in sensor network. USC/ Information Science Institute (1999)

    Google Scholar 

  2. Lewis, F.L.: Wireless sensor networks. In: Smart Environments, pp. 11-46. John Wiley&Sons (2005)

    Google Scholar 

  3. Dimakis, A.G., Sarwate, A.D., Wainwright, M.J.: Geographic gossip: efficient aggregation for sensor networks. In: The Fifth International Conference on In-formation Processing in Sensor Networks, pp. 69–76. ACM (2006)

    Google Scholar 

  4. Culler, D., Estrin, D., Srivastava, M.: Guest editors’ introduction: Overview of Sensor Networks. IEEE Computer 37(8), 41–49 (2004)

    Article  Google Scholar 

  5. Wu, X., Chen, G., Das, S.K.: Avoiding energy holes in wireless sensor networks with non-uniform node distribution. IEEE Transactions on Parallel and Distributed Systems 19, 710–720 (2008)

    Article  Google Scholar 

  6. Naor, M., Wieder, U.: Novel Architectures for P2P Applications: The continuous-discrete approach. ACM Trans. Algorithms 3 (2007)

    Google Scholar 

  7. Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless net-works. In: The 6th Annual International Conference on Mobile Computing and Networking, pp. 243–254. ACM, New York (2000)

    Google Scholar 

  8. Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Discrete Math. 86, 165–177 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Diestel, R.: Graph theory. Springer (2006)

    Google Scholar 

  10. Berg, M.: Computational Geometry: algorithms and applications. Springer (2000)

    Google Scholar 

  11. Rantnasamy, S., Shenker, S., Govinadan, R.: Data centric storage in SensorNets with GHT. A Geographic Hash Table, Mobile Networks and Application 8(4), 427–442 (2003)

    Article  Google Scholar 

  12. Gabber, O., Galil, Z.: Explicit constructions of linear size super-concentrators. In: The 20th Annual Symposium on Foundations of Computer Science, pp. 364–370. IEEE Computer Society, Washington, DC (1979)

    Chapter  Google Scholar 

  13. Alon, N., Avin, C., Kouck´y, M., Kozma, G., Lotker, Z.: M. Tuttle, R.: Many random walks are faster than one. In: The 20th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 119–128, New York (2008)

    Google Scholar 

  14. Gkantsidis, C., Mihail, M., Saberi, A.: Random Walks in Peer-to-Peer Networks: algorithms and evaluation. Performance Evaluation 63, 241–263 (2006)

    Article  Google Scholar 

  15. Shiue, H.Y., Yu, G.J., Sheu, J.P.: Energy Hole Healing Protocol for Surveillance Sensor Networks. In: Workshop on Wireless, Ad Hoc, and Sensor Networks (WASN 2005), Taoyuan, Taiwan (2005)

    Google Scholar 

  16. Dietrich, I., Dressler, F.: On the lifetime of wireless sensor networks. ACM Transactions on Sensor Networks 5(1), 1–39 (2009)

    Article  Google Scholar 

  17. Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Discrete Math. 86, 165–177 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical and Computer Engineering, State University of Campinas, Brazil

    Lee Luan Ling

Authors
  1. Lee Luan Ling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Illinois Institute of Technology, 60616-3793, Chicago, IL, USA

    Xian-he Sun

  2. School of Computer Science and Technology, Dalian Maritime University, 1 Linghai Road, 116026, Dalian, China

    Wenyu Qu

  3. University of Ottawa, SEECS, 8, King Edward Ave, K1N 6N5, Ottawa, ON, Canada

    Ivan Stojmenovic

  4. Deakin University, 221 Burwood Highway, 3125, Burwood, VIC, Australia

    Wanlei Zhou

  5. Dalian Maritime University, NO.1 Linhai Road, 116026, Dailian, China

    Zhiyang Li  & Tingting Yang  & 

  6. BeiHang University, XueYuan Road No.37,HaiDian District, Beijing, China

    Hua Guo

  7. University of Bradford, BD7 1DP, Bradford, West Yorkshire, United Kingdom

    Geyong Min

  8. Computer Network Information Center, Chinese Academy of Sciences, 100190, Beijing, China

    Yulei Wu

  9. 27 Shanda Nanlu, 250100, Jinan City, Shandong Province, China

    Lei Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ling, L.L. (2014). A Distributed Storage Model for Sensor Networks. In: Sun, Xh., et al. Algorithms and Architectures for Parallel Processing. ICA3PP 2014. Lecture Notes in Computer Science, vol 8630. Springer, Cham. https://doi.org/10.1007/978-3-319-11197-1_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11197-1_65

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11196-4

  • Online ISBN: 978-3-319-11197-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation