Abstract
The continued evolution of dynamic distributed systems keeps the distributed computing an open area of research. To make designing distributed algorithms easier, we model these latter with a local computation model. Attracted by the success of mobile agent paradigm in several domains, we are interested to proving benefits in the dynamic distributed systems. We present in this paper a distributed algorithm that computes and maintains a hierarchical spanning tree in dynamic networks based on mobile agent. The mobile agent has a responsibility of both computing and maintaining spanning trees. The variant of the algorithm shown in this paper proposes a solution when channels appears and disappears in the underling network.