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

Su, Rina; Sun, Qifu Tyler; Zhang, Zhongshan

doi:10.1109/isit45174.2021.9517749

Cited by 4 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• S P +1 > T P,r , which means upon the reception of the (P + 1) st packet at the RS, receiver r has only received fewer than P packets. In this case, it takes on average 1 p 0 additional timeslots for the RS to receive the (P + 1) st packet, and 1 pr − 1 timeslots for receiver r to receive the (P + 1) st packet. Thus, E[D P +1,r ] = E[D P,r ] + 1 p 0 + 1 pr − 1.…”

Section: Pr(smentioning

confidence: 99%

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

Su¹,

Sun²,

Zhang³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

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, closedform 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.

show abstract

Section: Pr(smentioning

confidence: 99%