TY - JOUR
T1 - Transport schemes for topology-transparent scheduling
AU - Syrotiuk, Violet
AU - Zhang, Zhiqiang
AU - Colbourn, Charles
N1 - Funding Information:
Acknowledgements Thanks to Minghao Cui for implementing the LT encoding and decoding algorithm in (Luby 2002). The research of Violet R. Syrotiuk and Zhiqiang Zhang is supported in part by National Science Foundation grant ANI-0240524. Any opinions, findings, conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of NSF.
PY - 2007/10
Y1 - 2007/10
N2 - Transport protocols provide reliable, end-to-end communication between a source and a destination in a network. The Transmission Control Protocol (TCP) uses backward error correction, where the destination explicitly returns feedback to the source. Forward error correction (FEC) can also be used for transport; here the source includes enough redundancy in the encoding symbols to allow the destination to decode the message. In this paper, we compare the performance of two transport schemes, TCP and LT, a scheme based on rateless FEC codes, in a wireless ad hoc network when topology-transparent scheduling is used for channel access. These schedules are derived from cover-free families, a type of combinatorial design. They provide a mechanism to guarantee collision-free communication between any two nodes provided that each of the N nodes of the network has at most a specified number D of active (transmitting) neighbours. We find that LT outperforms TCP in more strenuous network conditions.
AB - Transport protocols provide reliable, end-to-end communication between a source and a destination in a network. The Transmission Control Protocol (TCP) uses backward error correction, where the destination explicitly returns feedback to the source. Forward error correction (FEC) can also be used for transport; here the source includes enough redundancy in the encoding symbols to allow the destination to decode the message. In this paper, we compare the performance of two transport schemes, TCP and LT, a scheme based on rateless FEC codes, in a wireless ad hoc network when topology-transparent scheduling is used for channel access. These schedules are derived from cover-free families, a type of combinatorial design. They provide a mechanism to guarantee collision-free communication between any two nodes provided that each of the N nodes of the network has at most a specified number D of active (transmitting) neighbours. We find that LT outperforms TCP in more strenuous network conditions.
KW - Forward error correction
KW - Topology-transparent scheduling
KW - Transport protocols
UR - http://www.scopus.com/inward/record.url?scp=34548064848&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34548064848&partnerID=8YFLogxK
U2 - 10.1007/s10878-007-9058-4
DO - 10.1007/s10878-007-9058-4
M3 - Article
AN - SCOPUS:34548064848
SN - 1382-6905
VL - 14
SP - 229
EP - 248
JO - Journal of Combinatorial Optimization
JF - Journal of Combinatorial Optimization
IS - 2-3
ER -