Completion Delay of Random Linear Network Coding in Finite-Buffer Multi-Hop Networks

Multi-hop relay transmissions are critical in many communication systems. In this paper, we propose a novel recoding scheme based on systematic random linear network coding (RLNC) for finite-buffer multi-hop links. A theoretical lower bound on the completion delay of this transmission scheme is derived based on perfect RLNC. Through simulation and analysis, we compare the proposed scheme with a conventional recoding approach. The results demonstrate that the new RLNC scheme achieves a higher completion delay rate, particularly in scenarios involving long links, high packet loss rates, or large file transfers.