Rateless forward error correction for topology-transparent scheduling

Violet Syrotiuk, Charles Colbourn, Sruthi Yellamraju

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


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
Issue number2
StatePublished - Apr 2008


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

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Rateless forward error correction for topology-transparent scheduling'. Together they form a unique fingerprint.

Cite this