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 deri...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology pp. 1 - 6
Main Authors: Shen, Han, Sun, Qifu Tyler, Meng, Fanyang, Wang, Ye, Li, Zongpeng, Liang, Yongsheng
Format: Journal Article
Language:English
Published: IEEE 2025
Subjects:
completion delay
Decoding
Delays
Encoding
finite buffer
Lower bound
Multi-hop
Network coding
Relay networks
RLNC
Spread spectrum communication
Systematics
Vectors
Wireless networks
ISSN:0018-9545, 1939-9359
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2025.3610147