TY - JOUR
T1 - Rateless forward error correction for topology-transparent scheduling
AU - Syrotiuk, Violet
AU - Colbourn, Charles
AU - Yellamraju, Sruthi
N1 - Funding Information:
Manuscript received June 6, 2004; revised December 7, 2005, July 9, 2006, and October 22, 2006; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor M. Zukerman. This work was supported in part by the National Science Foundation (NSF) under Grant ANI-0105985 and by the Army Research Office (ARO) under Grant DAAD 19-01-1-0406. Any opinions, findings, conclusions, or recommendations expressed are those of the authors and do not necessarily reflect the views of NSF or ARO.
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 -