Multiple Access for Multiple Destinations in Ad Hoc Networks

Abstract : In this paper, we address the medium-access control (MAC) problem in systems with multiple destinations, a problem that is crucial to the development of ad hoc networks. We focus on collision-resolution algorithms, specifically on First-Come, First-Serve (FCFS) splitting algorithms. We illustrate the difficulties that arise because of the interference between two populations of nodes that share a common channel, the most serious consequence of which is the possibility of deadlock that occurs when a well-known improvement for the single-destination case is used. Experimental results verify that the straightforward use of the FCFS algorithm in two-destination environments (without using this improvement) leads to deadlock-free performance. We show how performance can be improved by applying a time-division mechanism to separate interfering groups of nodes.
Type de document :
Communication dans un congrès
WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar 2003, Sophia Antipolis, France. 4 p., 2003
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00466777
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 24 mars 2010 - 17:23:32
Dernière modification le : mercredi 24 mars 2010 - 20:46:33
Document(s) archivé(s) le : lundi 28 juin 2010 - 16:39:10

Fichier

wieselthier-multiple.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00466777, version 1

Collections

Citation

Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Ephremides. Multiple Access for Multiple Destinations in Ad Hoc Networks. WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar 2003, Sophia Antipolis, France. 4 p., 2003. 〈inria-00466777〉

Partager

Métriques

Consultations de la notice

133

Téléchargements de fichiers

92