Transport schemes for topology-transparent scheduling

Violet R. Syrotiuk (), Zhiqiang Zhang () and Charles J. Colbourn ()
Additional contact information
Violet R. Syrotiuk: Arizona State University
Zhiqiang Zhang: Arizona State University
Charles J. Colbourn: Arizona State University

Journal of Combinatorial Optimization, 2007, vol. 14, issue 2, No 13, 229-248

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

Keywords: Transport protocols; Forward error correction; Topology-transparent scheduling (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9058-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:14:y:2007:i:2:d:10.1007_s10878-007-9058-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9058-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().