|| On the delay of random linear network coding in full-duplex relay networks
||Rina Su, Qifu Tyler Sun, University of Science and Technology Beijing, China; Zhongshan Zhang, Beijing Institute of Technology, China|
||D1-S6-T1: Wireless Network Coding
||Monday, 12 July, 23:40 - 00:00
||Tuesday, 13 July, 00:00 - 00:20
As the next-generation wireless networks thrive, full-duplex and relaying techniques are combined to improve the performance of the networks. 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 performance in terms of completion delay. The first scheme is a straightforward application of perfect RLNC 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. As a result, it attains the optimal performance and serves as a lower bound among all perfect RLNC schemes. Explicit closed-form formulae for the expected completion delay of both schemes are derived. Numerical results are also demonstrated to verify the theoretical characterization and compare the two new schemes with the existing one.