Abstract
This paper compares the end-to-end (E2E) fountain codes and random linear network coding (RLNC) for lossy multi-hop short-packet communications, under the constraint that the coding coefficient overhead imposed by RLNC recoding is non-negligible. The decoding failure probability (DFP) of RLNC is analyzed and computed as a function of the most relevant parameters. A DFP minimization problem is formulated and numerically solved from a cross-layer perspective. By comparing the codes using optimized parameters, the DFP of RLNC is shown to be higher than that of the E2E codes, which is due to the coefficient overhead. The results suggest that E2E fountain codes might be preferred for multi-hop short-packet communications.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call