Advertisement

A Balance Storage Nodes Assignment for Wireless Sensor Networks

  • Zhigang Li
  • Geming Xia
  • Weiwei Chen
  • Qing Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7992)

Abstract

A balance storage nodes assignment problem is proposed for wireless sensor networks in order to save history data as much as possible when the network cannot connect to the sink node(s). Its aim is to assign storage nodes as evenly as possible to each source node, while it can minimize the storage path cost of the whole network. This problem can be reduced into a classic assignment problem by adding “dummy” source nodes, which is not easy to solve through the existing centric algorithms in sensor networks. Then two algorithms (Random Greedy Algorithm and Voronoi Graph Based Algorithm) are proposed in order to solve this problem. These two algorithms can be implemented distributed for the wireless sensor networks. The simulation implements and compares the performance of these two algorithms. The result shows that the Voronoi Graph Based Algorithm can satisfy the load balance storage for all source nodes and achieve approximate minimal storage path cost of the whole network.

Keywords

sensor networks balance storage assignment problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Taddia, C., Mazzini, G.: On the retransmission methods in wireless sensor networks. In: Proceedings of IEEE 60th Vehicular Technology Conference, Mazzini, Italy, pp. 4573–4577 (2004)Google Scholar
  2. 2.
    Petit, L., Nafaa, A., Jurdak, R.: Historical data storage for large scale sensor networks. In: Proceedings of the 5th French-Speaking Conference on Mobility and Ubiquity Computing. ACM, NY(2009)Google Scholar
  3. 3.
    Aral, B., Gunopulos, D.: Reliable hierarchical data storage in sensor networks. In: Proceedings of 19th International Conference on Scientific and Statistical Database Management, Banff, Alberta, Canada (2007)Google Scholar
  4. 4.
    Sylvia Ratnasamy, B.K., Yin, L., Yu, F., Estrin, D., Govindan, R., Shenker, S.: GHT: A Geographic Hash Table for Data Centric Storage. In: Proceedings of the 1st ACM WSNA, Atlanda, GA, USA, pp. 78–87 (2002)Google Scholar
  5. 5.
    Ari, I., Çelebi, Ö.F.: Finding event correlations in federated wireless sensor networks. In: Procedings of 7th International Wireless Communications and Mobile Computing Conference, IWCMC (2011)Google Scholar
  6. 6.
    Aly, S.A., Kong, Z., Soljanin, E.: Fountain Codes Based Distributed Storage Algorithms for Large-scale Wireless Sensor Networks. In: Proceedings of International Conference on Information Processing in Sensor Networks, St. Louis, Missouri, USA, pp. 171–182 (2008)Google Scholar
  7. 7.
    Lin, Y., Liang, B., Li, B.: Data persistence in large-scale sensor networks with decentralized fountain codes. In: Proceedings of 26th IEEE INFOCOM, Alaska, USA, pp. 1658–1666 (2007)Google Scholar
  8. 8.
    Chen, J., Kim, C.-S., Song, F.: A Distributed Clustering Algorithm for Voronoi Cell-Based Large Scale Wireless Sensor Network. In: Proceedings of International Conference on Communications and Mobile Computing (CMC), Shenzhen, China, pp. 209–213 (2010)Google Scholar
  9. 9.
    West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New Jersey (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Zhigang Li
    • 1
  • Geming Xia
    • 2
  • Weiwei Chen
    • 1
  • Qing Li
    • 1
  1. 1.College of Command Information SystemPLA Univ. of Sci. and Tech.China
  2. 2.School of ComputerNational University of Defense TechnologyChina

Personalised recommendations