Reliability and Latency Analysis of Sliding Network Coding With Re-Transmission

TL;DR

This paper analyzes how to optimize sliding network coding with re-transmission to enhance reliability and reduce latency in future wireless networks, by adjusting transmission strategies based on round-trip time.

Contribution

It introduces a novel approach to re-transmission in sliding network coding, deriving theoretical bounds and expressions for improved reliability and latency management.

Findings

Re-transmission schemes significantly reduce block error probability.

The approach maintains low latency even with increased reliability.

Theoretical bounds closely match simulation results.

Abstract

Future networks are expected to support various ultra-reliable low-latency communications via wireless links. To avoid the loss of packets and keep the low latency, sliding network coding (SNC) is an emerging technology by generating redundant packets that are the linear combination of the original data packets from the current block and some previous blocks. However, how to take the advantage of re-transmission for SNC is still an open problem since higher reliability could be achieved at the expense of large latency caused by round-trip time (RTT). To deal with this issue, in this paper, we consider the idea of adjusting the transmission phase and the number of the redundant packets for SNC with re-transmission. Specifically, If RTT is large, most of the redundant packets are sent at the first transmission, otherwise, re-transmission will be used. We first derive a concise and tight lower bound of the block error probability of SNC without re-transmission. Then, based on the bound, the theoretical expressions of the proposed re-transmission schemes are derived regarding the block error probability, the average code length, and the average packet latency. Results show that the proposed SNC with re-transmission improves block error probability and keeps the low latency.