Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening
Daniel E. Lucani,Milica Stojanovic,Muriel Medard +2 more
- 19 Apr 2009
- pp 1800-1808
TL;DR: This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets, and has similar performance to the Selective Repeat in most cases and considerable performance gain when latency and packet error probability is high.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Underwater sensor networks: applications, advances and challenges
TL;DR: Key applications and the main phenomena related to acoustic propagation are summarized, and how they affect the design and operation of communication systems and networking protocols at various layers are discussed.
Exact Decoding Probability Under Random Linear Network Coding
TL;DR: This letter compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q.
Network Coding for Mobile Devices - Systematic Binary Random Rateless Codes
Janus Heide,Morten V. Pedersen,Frank H. P. Fitzek,Torben Larsen +3 more
- 14 Jun 2009
TL;DR: This paper proposes to base RLNC on the binary Galois field and to use a systematic code to achieve synthetic encoding/decoding throughput of up to 40/30 MB/s on a Nokia N95-8GB mobile phone and 1.5/1.0 GB/son a high end laptop.
Completion delay minimization for instantly decodable network codes
Sameh Sorour,Shahrokh Valaee +1 more
TL;DR: Simulation results show that the proposed algorithms significantly reduce the IDNC completion delay compared to the random and maximum-rate algorithms, and almost achieve the global optimal completion delay performance over all network codes in broadcast scenarios.
An optimal adaptive network coding scheme for minimizing decoding delay in broadcast erasure channels
TL;DR: Analysis of feedback-based adaptive network coding schemes reveals that by taking channel memory into account in network coding decisions, one can considerably reduce decoding delays.
References
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
9.3K
Linear network coding
TL;DR: This work forms this multicast problem and proves that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
A Random Linear Network Coding Approach to Multicast
TL;DR: This work presents a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks, and shows that this approach can take advantage of redundant network capacity for improved success probability and robustness.
An algebraic approach to network coding
Ralf Koetter,Muriel Medard +1 more
TL;DR: For the multicast setup it is proved that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question.
Trading structure for randomness in wireless opportunistic routing
Szymon Chachulski,Michael Jennings,Sachin Katti,Dina Katabi +3 more
- 27 Aug 2007
TL;DR: More as mentioned in this paper is a MAC-independent opportunistic routing protocol, which randomly mixes packets before forwarding them to ensure that routers that hear the same transmission do not forward the same packets, thus, it needs no special scheduler to coordinate routers and can run directly on top of 802.11.