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.
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.
Algorithm and Analysis of Sequential Recursive Online Fountain Code with Limited Feedback in Underwater Acoustic Networks
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 .
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 .