Fly-PRAC: Packet Recovery for Random Linear Network Coding
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918381899218944 |
|---|---|
| author | Nazari, Hosein K. Senk, Stefan Pahlevani, Peyman Cabrera, Juan A. Fitzek, Frank H. P. |
| author_facet | Nazari, Hosein K. Senk, Stefan Pahlevani, Peyman Cabrera, Juan A. Fitzek, Frank H. P. |
| contents | Network Coding (NC) is a compelling solution for increasing network efficiency. However, it discards corrupted packets and cannot achieve optimal performance in noisy communications. Since most of the information in corrupted packets is error-free, discarding them is not the best strategy. Several packet recovery techniques such as PRAC and S-PRAC were proposed to exploit corrupted packets. Yet, they are slow and only practical when the packet size is small and communication channels are not very noisy. We propose a packet recovery scheme called Fly-PRAC to address these issues. Fly-PRAC exploits algebraic relations between a group of coded packets to estimate their corrupted parts and recovers them. Unlike previous schemes, Fly-PRAC can recover coded packets at the intermediate node without decoding them. We have compared Fly-PRAC against S-PRAC. Results show when the bit error rate (ε) is 10^-4, Fly-PRAC outperforms S-PRAC by two folds for a payload of 900B. In two-hop communication with ε = 10^-4 and a payload size of 500B, by enabling the recovery in the intermediate node, Fly-PRAC reduces transmissions by 16%. In a Sparse Network Coding (SNC) scenario, with two non-zero elements in the coefficient vectors and a payload of 800B, there is a reduction by 31% on average for decoding delay. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_10266 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Fly-PRAC: Packet Recovery for Random Linear Network Coding Nazari, Hosein K. Senk, Stefan Pahlevani, Peyman Cabrera, Juan A. Fitzek, Frank H. P. Information Theory Networking and Internet Architecture Network Coding (NC) is a compelling solution for increasing network efficiency. However, it discards corrupted packets and cannot achieve optimal performance in noisy communications. Since most of the information in corrupted packets is error-free, discarding them is not the best strategy. Several packet recovery techniques such as PRAC and S-PRAC were proposed to exploit corrupted packets. Yet, they are slow and only practical when the packet size is small and communication channels are not very noisy. We propose a packet recovery scheme called Fly-PRAC to address these issues. Fly-PRAC exploits algebraic relations between a group of coded packets to estimate their corrupted parts and recovers them. Unlike previous schemes, Fly-PRAC can recover coded packets at the intermediate node without decoding them. We have compared Fly-PRAC against S-PRAC. Results show when the bit error rate (ε) is 10^-4, Fly-PRAC outperforms S-PRAC by two folds for a payload of 900B. In two-hop communication with ε = 10^-4 and a payload size of 500B, by enabling the recovery in the intermediate node, Fly-PRAC reduces transmissions by 16%. In a Sparse Network Coding (SNC) scenario, with two non-zero elements in the coefficient vectors and a payload of 800B, there is a reduction by 31% on average for decoding delay. |
| title | Fly-PRAC: Packet Recovery for Random Linear Network Coding |
| topic | Information Theory Networking and Internet Architecture |
| url | https://arxiv.org/abs/2603.10266 |