Delay-exponent of decode-forward streaming

We propose a decode-forward protocol for streaming over a relay network using sequential random tree codes. An achievable bound on the end-to-end error performance is derived. The bound is parameterised by the number of errors occuring at the relay, which is the sum of correlated Bernoulli processes. The bound is useful for determining the achievable delay-exponent as well as for designing finite-delay relaying schemes. For a wide range of conjectured correlation models, the proposed scheme can achieve the delay-exponent of full source-relay cooperation.