Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening - Computer Science > Information TheoryReportar como inadecuado




Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: A new random linear network coding scheme for reliable communications fortime division duplexing channels is proposed. The setup assumes a packeterasure channel and that nodes cannot transmit and receive informationsimultaneously. The sender transmits coded data packets back-to-back beforestopping to wait for the receiver to acknowledge ACK the number of degrees offreedom, if any, that are required to decode correctly the information. Weprovide an analysis of this problem to show that there is an optimal number ofcoded data packets, in terms of mean completion time, to be sent beforestopping to listen. This number depends on the latency, probabilities of packeterasure and ACK erasure, and the number of degrees of freedom that the receiverrequires to decode the data. This scheme is optimal in terms of the mean timeto complete the transmission of a fixed number of data packets. We show thatits performance is very close to that of a full duplex system, whiletransmitting a different number of coded packets can cause large degradation inperformance, especially if latency is high. Also, we study the throughputperformance of our scheme and compare it to existing half-duplex Go-back-N andSelective Repeat ARQ schemes. Numerical results, obtained for differentlatencies, show that our scheme has similar performance to the Selective Repeatin most cases and considerable performance gain when latency and packet errorprobability is high.



Autor: Daniel E. Lucani, Milica Stojanovic, Muriel Médard

Fuente: https://arxiv.org/







Documentos relacionados