Completion Delay of Random Linear Network Coding in Full-Duplex Relay Networks

TL;DR

This paper analyzes the completion delay of random linear network coding in full-duplex relay networks, providing theoretical bounds and formulas for different coding schemes to improve wireless communication efficiency.

Contribution

It introduces and compares two fundamental RLNC schemes in full-duplex relay networks, deriving closed-form delay formulas and validating them through numerical results.

Findings

The upper bound scheme has higher completion delay.

The lower bound scheme achieves optimal delay performance.

Numerical results confirm the theoretical delay characterizations.

Abstract

As the next-generation wireless networks thrive, full-duplex and relay techniques are combined to improve the network performance. Random linear network coding (RLNC) is another popular technique to enhance the efficiency and reliability of wireless communications. In this paper, in order to explore the potential of RLNC in full-duplex relay networks, we investigate two fundamental perfect RLNC schemes and theoretically analyze their completion delay performance. The first scheme is a straightforward application of conventional perfect RLNC studied in wireless broadcast, so it involves no additional process at the relay. Its performance serves as an upper bound for all perfect RLNC schemes. The other scheme allows sufficiently large buffer and unconstrained linear coding at the relay. It attains the optimal performance and serves as a lower bound for all RLNC schemes. For both schemes, closed-form formulae to characterize the expected completion delay at a single receiver as well as for the whole system are derived. Numerical results are also demonstrated to validate the theoretical characterizations, and compare the two fundamental schemes with the existing one.