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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
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)
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)
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)
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)
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)
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)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New Jersey (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Z., Xia, G., Chen, W., Li, Q. (2013). A Balance Storage Nodes Assignment for Wireless Sensor Networks. In: Ren, K., Liu, X., Liang, W., Xu, M., Jia, X., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2013. Lecture Notes in Computer Science, vol 7992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39701-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-39701-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39700-4
Online ISBN: 978-3-642-39701-1
eBook Packages: Computer ScienceComputer Science (R0)