• Transport schemes for topology...

Treffer: Transport schemes for topology-transparent scheduling

Title:
Transport schemes for topology-transparent scheduling
Authors:
SYROTIUK, Violet R, ZHIQIANG ZHANG, COLBOURN, Charles J
Source:
Selected papers from the CTS Conference on Combinatorics and its Applications in Honor of Franck K. Hwang's 65th birthdayJournal of combinatorial optimization. 14(2-3):229-248
Publisher Information:
Norwell, MA: Springer, 2007.
Publication Year:
2007
Physical Description:
print, 1 p.1/4
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Codage, Coding, Codificación, Code correcteur erreur, Error correcting code, Código corrector error, Correction erreur, Error correction, Corrección error, Esquive collision, Collision avoidance, Esquiva colisión, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Ordonnancement, Scheduling, Reglamento, Protocole TCP, Transmission control protocol, Protocolo TCP, Protocole transmission, Transmission protocol, Protocolo transmisión, Redondance, Redundancy, Redundancia, Réseau ad hoc, Ad hoc network, Red ad hoc, Réseau sans fil, Wireless network, Red sin hilo, Réseau télécommunication, Telecommunication network, Red telecomunicación, Rétroaction, Feedback regulation, Retroacción, Système réparti, Distributed system, Sistema repartido, Topologie, Topology, Topología, Télécommunication sans fil, Wireless telecommunication, Telecomunicación sin hilo, Transport protocols Forward error correction Topology-transparent scheduling
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-8809, United States
ISSN:
1382-6905
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19068021
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Operational research. Management
Accession Number:
edscal.19068021
Database:
PASCAL Archive

Weitere Informationen

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.