水声网络按序递归与限制反馈的在线喷泉码算法与分析
Algorithm and Analysis of Sequential Recursive Online Fountain Code with Limited Feedback in Underwater Acoustic Networks
- 电子学报 2023年51卷第7期 页码：1734-1740
- 作者机构：
1.青海师范大学计算机学院, 青海西宁 810008
2.青海省物联网重点实验室, 青海西宁 810008
3.高原科学与可持续发展研究院, 青海西宁 810008
4.藏语智能信息处理及应用国家重点实验室, 青海西宁 810008
- 作者简介：
[ "柳秀秀 女，1989年2月出生,河北衡水人.分别于2013年和2016年在青海师范大学获工学学士和理学硕士学位,现为青海师范大学计算机学院在读博士生和讲师.主要研究方向为水声网络可靠传输.E-mail: 1154894860@qq.com" ]
[ "杜秀娟（通讯作者） 女，1970年2月出生,河北藁城人.天津大学计算机工学博士.青海师范大学计算机学院教授、博士生导师.主要研究方向为网络和信息安全、移动自组织网络和水下传感器网络.E-mail: dxj@qhnu.edu.cn" ]
[ "韩多亮 男，1994年5月出生,甘肃张掖人.分别于2017年和2020年在青海师范大学获工学学士和理学硕士学位,现为青海师范大学在读博士生.主要研究方向为水声网络协议设计和优化.E-mail: 2945219148@qq.com" ]
- 基金信息：青海省物联网重点实验室(2022-ZJ-Y21);国家自然科学基金(61962052)
DOI：10.12263/DZXB.20220050
中图分类号： TN911.22;TN929.3收稿：2022-01-07，
修回：2022-10-08，
纸质出版：2023-07-25
- 稿件说明：
移动端阅览
柳秀秀,杜秀娟,韩多亮.水声网络按序递归与限制反馈的在线喷泉码算法与分析[J].电子学报,2023,51(07):1734-1740.
LIU Xiu-xiu,DU Xiu-juan,HAN Duo-liang.Algorithm and Analysis of Sequential Recursive Online Fountain Code with Limited Feedback in Underwater Acoustic Networks[J].ACTA ELECTRONICA SINICA,2023,51(07):1734-1740.
柳秀秀,杜秀娟,韩多亮.水声网络按序递归与限制反馈的在线喷泉码算法与分析[J].电子学报,2023,51(07):1734-1740. DOI： 10.12263/DZXB.20220050.
LIU Xiu-xiu,DU Xiu-juan,HAN Duo-liang.Algorithm and Analysis of Sequential Recursive Online Fountain Code with Limited Feedback in Underwater Acoustic Networks[J].ACTA ELECTRONICA SINICA,2023,51(07):1734-1740. DOI： 10.12263/DZXB.20220050.
摘要
水声网络具有低带宽、长时延、高误码率等特征，这使得数据的可靠传输面临着巨大挑战. 在线喷泉码具有低开销、在线反馈和通过给定瞬时解码状态获得最优编码策略等优点，因此，针对水声网络的特点，分析在线喷泉码的编解码和反馈问题，提出了按序递归与限制反馈的在线喷泉码（ Sequential Recursive Online Fountain Code with Limited Feedback， SROFC-LF ）. 基于随机图理论对SROFC-LF需要的编码包数量进行理论分析，理论分析和实验仿真一致.实验表明：无论开销和反馈包数量，SROFC-LF比大部分在线喷泉码均表现出更好性能，适合水声网络.
Abstract
Underwater acoustic networks (UANs) have low bandwidth
long delay
high bit error rate and other features. All these features bring about significant challenges to the reliable transmission for UANs. Online fountain code(OFC) has the advantages such as low overhead
online feedback
and obtaining the optimal coding strategy through a given instantaneous decoding state. Therefore
according to the characteristics of UANs
the problems of codec and feedback of the OFC are analyzed. The sequential recursive online fountain code with limited feedback (SROFC-LF) is proposed. The number of coding packets required by the SROFC-LF is theoretically analyzed based on the random graph theory
and the theoretical analysis is consistent with the experimental simulation results. The experimental results show that regardless of the overhead and the number of feedback packets
the SROFC-LF shows better performance than most OFCs
which is suitable for UANs.
关键词
Keywords
references
YAN L , MA X L , LI X B , et al . Shot interference detection and mitigation for underwater acoustic communication systems [J]. IEEE Transactions on Communications , 2021 , 69 ( 5 ): 3274 - 3285 .
JIANG S M . On reliable data transfer in underwater acoustic networks: A survey from networking perspective [J]. IEEE Communications Surveys & Tutorials , 2018 , 20 ( 2 ): 1036 - 1055 .
MACKAY D J C . Fountain codes [J]. IEE Proceedings - Communications , 2005 , 152 ( 6 ): 1062 - 1068 .
YILDIZ H U . Maximization of underwater sensor networks lifetime via fountain codes [J]. IEEE Transactions on Industrial Informatics , 2019 , 15 ( 8 ): 4602 - 4613 .
DU X J , LI K Q , LIU X X , et al . RLT code based handshake-free reliable MAC protocol for underwater sensor networks [J]. Journal of Sensors , 2016 , 2016 : 1 - 11 .
SONG Y . Underwater acoustic sensor networks with cost efficiency for internet of underwater things [J]. IEEE Transactions on Industrial Electronics , 2021 , 68 ( 2 ): 1707 - 1716 .
CASSUTO Y , SHOKROLLAHI A . Online fountain codes with low overhead [J]. IEEE Transactions on Information Theory , 2015 , 61 ( 6 ): 3137 - 3149 .
HUANG T Q , YI B S . Improved online fountain codes based on shaping for left degree distribution [J]. AEU-International Journal of Electronics and Communications , 2017 , 79 : 9 - 15 .
HUANG J X , FEI Z S , CAO C Z , et al . Performance analysis and improvement of online fountain codes [J]. IEEE Transactions on Communications , 2018 , 66 ( 12 ): 5916 - 5926 .
SHI P C , WANG Z Y , LI D Z , et al . Zigzag decodable online fountain codes with high intermediate symbol recovery rates [J]. IEEE Transactions on Communications , 2020 , 68 ( 11 ): 6629 - 6641 .
HUANG J X , FEI Z S , CAO C Z , et al . Weighted online fountain codes with limited buffer size and feedback transmissions [J]. IEEE Transactions on Communications , 2021 , 69 ( 12 ): 7960 - 7973 .
XIAO Y W , ZHANG Y S , HUANG J X . Estimation based feedback reduction for online fountain codes [C]// 2022 3rd Information Communication Technologies Conference (ICTC) . Piscataway : IEEE , 2022 : 194 - 198 .
HUANG J X , FEI Z S , CAO C Z , et al . Reliable broadcast based on online fountain codes [J]. IEEE Communications Letters , 2021 , 25 ( 2 ): 369 - 373 .
LIU X X , DU X J , ZHANG J L , et al . ROFC-LF: Recursive online fountain code with limited feedback for underwater acoustic networks [J]. IEEE Transactions on Communications , 2022 , 70 ( 7 ): 4327 - 4342 .
ALON N , SPENCER J H . The Probabilistic Method [M]. New York : John Wiley & Sons , 2004 .
ERDŐS P , RÉNYI A . On the evolution of random graphs [J]. Publ Math Inst Hung Acad Sci , 1960 , 5 ( 1 ): 17 - 60 .
0
浏览量
10
下载量
2
CSCD
- 网络PDF下载
- Meta-XML下载
- BibTeX下载
- Endnote下载
- RefMan 下载
- NoteExpress下载
- NoteFirst下载
关联资源
相关文章
相关作者
相关机构
- 技术支持由北京北大方正电子有限公司提供 京ICP备09064830号-19
京公网安备11010802024621 - 本系统建议在Chrome、 IE9+ 以上版本浏览器阅读本站内容，360浏览器请切换至极速模式
- Cookies帮助我们提供服务并提供个性化体验。使用本网站，即表示您同意我们使用Cookies