Improving the Decoding Speed of Packet Recovery in Network Coding

The reliability of communication channels is one of the most challenging tasks in wireless communication. Network coding (NC) has emerged as a compelling solution to improve throughput performance and reliability by sending coded packets and accepting valid ones at the receiver. Discarding corrupted...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2021-02, Vol.25 (2), p.351-355
Main Authors: Nazari, Hosein K., Ghassabi, Kiana, Pahlevani, Peyman, Lucani, Daniel
Format: Article
Language:English
Subjects:
algebraic consistency rule
Algorithms
Coding
Complexity theory
Decoding
Encoding
Error correction
Forward error correction
Integrated circuits
Network coding
Network reliability
Packets (communication)
random linear network coding
Receivers
Recovery
Wireless communications
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The reliability of communication channels is one of the most challenging tasks in wireless communication. Network coding (NC) has emerged as a compelling solution to improve throughput performance and reliability by sending coded packets and accepting valid ones at the receiver. Discarding corrupted coded packets in NC often meant discarding potentially useful information. Thus, using forward error correction (FEC) in each coded packet makes the corrupted packets useful at the receiver. In this letter, we propose a fast decoding algorithm for packet recovery in NC (F-PRNC) using an algebraic consistency between the coded packets to detect their possible corrupted parts. We provided a complexity analysis of the F-PRNC and compared it with partial packet recovery schemes such as DAPRAC and S-PRAC. Our simulation result shows that F-PRNC exceeds both methods in a variety of conditions.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2020.3031011