Fly-PRAC: Packet Recovery for Random Linear Network Coding

2026-03-10

AI Summary

This study addresses the inefficiency of traditional network coding in noisy channels, where corrupted packets are typically discarded, leading to significant information loss, and existing recovery methods suffer from slow speed and limited applicability. The authors propose Fly-PRAC, a novel scheme that enables efficient in-network repair of encoded packets without decoding at intermediate nodes. By modeling the algebraic relationships among random linear network coding packets and integrating a corrupted-region estimation algorithm, Fly-PRAC directly recovers damaged segments. This approach overcomes the prior dependence on short packet lengths and low-noise environments. Experimental results demonstrate that, under a bit error rate of 10⁻⁴ with 900-byte payloads, Fly-PRAC achieves twice the throughput of S-PRAC, reduces transmission volume by 16% in two-hop scenarios, and lowers average decoding latency by 31% in sparse coding settings.

Technology Category

• Planning, Routing, and Scheduling: Replanning and Plan Repair
• Search and Optimization: Evolutionary Computation
• Cognitive Modeling & Cognitive Systems: Neural Spike Coding

Application Category

• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Security and Privacy: Large-scale security measurements
• Search and Retrieval-Augmented AI: Efficiency and scalability of Web search engines

Abstract

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 ({\epsilon}) is 10^-4, Fly-PRAC outperforms S-PRAC by two folds for a payload of 900B. In two-hop communication with {\epsilon} = 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.

Problem

• Network Coding
• Packet Recovery
• Noisy Channels
• Corrupted Packets
• Decoding Delay

Innovation

• Fly-PRAC
• Packet Recovery
• Random Linear Network Coding
• Intermediate Node Recovery
• Algebraic Relations