Back to results

Massachusetts Institute of Technology

Benefits of opportunistic routing, implicit acknowledgments, and network coding on a linear broadcast network

Abstract

dc:description.abstract

This thesis studies the benefits of using opportunistic routing, implicit acknowledgments, and network coding on a linear broadcast packet network. Nodes are arranged in a line, and the first node wishes to communicate with the end node. When node i transmits, it is received at node j with a probability Pi,j . Several communication protocols are proposed and their performance studied using the mean and variance of the completion time as metrics. The protocols studied use end-to-end retransmission, end-to-end coding, and link-by-link retransmission with network coding both with and without opportunistic routing. Simulation and analytical results are presented. End-to-end coding significantly outperforms end-to-end retransmission on both metrics, and the link-by-link protocols outperform both. Opportunistic routing shows a mixed benefit over link-by-link protocols without it. When using opportunistic routing, the variance of the completion time is higher, and the mean is either similar or lower, depending on the channel conditions. When the loss probabilities are higher, opportunistic routing shows little benefit, whereas with a lower probability of packet loss, opportunistic routing shows a significant reduction in mean completion time.al Engineering and Computer Science.

Degree

thesis:*
Department dc:contributor.department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Whisman, Daniel Montgomery
Advisor dc:contributor.advisor
  • Médard.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Language dc:language.iso
eng

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1721.1/105956
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/105956

Chain of custody

source
Harvested from
MIT
Base URL
dspace.mit.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Whisman, Daniel Montgomery. Benefits of opportunistic routing, implicit acknowledgments, and network coding on a linear broadcast network. Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105956