Multiple Access for Multiple Destinations in Ad Hoc Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Multiple Access for Multiple Destinations in Ad Hoc Networks


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.
Fichier principal
Vignette du fichier
wieselthier-multiple.pdf (515.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00466777 , version 1 (24-03-2010)


  • HAL Id : inria-00466777 , version 1


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. ⟨inria-00466777⟩


71 View
86 Download


Gmail Facebook X LinkedIn More