Folding: a method for semantic encoding of error-tolerant data

V. Rodoplu, B. Srinivasan
{"title":"Folding: a method for semantic encoding of error-tolerant data","authors":"V. Rodoplu, B. Srinivasan","doi":"10.1145/1287812.1287829","DOIUrl":null,"url":null,"abstract":"Underwater acoustic sensor networks are characterized by both low link data rates, and very low data generation rates of the sensors. In this regime, Shannon capacity results, which presume long channel codes and an infinitely long information bitstream, are not directly applicable. Further, for scientific data collection, distortion and errors are tolerable at the semantic layer. For this regime, we formulate the problem of sending k successive source symbols using n successive modulation intervals, where n > k. We introduce \"folding\" as a technique to map a k-dimensional source manifold into the n-dimensional modulation space, in order to minimize the average energy consumption per source symbol. We use an Archimedes' spiral, ahelix, and Fermat's spiral, as good foldings for low-dimensional mappings, and compute the energy consumption per source symbol under each.","PeriodicalId":191370,"journal":{"name":"Proceedings of the 2nd Workshop on Underwater Networks","volume":"216 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2nd Workshop on Underwater Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1287812.1287829","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Underwater acoustic sensor networks are characterized by both low link data rates, and very low data generation rates of the sensors. In this regime, Shannon capacity results, which presume long channel codes and an infinitely long information bitstream, are not directly applicable. Further, for scientific data collection, distortion and errors are tolerable at the semantic layer. For this regime, we formulate the problem of sending k successive source symbols using n successive modulation intervals, where n > k. We introduce "folding" as a technique to map a k-dimensional source manifold into the n-dimensional modulation space, in order to minimize the average energy consumption per source symbol. We use an Archimedes' spiral, ahelix, and Fermat's spiral, as good foldings for low-dimensional mappings, and compute the energy consumption per source symbol under each.
折叠:一种容错数据的语义编码方法
水声传感器网络具有链路数据速率低和传感器数据生成速率极低的特点。在这种情况下,假定长信道码和无限长的信息比特流的香农容量结果不能直接适用。此外,对于科学数据的收集,语义层的扭曲和错误是可以容忍的。对于这种情况,我们提出了使用n个连续调制间隔发送k个连续源符号的问题,其中n > k。我们引入“折叠”作为一种技术,将k维源流形映射到n维调制空间,以最小化每个源符号的平均能量消耗。我们使用阿基米德螺旋,非螺旋和费马螺旋作为低维映射的良好折叠,并计算每个源符号下的能量消耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书