HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Analysis of Mobile Ad-hoc Network Routing Protocols in Random Graph Models

Philippe Jacquet 1 Anis Laouiti 1
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : We analyze the performance of ad-hoc routing as defined in MANet IETF working group in the random graph model. In particular we analyze the performance of a reactive protocol DSR and of a pro-active protocol OLSR. The random graph model is defined by the number of nodes n, and link probabili- ty p. We give the asymptotic evaluation of the flooding distance which is used in DSR and the multi-point relay flooding used in OLSR.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:02:36 AM
Last modification on : Friday, February 4, 2022 - 3:08:31 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:23:45 PM


  • HAL Id : inria-00072822, version 1



Philippe Jacquet, Anis Laouiti. Analysis of Mobile Ad-hoc Network Routing Protocols in Random Graph Models. [Research Report] RR-3835, INRIA. 1999. ⟨inria-00072822⟩



Record views


Files downloads