Transport schemes for topology-transparent scheduling

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Transport protocols provide reliable, end-to-end communication between a source and a destination in a network. The Transmission Control Protocol (TCP) uses backward error correction, where the destination explicitly returns feedback to the source. Forward error correction (FEC) can also be used for transport; here the source includes enough redundancy in the encoding symbols to allow the destination to decode the message. In this paper, we compare the performance of two transport schemes, TCP and LT, a scheme based on rateless FEC codes, in a wireless ad hoc network when topology-transparent scheduling is used for channel access. These schedules are derived from cover-free families, a type of combinatorial design. They provide a mechanism to guarantee collision-free communication between any two nodes provided that each of the N nodes of the network has at most a specified number D of active (transmitting) neighbours. We find that LT outperforms TCP in more strenuous network conditions.

Original languageEnglish (US)
Pages (from-to)229-248
Number of pages20
JournalJournal of Combinatorial Optimization
Volume14
Issue number2-3
DOIs
StatePublished - Oct 2007

Fingerprint

Transmission control protocol
Error Correction
Forward error correction
Scheduling
Topology
Backward Error
Combinatorial Design
Transport Protocol
Wireless Ad Hoc Networks
Decode
Communication
Wireless ad hoc networks
Error correction
Vertex of a graph
Network Topology
Redundancy
Schedule
Encoding
Collision
Cover

Keywords

  • Forward error correction
  • Topology-transparent scheduling
  • Transport protocols

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Mathematics(all)
  • Control and Optimization
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Transport schemes for topology-transparent scheduling. / Syrotiuk, Violet; Zhang, Zhiqiang; Colbourn, Charles.

In: Journal of Combinatorial Optimization, Vol. 14, No. 2-3, 10.2007, p. 229-248.

Research output: Contribution to journalArticle

@article{44edd06862fb48a58a14db5a97f9169d,
title = "Transport schemes for topology-transparent scheduling",
abstract = "Transport protocols provide reliable, end-to-end communication between a source and a destination in a network. The Transmission Control Protocol (TCP) uses backward error correction, where the destination explicitly returns feedback to the source. Forward error correction (FEC) can also be used for transport; here the source includes enough redundancy in the encoding symbols to allow the destination to decode the message. In this paper, we compare the performance of two transport schemes, TCP and LT, a scheme based on rateless FEC codes, in a wireless ad hoc network when topology-transparent scheduling is used for channel access. These schedules are derived from cover-free families, a type of combinatorial design. They provide a mechanism to guarantee collision-free communication between any two nodes provided that each of the N nodes of the network has at most a specified number D of active (transmitting) neighbours. We find that LT outperforms TCP in more strenuous network conditions.",
keywords = "Forward error correction, Topology-transparent scheduling, Transport protocols",
author = "Violet Syrotiuk and Zhiqiang Zhang and Charles Colbourn",
year = "2007",
month = "10",
doi = "10.1007/s10878-007-9058-4",
language = "English (US)",
volume = "14",
pages = "229--248",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",
number = "2-3",

}

TY - JOUR

T1 - Transport schemes for topology-transparent scheduling

AU - Syrotiuk, Violet

AU - Zhang, Zhiqiang

AU - Colbourn, Charles

PY - 2007/10

Y1 - 2007/10

N2 - Transport protocols provide reliable, end-to-end communication between a source and a destination in a network. The Transmission Control Protocol (TCP) uses backward error correction, where the destination explicitly returns feedback to the source. Forward error correction (FEC) can also be used for transport; here the source includes enough redundancy in the encoding symbols to allow the destination to decode the message. In this paper, we compare the performance of two transport schemes, TCP and LT, a scheme based on rateless FEC codes, in a wireless ad hoc network when topology-transparent scheduling is used for channel access. These schedules are derived from cover-free families, a type of combinatorial design. They provide a mechanism to guarantee collision-free communication between any two nodes provided that each of the N nodes of the network has at most a specified number D of active (transmitting) neighbours. We find that LT outperforms TCP in more strenuous network conditions.

AB - Transport protocols provide reliable, end-to-end communication between a source and a destination in a network. The Transmission Control Protocol (TCP) uses backward error correction, where the destination explicitly returns feedback to the source. Forward error correction (FEC) can also be used for transport; here the source includes enough redundancy in the encoding symbols to allow the destination to decode the message. In this paper, we compare the performance of two transport schemes, TCP and LT, a scheme based on rateless FEC codes, in a wireless ad hoc network when topology-transparent scheduling is used for channel access. These schedules are derived from cover-free families, a type of combinatorial design. They provide a mechanism to guarantee collision-free communication between any two nodes provided that each of the N nodes of the network has at most a specified number D of active (transmitting) neighbours. We find that LT outperforms TCP in more strenuous network conditions.

KW - Forward error correction

KW - Topology-transparent scheduling

KW - Transport protocols

UR - http://www.scopus.com/inward/record.url?scp=34548064848&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548064848&partnerID=8YFLogxK

U2 - 10.1007/s10878-007-9058-4

DO - 10.1007/s10878-007-9058-4

M3 - Article

AN - SCOPUS:34548064848

VL - 14

SP - 229

EP - 248

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 2-3

ER -