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.
What is the impact of obstacles on the graphs of connections between stations
in Mobile Ad hoc Networks? In order to answer, at least partially, this
question, the first step is to define both an environment with obstacles and a
mobility model for the stations in such an environment. The present paper
focuses on a new way of considering the mobility within environments with
obstacles, while keeping the core ideas of the well-known Random WayPoint
mobility model (a.k.a RWP).