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

Chan JIANG; Taoshen LI; Junbin LIANG

doi:10.11959/j.issn.1000-436x.2018041

您当前的位置：

首页 >

文章列表页 >

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

Special Issue on Internet of Things and Its Security | 更新时间：2024-06-05

- Low-latency algorithm for improving data persistence in mobile low-duty-cycle wireless sensor network
- Journal on Communications Vol. 39, Issue 3, Pages: 53-62(2018)
- 作者机构：
  
  1. 华南理工大学电子与信息学院，广东广州 510641
  2. 广西大学计算机与电子信息学院广西多媒体通信与网络技术重点实验室，广西南宁 530004
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61562005);The National Natural Science Foundation of China(61762010);The National Natural Science Foundation of China(61363067);The Natural Science Foundation of Guangxi Zhuang Autonomous Region(2015GXNSFAA139286);The Cultivation Plan For Thousands of Young and Middle-Aged Backbone Teachers in Guangxi Higher Education School (Guangxi Education People (2017)(49)
- DOI：10.11959/j.issn.1000-436x.2018041
  CLC： TP393
- Online First：2018-03，
  
  Published：25 March 2018
- 稿件说明：
移动端阅览
Chan JIANG, Taoshen LI, Junbin LIANG. Low-latency algorithm for improving data persistence in mobile low-duty-cycle wireless sensor network[J]. Journal on Communications, 2018, 39(3): 53-62.
DOI：

Chan JIANG, Taoshen LI, Junbin LIANG. Low-latency algorithm for improving data persistence in mobile low-duty-cycle wireless sensor network[J]. Journal on Communications, 2018, 39(3): 53-62. DOI： 10.11959/j.issn.1000-436x.2018041.

摘要

移动低占空比无线传感器网络是近年来出现的新型网络。在移动低占空比无线传感器网络中，由于节点的存储空间有限，并且节点的移动及睡眠会导致网络不连通、数据无法及时传输等问题，使数据很难被快速分发并存储，数据持续性较低。为此，提出一种卢比变换码的分布式数据存储（LT-MDS

Luby transform codes based mobile distributed storage）算法，该算法采用一种新的传染病式数据分发方法在节点不断移动的网络中分发数据，使数据能以较低的时延被网络中绝大部分节点接收到，提高了网络的可靠性；节点在接收到数据的同时，利用卢比变换码（LTC

Luby transform code）对数据进行编码存储，使容量有限的节点可以保存更多的数据信息。理论分析和仿真实验表明，LT-MDS算法能够以低时延完成数据分发和存储，同时获得较高的数据持续性。

Abstract

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.

关键词

Keywords

references

刘伟 , 刘军 . 时延敏感传感器网络中分布式动态资源管理研究 [J ] . 通信学报 , 2017 , 38 ( 7 ): 70 - 77 .

LIU W , LIU J . Study on distributed and dynamic resource management for delay-sensitive sensor network [J ] . Journal on Communications , 2017 , 38 ( 7 ): 70 - 77 .

CHEN L Y , GU Y , GUO S , et al . Group-based discovery in low-duty-cycle mobile sensor networks [C ] // 2012 9th Annual IEEE Communications Society Conference on Sensor,Mesh and Ad Hoc Communications and Networks (SECON) . 2012 : 542 - 550 .

LUBY M , . LT codes [C ] // The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002) . 2002 : 271 - 280 .

ACEDANSKI S , DEB S , MEDARD M , et al . How good is random linear coding based distributed networked storage [C ] // First Workshop on Network Coding,Theory,and Applications (NetCod 2005) . 2005 : 1 - 6 .

KAMRA A , MISRA V , FELDMAN J , et al . Growth codes:maximizing sensor network data persistence [C ] // The 2006 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communications (SIGCOMM 2006) . 2006 : 1 - 12 .

LIN Y F , LI B C , LIANG B . Differentiated data persistence with priority random linear codes [C ] // 27th International Conference on Distributed Computing Systems (ICDCS 2007) . 2007 : 47 - 54 .

LIN Y F , LIANG B , LI B C . Geometric random linear codes in sensor networks [C ] // 2008 IEEE International Conference on Communications (ICC 2008) . 2008 : 2298 - 2303 .

MATSUZONO K , ROCA V , ASAEDA H . Structured random linear codes (SRLC):bridging the gap between block and convolutional codes [C ] // 2014 IEEE Global Communications Conference (Globecom 2014) . 2014 : 1211 - 1217 .

AL-AWAMI L , HASSANEIN H . Distributed data storage systems for data survivability in wireless sensor networks using decentralized erasure codes [J ] . Computer Networks , 2016 , 97 ( 3 ): 113 - 127 .

TALARI A , RAHNAVARD N . CStorage:decentralized compressive data storage in wireless sensor networks [J ] . Ad Hoc Networks , 2016 , 37 ( 2 ): 475 - 485 .

LIN Y F , LIANG B , LI B . Data persistence in large-scale sensor networks with decentralized fountain codes [C ] // 26th IEEE International Conference on Computer Communications (INFOCOM 2007) . 2007 : 1658 - 1666 .

KONG Z , ALY S , SOLJANIN E . Decentralized coding algorithms for distributed storage in wireless sensor networks [J ] . IEEE Journal on Selected Areas in Communications , 2010 , 28 ( 2 ): 261 - 267 .

LIU K K , EL-KHAMY M , LEE J . Finite-length algebraic spatially-coupled quasi-cyclic LDPC codes [J ] . IEEE Journal on Selected Areas in Communications , 2016 , 34 ( 2 ): 329 - 344 .

AL-AWAMI L , HASSANEIN H . Robust decentralized data storage and retrieval for wireless networks [J ] . Computer Networks , 2017 , 128 ( 9 ): 41 - 50 .

KONB B , ZHANG G , ZHANG W , et al . Data persistence in planetary surface network using raptor codes and probabilistic broadcasting [J ] . International Journal of Distributed Sensor Networks , 2016 , 12 ( 10 ): 1 - 13 .

AZIMI N H , GUPTA H , HOU X X , et al . Data preservation under spatial failures in sensor networks [C ] // The Eleventh ACM International Symposium on Mobile Ad Hoc Networking and Ccomputing (MobiHoc 2010) . 2010 : 171 - 180 .

XU M , SONG W Z , HEO D , et al . ECPC:preserve downtime data persistence in disruptive sensor networks [C ] // 2013 IEEE 10th International Conference on Mobile Ad Hoc and Sensor Systems (MASS 2013) . 2013 : 281 - 289 .

梁俊斌 , 李陶深 . 无线传感网中基于自适应概率广播的数据保存 [J ] . 计算机研究与发展 , 2012 , 49 ( 10 ): 2229 - 2240 .

LIANG J B , LI T S . An adaptive probability broadcast-based data preservation in wireless sensor networks [J ] . Journal of Computer Research and Development , 2012 , 49 ( 10 ): 2229 - 2240 .

KONB B , ZHANG G X , ZHANG W , et al . Efficient distributed storage for space information network based on fountain codes and probabilistic broadcasting [J ] . KSII Transactions on Internet and Information Systems , 2016 , 10 ( 6 ): 2606 - 2626 .

RUIZ P , BOUVRY P . Survey on broadcast algorithms for mobile ad hoc networks [J ] . ACM Computing Surveys , 2015 , 48 ( 1 ): 1 - 35 .

CHEN L Y , SHU Y C , GU Y , et al . Group-based neighbor discovery in low-duty-cycle mobile sensor networks [J ] . IEEE Transactions on Mobile Computing , 2016 , 15 ( 8 ): 1996 - 2009 .

CHEN P P , CHEN Y , GAO S , et al . Efficient group-based discovery for wireless sensor networks [J ] . International Journal of Distributed Sensor Networks , 2017 , 13 ( 7 ): 1 - 12 .

CHAKCHOUK N . A survey on opportunistic routing in wireless communication networks [J ] . IEEE Communications Surveys ＆ Tutorials , 2015 , 17 ( 4 ): 2214 - 2241 .

SO J M , BYUN H J . Load-balanced opportunistic routing for duty-cycled wireless sensor networks [J ] . IEEE Transactions on Mobile Computing , 2017 , 16 ( 7 ): 1940 - 1955 .

CAMP T , BOLENG J , DAVIES V . A survey of mobility models for ad hoc network research [J ] . Wireless Communications and Mobile Computing , 2002 , 2 ( 5 ): 483 - 502 .

WU Y , MAO Z J , FAHMY S , et al . Constructing maximum-lifetime data-gathering forests in sensor networks [J ] . IEEE/ACM Transactions on Networking , 2010 , 18 ( 5 ): 1571 - 1584 .

KUI X Y , ZHANG S G , WANG J X , et al . An energy-balanced clustering protocol based on dominating set for data gathering in wireless sensor networks [C ] // 2012 IEEE International Conference on Communications (ICC) . 2012 : 193 - 197 .

MIAO G W , AZARI A , HWANG T W . E2-MAC:energy efficient medium access for massive M2M communications [J ] . IEEE Transactions on Communications , 2016 , 64 ( 11 ): 4720 - 4735 .

GROENEVELT R , NAIN P , KOOLE G . The message delay in mobile ad hoc networks [J ] . Performance Evaluation , 2005 , 62 ( 1-4 ): 210 - 228 .

Views

1783

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Low-latency neighbor discovery algorithm based on multi-beacon message in mobile low-duty-cycle sensor network

Low-latency networking:architecture,key scenarios and research prospect

Related Author

Junbin LIANG

Xiang ZHOU

Fangqiang MA

Chan JIANG

Zongjian HE

Xutong ZUO

Mowei WANG

Yong CUI

Related Institution

School of Computer and Electronics Information,Guangxi University

Guangxi Key Laboratory of Multimedia Communications and Network Technology,Guangxi University

Network Research Center,the University of Auckland,Auckland 1142,New Zealand

School of Information and Technology,Tsinghua University

AI问答

⁰