Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Online Network Coding for Time-Division Duplexing

Online Network Coding for Time-Division Duplexing

Thumbnail Image
Download
Name

Medard_Online network.pdf

Size

227.05 KB

Format

Adobe PDF

Checksum (MD5)

199b684139d636c3dc22641bba11be74

Author(s)
Lucani, Daniel Enrique
•
Medard, Muriel
•
Stojanovic, Milica
Date Issued
December 2010
Journal
IEEE Global Telecommunications Conference, (GLOBECOM 2010)
Publisher
Institute of Electrical and Electronics Engineers
Citation
Lucani, Daniel E., Muriel Medard and Milica Stojanovic. "Online Network Coding for Time-Division Duplexing." IEEE Global Communications Conference (GLOBECOM 2010), Miami, Florida, December 6-10, 2010.
Version
Author's final manuscript
Abstract
We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variable bulk size and with feedback, i.e., when a set of packets are serviced at a given time, they might be reintroduced to the queue to form part of the next service batch. We show that there is an optimal number of coded data packets that the sender should transmit back-to-back before stopping to wait for an acknowledgement from the receiver. This number depends on the latency, probability of packet erasure, degrees of freedom at the receiver, the size of the coding window, and the arrival rate of the Poisson process. Random network coding is performed across a moving window of packets that depends on the packets in the queue, design constraints on the window size, and the feedback sent from the receiver. We study the mean time between generating a packet at the source and it being “seen”, but not necessarily decoded, at the receiver. We also analyze the mean time between a decoding event and the next, defined as the decoding of all the packets that have been previously “seen” and those packets involved in the current window of packets. Inherently, a decoding event implies an inorder decoding of a batch of data packets. We present numerical results illustrating the trade-off between mean delay and mean time between decoding events.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
http://creativecommons.org/licenses/by-nc-sa/3.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/60309
DOI of Published Version
https://doi.org/10.1109/GLOCOM.2010.5683892
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.