Low-latency algorithm for improving data persistence in mobile low-duty-cycle wireless sensor network

被引：0
|
作者：
Jiang C. [1 ,2 ]
Li T. [1 ,2 ]
Liang J. [2 ]
机构：
[1] School of Electronic and Information Engineering, South China University of Technology, Guangzhou
[2] Guangxi Key Laboratory of Multimedia Communications and Network Technology, School of Computer and Electronics Information, Guangxi University, Nanning
来源：
| 2018年 / Editorial Board of Journal on Communications卷 / 39期
基金：
中国国家自然科学基金;
关键词：
Data persistence; Data preservation; Infectious data dissemination; Low latency; Mobile low-duty-cycle wireless sensor network;
D O I：
10.11959/j.issn.1000-436x.2018041
中图分类号：
学科分类号：
摘要：
Mobile low-duty-cycle wireless sensor network (MLDC-WSN) are a kind of new ad hoc networks that are appeared in recent years. In MLDC-WSN, the nodes only have limited storage spaces. Moreover, the nodes would move or sleep from time to time. Therefore, these networks have some problems such as connectivity is hard to be maintained and data are hard to be transmitted to their destinations for storage in time. As a result, data persistence (i.e., the probability that all data can be recovered after some nodes die in the networks) is low. A distributed algorithm named LT-MDS for improving data persistence in MLDC-WSN was proposed. The algorithm used a new infectious data dissemination method to transmit the data, which enabled the data to be received by almost all the mobile nodes in a network with low latency and improved the reliability of the network. When a node receives the data, it would use LT (Luby transform) codes to encode and save them. By this way, the nodes with limited storage spaces can save more data information. Theoretical analyses and simulations show that LT-MDS can complete the process of data dissemination and preservation with low latency, and it can achieve high data persistence. © 2018, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码：53 / 62
页数：9
相关论文
共 29 条
  • [1] Liu W., Liu J., Study on distributed and dynamic resource management for delay-sensitive sensor network, Journal on Communications, 38, 7, pp. 70-77, (2017)
  • [2] Chen L.Y., Gu Y., Guo S., Et al., Group-based discovery in low-duty-cycle mobile sensor networks, 20129th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), pp. 542-550, (2012)
  • [3] Luby M., LT codes, The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 271-280, (2002)
  • [4] Acedanski S., Deb S., Medard M., Et al., How good is random linear coding based distributed networked storage, First Workshop on Network Coding, Theory, and Applications (NetCod 2005), pp. 1-6, (2005)
  • [5] Kamra A., Misra V., Feldman J., Et al., Growth codes: maximizing sensor network data persistence, The 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2006), pp. 1-12, (2006)
  • [6] Lin Y.F., Li B.C., Liang B., Differentiated data persistence with priority random linear codes, 27th International Conference on Distributed Computing Systems (ICDCS 2007), pp. 47-54, (2007)
  • [7] Lin Y.F., Liang B., Li B.C., Geometric random linear codes in sensor networks, 2008 IEEE International Conference on Communications (ICC 2008), pp. 2298-2303, (2008)
  • [8] Matsuzono K., Roca V., Asaeda H., Structured random linear codes (SRLC): bridging the gap between block and convolutional codes, 2014 IEEE Global Communications Conference (Globecom 2014), pp. 1211-1217, (2014)
  • [9] Al-Awami L., Hassanein H., Distributed data storage systems for data survivability in wireless sensor networks using decentralized erasure codes, Computer Networks, 97, 3, pp. 113-127, (2016)
  • [10] Talari A., Rahnavard N., CStorage: decentralized compressive data storage in wireless sensor networks, Ad Hoc Networks, 37, 2, pp. 475-485, (2016)
123