An Overhearing-Based Scheme for Improving Data Persistence in Wireless Sensor Networks

Junbin Liang, Jian-xin Wang, Jianer Chen
{"title":"An Overhearing-Based Scheme for Improving Data Persistence in Wireless Sensor Networks","authors":"Junbin Liang, Jian-xin Wang, Jianer Chen","doi":"10.1109/ICC.2010.5502577","DOIUrl":null,"url":null,"abstract":"How to improve the data persistence, i.e., the availability of all source data, is an important issue in wireless sensor networks. The issue requires that each source node can disseminate its data (packet) to a subset of nodes in the network for effective storage. In this paper, a distributed scheme based on LT(Luby Transform)-codes, named LTSIDP, is proposed. LT codes are the first rateless erasure codes that are very efficient as the amount of data grows. In LTSIDP, each node uses overhearing to get information whether a packet has been transmitted by one of its neighbors. When a node needs to transmit a packet, it randomly chooses one of its neighbors that does not transmit the packet as receiver. On the other hand, each node can compute a key parameter of LT codes by using some properties of the packet transmission mechanism, and then store the data accordingly. After the process of storage is finished, a collector (e.g., a motor vehicle) can recover all data by visiting a small subset of nodes. To the best of our knowledge, LTSIDP is the first scheme that uses overhearing to improve the data persistence. Theoretical analyses and simulations show that LTSIDP can achieve higher data persistence and energy efficiency than existing schemes.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"117 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2010.5502577","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

How to improve the data persistence, i.e., the availability of all source data, is an important issue in wireless sensor networks. The issue requires that each source node can disseminate its data (packet) to a subset of nodes in the network for effective storage. In this paper, a distributed scheme based on LT(Luby Transform)-codes, named LTSIDP, is proposed. LT codes are the first rateless erasure codes that are very efficient as the amount of data grows. In LTSIDP, each node uses overhearing to get information whether a packet has been transmitted by one of its neighbors. When a node needs to transmit a packet, it randomly chooses one of its neighbors that does not transmit the packet as receiver. On the other hand, each node can compute a key parameter of LT codes by using some properties of the packet transmission mechanism, and then store the data accordingly. After the process of storage is finished, a collector (e.g., a motor vehicle) can recover all data by visiting a small subset of nodes. To the best of our knowledge, LTSIDP is the first scheme that uses overhearing to improve the data persistence. Theoretical analyses and simulations show that LTSIDP can achieve higher data persistence and energy efficiency than existing schemes.
一种基于窃听的无线传感器网络数据持久性改进方案
如何提高数据的持久性,即所有源数据的可用性,是无线传感器网络中的一个重要问题。该问题要求每个源节点能够将其数据(数据包)传播到网络中的一个节点子集以进行有效的存储。本文提出了一种基于Luby变换码的分布式方案LTSIDP。随着数据量的增长,LT码是第一种非常有效的无速率擦除码。在LTSIDP中,每个节点都使用监听来获取数据包是否已被其邻居传输的信息。当一个节点需要发送数据包时,它随机选择一个不发送数据包的邻居作为接收方。另一方面,每个节点可以利用分组传输机制的某些属性计算出LT码的关键参数,并据此存储数据。在存储过程完成后,收集器(例如,汽车)可以通过访问一小部分节点来恢复所有数据。据我们所知,LTSIDP是第一个使用侦听来提高数据持久性的方案。理论分析和仿真结果表明,LTSIDP比现有方案具有更高的数据持久性和能源效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信