MPR-based Pruning Techniques for Shortest Path Tree Computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

MPR-based Pruning Techniques for Shortest Path Tree Computation


Multi-Point Relaying (MPR) is a well-known relay pruning algorithm that has proved to be useful for efficient dissemination in Mobile Ad hoc Networks (MANETs). But this technique may be useful for other tasks in MANET link-state routing as well. In particular, the approach is attractive for the selection of topology information to be flooded across the network. Requirements for such topology selection are however different from those applying for efficient dissemination, so approaches in such direction need to address these requirements and adapt or complement the MPR mechanism accordingly. This paper analyzes the main asymptotic properties of MPR and MPR-based topology selection algorithms, and provides sufficient conditions for the correctness of MPR-based topology selection. It examines as well in detail the MPR-based topology selection algorithm of MPR-OSPF, Path MPR, and shows that this algorithm may be unable, in certain conditions, to preserve optimal routes in its topology selection. The paper concludes by proposing and validating a modification of the Path MPR algorithm to overcome this sub-optimal performance.
Fichier principal
Vignette du fichier
RR-7329.pdf (307.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00496617 , version 1 (30-06-2010)


  • HAL Id : inria-00496617 , version 1


Juan Antonio Cordero. MPR-based Pruning Techniques for Shortest Path Tree Computation. [Research Report] RR-7329, INRIA. 2010. ⟨inria-00496617⟩
199 View
213 Download


Gmail Facebook Twitter LinkedIn More