Analysis of Mobile Ad-hoc Network Routing Protocols in Random Graph Models
Philippe Jacquet, Anis Laouiti · 1999
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 probability p. We give the asymptotic evaluation of the flooding distance which is used in DSR and the multi-point relay flooding used in OLSR.