Abstract
In remote and inaccessible environment, sensory data must be stored inside the network in case of sink failures. Since all sensor nodes have limited storage capacity and energy, so we need to ensure that the most important and urgent data can be stored and decoded first. In this paper, we studied the data storage problem in sink-failures sensor networks. Considering that most existing algorithms mainly focus on how to maximized number of stored data, which makes the loss of the most critical data, so we design a novel network coding data storage scheme based on priority named NCSP (Network Coding Storage with Priority). In this scheme, in order to prevent the loss of the most critical information, data in the networks are divided into independent priority groups. Different network coding schemes are used in different groups. Aggressiveness mechanism is also considered in this paper. Finally, MATLAB simulations results demonstrate that NCSP outperforms than other algorithms in terms of decoding priority.
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
Notes
- 1.
This work is supported by National Nature Science Foundation of China 61401234, 61271234, and PAPD Project of Jiangsu Higher Education Institutions.
References
Xue, X., Hou, X., Tang, B., Bagai, R.: Data preservation in intermittently connected sensor networks with data priority. In: 10th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, pp. 122–130 (2013)
Takahashi, M., Tang, B., Jaggi, N.: Energy-efficient data preservation in intermittently connected sensor networks. In: IEEE Conference on Computer Communications Workshops, Shanghai, pp. 590–595 (2011)
Lin, Y., Li, B., Liang, B.: Differentiated data persistence with priority random linear code. In: Proceedings of the 27th International Conference on Distributed Computing Systems, Piscataway, NJ, pp. 47–56. IEEE (2007)
Lin, Y., Liang, B., Li, B.: Geometric random linear codes in sensor networks. In: Proceedings of IEEE International Conference on Communication, Piscataway, NJ, pp. 2298–2303. IEEE (2008)
Ye, X., Li, J., Chen, W.-T., Tang, F.: LT codes based distributed coding for efficient distributed storage in wireless sensor networks. In: 2015 IFIP (2015). ISBN 978-3-901882-68-5
Yang, J., Zhao, Z., Zhang, H.: Energy efficient data gathering based on distributed iLT coding. In: The 11th International Symposium on Communications & Information Technologies (ISCIT 2011) (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Wang, Y., Wang, J. (2018). Research on Data Storage Scheme Under Sink Failures in Wireless Sensor Networks. In: Huang, M., Zhang, Y., Jing, W., Mehmood, A. (eds) Wireless Internet. WICON 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 214. Springer, Cham. https://doi.org/10.1007/978-3-319-72998-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-72998-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72997-8
Online ISBN: 978-3-319-72998-5
eBook Packages: Computer ScienceComputer Science (R0)