Construction et maintien d'une for\^et couvrante dans un r\'eseau dynamique

TL;DR

This paper presents a decentralized algorithm for constructing and maintaining a spanning forest in mobile ad hoc networks using a token-based random walk, with performance analysis and enhancements through memory.

Contribution

Introduces a novel decentralized token-based algorithm for spanning forest maintenance in MANETs, including probabilistic analysis and performance improvements.

Findings

Performance is effectively analyzed in static networks.

Adding memory to the token walk slightly improves performance.

The algorithm is fully decentralized and suitable for mobile networks.

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.