Rateless forward error correction for topology-transparent scheduling

Violet Syrotiuk, Charles Colbourn, Sruthi Yellamraju

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: 1) We generalize the combinatorial requirement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network conditions. 2) In simulation, we closely match the theoretical bound on expected throughput. The bound was derived assuming acknowledgments are available immediately. We use rateless forward error correction (RFEC) as an acknowledgment scheme with minimal computational overhead. Since the wireless medium is inherently unreliable, RFEC also offers some measure of automatic adaptation to channel load. These contributions renew interest in topology-transparent scheduling when delay is a principal objective.

Original languageEnglish (US)
Pages (from-to)464-472
Number of pages9
JournalIEEE/ACM Transactions on Networking
Volume16
Issue number2
DOIs
StatePublished - Apr 2008

Fingerprint

Forward error correction
Scheduling
Topology
Wireless ad hoc networks
Mobile ad hoc networks
Throughput

Keywords

  • Mobile ad hoc networks
  • Rateless forward error correction
  • Topology-transparent scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

Rateless forward error correction for topology-transparent scheduling. / Syrotiuk, Violet; Colbourn, Charles; Yellamraju, Sruthi.

In: IEEE/ACM Transactions on Networking, Vol. 16, No. 2, 04.2008, p. 464-472.

Research output: Contribution to journalArticle

@article{0964f1195cad4fb1a5d71961500ba482,
title = "Rateless forward error correction for topology-transparent scheduling",
abstract = "Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: 1) We generalize the combinatorial requirement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network conditions. 2) In simulation, we closely match the theoretical bound on expected throughput. The bound was derived assuming acknowledgments are available immediately. We use rateless forward error correction (RFEC) as an acknowledgment scheme with minimal computational overhead. Since the wireless medium is inherently unreliable, RFEC also offers some measure of automatic adaptation to channel load. These contributions renew interest in topology-transparent scheduling when delay is a principal objective.",
keywords = "Mobile ad hoc networks, Rateless forward error correction, Topology-transparent scheduling",
author = "Violet Syrotiuk and Charles Colbourn and Sruthi Yellamraju",
year = "2008",
month = "4",
doi = "10.1109/TNET.2007.899018",
language = "English (US)",
volume = "16",
pages = "464--472",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Rateless forward error correction for topology-transparent scheduling

AU - Syrotiuk, Violet

AU - Colbourn, Charles

AU - Yellamraju, Sruthi

PY - 2008/4

Y1 - 2008/4

N2 - Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: 1) We generalize the combinatorial requirement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network conditions. 2) In simulation, we closely match the theoretical bound on expected throughput. The bound was derived assuming acknowledgments are available immediately. We use rateless forward error correction (RFEC) as an acknowledgment scheme with minimal computational overhead. Since the wireless medium is inherently unreliable, RFEC also offers some measure of automatic adaptation to channel load. These contributions renew interest in topology-transparent scheduling when delay is a principal objective.

AB - Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: 1) We generalize the combinatorial requirement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network conditions. 2) In simulation, we closely match the theoretical bound on expected throughput. The bound was derived assuming acknowledgments are available immediately. We use rateless forward error correction (RFEC) as an acknowledgment scheme with minimal computational overhead. Since the wireless medium is inherently unreliable, RFEC also offers some measure of automatic adaptation to channel load. These contributions renew interest in topology-transparent scheduling when delay is a principal objective.

KW - Mobile ad hoc networks

KW - Rateless forward error correction

KW - Topology-transparent scheduling

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

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

U2 - 10.1109/TNET.2007.899018

DO - 10.1109/TNET.2007.899018

M3 - Article

AN - SCOPUS:42549167956

VL - 16

SP - 464

EP - 472

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 2

ER -