2 research outputs found
Completion Delay of Random Linear Network Coding in Full-Duplex Relay Networks
As the next-generation wireless networks thrive, full-duplex and relaying
techniques are combined to improve the network performance. Random linear
network coding (RLNC) is another popular technique to enhance the efficiency
and reliability in 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 among
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 among 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 justify the theoretical characterizations, and compare the
two new schemes with the existing one