Ad Hoc Networks. 11th EAI International Conference, ADHOCNETS 2019, Queenstown, New Zealand, November 18–21, 2019, Proceedings

Research Article

A Filtering Dimension Reduction Decoding Algorithm for Underwater Acoustic Networks

  • @INPROCEEDINGS{10.1007/978-3-030-37262-0_23,
        author={Lijuan Wang and Xiujuan Du and Chong Li and Duoliang Han and Jianlian Zhu},
        title={A Filtering Dimension Reduction Decoding Algorithm for Underwater Acoustic Networks},
        proceedings={Ad Hoc Networks. 11th EAI International Conference, ADHOCNETS 2019, Queenstown, New Zealand, November 18--21, 2019, Proceedings},
        proceedings_a={ADHOCNETS},
        year={2020},
        month={1},
        keywords={Underwater acoustic network Reliable transmission Digital fountain code Recursive LT Filtering dimension reduction},
        doi={10.1007/978-3-030-37262-0_23}
    }
    
  • Lijuan Wang
    Xiujuan Du
    Chong Li
    Duoliang Han
    Jianlian Zhu
    Year: 2020
    A Filtering Dimension Reduction Decoding Algorithm for Underwater Acoustic Networks
    ADHOCNETS
    Springer
    DOI: 10.1007/978-3-030-37262-0_23
Lijuan Wang,*, Xiujuan Du,*, Chong Li, Duoliang Han, Jianlian Zhu
    *Contact email: 1041517271@qq.com, dxj@qhnu.edu.cn

    Abstract

    Underwater acoustic channels are fragile. Reliable data transmission in underwater acoustic networks (UANs) faces tough challenges. Digital Fountain Code (DFC) is an efficient rateless error-correcting coding technique, in which the redundancy is not fixed and can be decided on the fly as the channel evolves. Thus, DFC is considered near-optimal for underwater acoustic channels. A recursive LT (RLT) code is a DFC tailored for underwater acoustic networks, which allows for lightweight implementation of an encoder and a decoder. Based on the analysis of the RLT algorithm, this paper proposes a filtering dimension reduction (FDR) decoding algorithm for underwater acoustic networks. The FDR decoding algorithm executes XOR operations on the encoded packets in a strict short ring of a generating a matrix to reduce the dimensions of the encoded packets, or generate 1-degree encoded packets. As a result, the FDR algorithm can increase the number of 1-degree encoded packets and reduce the decoding complexity. Moreover, the FDR algorithm can eliminate the waiting time for a traditional decoding algorithm to receive the 1-degree packets, and achieve fast decoding. Simulation results based on NS3 show that the decoding success rate of the FDR algorithm is higher than that of the RLT algorithm.