Rateless Forward Error Correction for Topology-Transparent Scheduling

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2008-04, Vol.16 (2), p.464-472
Main Authors: Syrotiuk, V.R., Colbourn, C.J., Yellamraju, S.
Format: Article
Language:English
Subjects:
Access protocols
Channels
Combinatorial analysis
Computational modeling
Computer simulation
Delay
Error correction
Error correction & detection
Forward error correction
Media Access Protocol
Mobile ad hoc networks
Network topology
Networks
Polynomials
Processor scheduling
rateless forward error correction
Schedules
Scheduling
Throughput
topology-transparent scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 rate less 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.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2007.899018