Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations

Mouna Ktari, Mohamed Amine Haddar, Mohamed Mosbah, Ahmed Hadj Kacem
2017 RAIRO - Theoretical Informatics and Applications  
The problem of constructing and maintaining a spanning tree in dynamic networks is important in distributed systems. Trees are essential structures in various communication protocols such as information broadcasting, routing, etc. In a distributed computing environment, the solution of this problem has many practical motivations. To make designing distributed algorithm easier, we model this latter with a local computation model. Based on the mobile agent paradigm, we present in this paper a
more » ... ributed algorithm that maintain a hierarchical spanning tree in dynamic networks. We study all topological events that may affect the structure of the spanning tree: we address the appearance and the disappearance of places and communication channels. Mathematics Subject Classification. 68.00. graph G n , E that denotes all graphs having n labeled nodes V 1 , V 2 , ..., V n and E edges. Each of these edges having the same probability to be chosen. A random graph G n , E can be defined as an element of G n , E chosen at random. Several other models have been proposed, each one changes some of the properties of the initial
doi:10.1051/ita/2017007 fatcat:c7w3rkgkjzaehpuf2wahkt7hfm