Accelerating Partial Packet Recovery in RLNC
Research output: Contribution to journal › Research article › Contributed › peer-review
Contributors
Abstract
Network coding (NC) can reduce the number of packet retransmissions and improve network reliability in lossy networks by combining packets in generations and transmitting these coded packets. Although corrupted coded packets are discarded at the receiver, they remain valuable as the majority of their data remains error-free, even in the presence of a noisy channel with a bit error rate range of 10-5. Numerous packet recovery strategies have been proposed to tackle this issue; however, when confronted with excessively noisy channel conditions, their recovery speeds experience a substantial decline. This letter presents a new method called Quick partial packet recovery (QPPR). QPPR exploits the algebraic consistency among coded packets to estimate the erroneous parts of packets and utilizes this estimation with channel condition information to recover packets. Through simulations, we demonstrate that QPPR enhances communication throughput in diverse scenarios, achieving up to a 26.64 percent improvement. Additionally, QPPR effectively reduces communication overhead and delay in very noisy channel conditions, showcasing its potential to elevate overall communication performance.
Details
Original language | English |
---|---|
Pages (from-to) | 2548-2552 |
Number of pages | 5 |
Journal | IEEE communications letters |
Volume | 27 |
Issue number | 10 |
Publication status | Published - 1 Oct 2023 |
Peer-reviewed | Yes |
External IDs
ORCID | /0000-0001-8469-9573/work/161891135 |
---|
Keywords
ASJC Scopus subject areas
Keywords
- algebraic consistency rule, partial packet recovery, Random linear network coding, reliability enhancement