Construction et maintien d'une forêt couvrante dans un réseau dynamique

Abstract : In this work we introduce the principles of an algorithm that constructs and maintains a spanning forest in a mobile telecommunication network—a MANET. The algorithm is based on the random walk of a token and is entirely decentralized. A probability analysis is performed when the network is static. Then we show that performances can be slightly enhanced when adding a memory process in the walk on the token.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [2 references]  Display  Hide  Download

https://hal.inria.fr/inria-00477755
Contributor : Yoann Pigné <>
Submitted on : Thursday, May 6, 2010 - 10:04:52 AM
Last modification on : Thursday, February 7, 2019 - 2:50:09 PM
Document(s) archivé(s) le : Wednesday, November 30, 2016 - 11:26:21 PM

Files

algotel-2010.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00477755, version 2
  • ARXIV : 1005.5614

Citation

Yoann Pigné, Arnaud Casteigts, Frédéric Guinand, Serge Chaumette. Construction et maintien d'une forêt couvrante dans un réseau dynamique. 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. 4 p. ⟨inria-00477755v2⟩

Share

Metrics

Record views

219

Files downloads

213