Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, March 24, 2010 - 5:23:32 PM
Last modification on : Wednesday, March 24, 2010 - 8:46:33 PM
Long-term archiving on: : Monday, June 28, 2010 - 4:39:10 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads