Random linear network coding for time division duplexing: When to stop talking and start listening
Name
Lucani-2009-Random linear network coding for time division duplexing When to stop talking and start listening.pdf
Size
275.4 KB
Format
Adobe PDF
Checksum (MD5)
01597ef3f20bfc05a6179ae94fd97cae
Author(s)
Medard, Muriel
Lucani, Daniel Enrique
Stojanovic, Milica
Date Issued
June 2009
Journal
IEEE INFOCOM 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Lucani, D.E., M. Stojanovic, and M. Medard. “Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening.” INFOCOM 2009, IEEE. 2009. 1800-1808. © 2010 Institute of Electrical and Electronics Engineers.
Version
Final published version
Abstract
A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. We provide an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets. We show that its performance is very close to that of a full duplex system, while transmitting a different number of coded packets can cause large degradation in performance, especially if latency is high. Also, we study the throughput performance of our scheme and compare it to existing half-duplex go-back-N and selective repeat ARQ schemes. Numerical results, obtained for different latencies, show that our scheme has similar performance to the selective repeat in most cases and considerable performance gain when latency and packet error probability is high.
Subjects
communication reliability
full duplex system
half-duplex go-back-N schemes
packet erasure
random linear network coding
selective repeat ARQ schemes
time division duplexing
time division duplexing channels
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2009.5062100
