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 language | English (US) |
|---|---|
| Pages (from-to) | 464-472 |
| Number of pages | 9 |
| Journal | IEEE/ACM Transactions on Networking |
| Volume | 16 |
| Issue number | 2 |
| DOIs | |
| State | Published - Apr 2008 |
Fingerprint
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 journal › Article
}
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 -