Skip to Main content Skip to Navigation
Conference papers

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

Cited literature [2 references]  Display  Hide  Download
Contributor : Yoann Pigné Connect in order to contact the contributor
Submitted on : Thursday, May 6, 2010 - 10:04:52 AM
Last modification on : Wednesday, March 2, 2022 - 10:10:08 AM
Long-term archiving on: : Wednesday, November 30, 2016 - 11:26:21 PM


Files produced by the author(s)


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


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⟩



Record views


Files downloads