Erasure resilient channel coding strategy for distributed sensor networks

J. du Toit, R. Wolhuter
{"title":"Erasure resilient channel coding strategy for distributed sensor networks","authors":"J. du Toit, R. Wolhuter","doi":"10.1109/APWC.2012.6324974","DOIUrl":null,"url":null,"abstract":"Rateless erasure codes have recently attracted much attention in the communications research community. Luby transform codes being the most well known, were the first practical realisation of record-breaking sparse-graph codes, particularly for binary erasure channels. These codes have the advantage of not requiring a priori knowledge of specific channel conditions and lend itself to application in nondeterministic distributed wireless sensor networks. This paper revisits the Luby transform code, and proposes a novel multi-path routing scheme where each part of the code follows any available transmission path. The packet delivery is not guaranteed. However, if ample packets are received from the multifarious paths, decoding the information can be accomplished at high probability. Our results indicate that just a few conditions are sufficient to define an optimal routing path with regard to the proposed encoding and decoding strategy. This work is of much interest to Wireless Sensor Networks (WSN's), due to typical topological characteristics.","PeriodicalId":6393,"journal":{"name":"2012 IEEE-APS Topical Conference on Antennas and Propagation in Wireless Communications (APWC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE-APS Topical Conference on Antennas and Propagation in Wireless Communications (APWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APWC.2012.6324974","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Rateless erasure codes have recently attracted much attention in the communications research community. Luby transform codes being the most well known, were the first practical realisation of record-breaking sparse-graph codes, particularly for binary erasure channels. These codes have the advantage of not requiring a priori knowledge of specific channel conditions and lend itself to application in nondeterministic distributed wireless sensor networks. This paper revisits the Luby transform code, and proposes a novel multi-path routing scheme where each part of the code follows any available transmission path. The packet delivery is not guaranteed. However, if ample packets are received from the multifarious paths, decoding the information can be accomplished at high probability. Our results indicate that just a few conditions are sufficient to define an optimal routing path with regard to the proposed encoding and decoding strategy. This work is of much interest to Wireless Sensor Networks (WSN's), due to typical topological characteristics.
分布式传感器网络的擦除弹性信道编码策略
近年来,无速率擦除码在通信研究界引起了广泛的关注。卢比变换码是最著名的,是第一个实际实现破纪录的稀疏图码,特别是对于二进制擦除信道。这些编码的优点是不需要对特定信道条件的先验知识,并且适合应用于不确定性分布式无线传感器网络。本文回顾了Luby变换代码,并提出了一种新的多路径路由方案,其中代码的每个部分都遵循任何可用的传输路径。不能保证数据包的发送。但是,如果从各种路径接收到足够的数据包,则可以高概率地完成信息解码。我们的结果表明,仅几个条件就足以定义关于所提出的编码和解码策略的最优路由路径。由于无线传感器网络具有典型的拓扑特征,这一工作引起了无线传感器网络(WSN)的极大兴趣。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信