Geodesic
Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
Ktari, Mouna1 ; Haddar, Mohamed Amine2  ; Mosbah, Mohamed3  ; Hadj Kacem, Ahmed1 
1 ReDCAD, University of Sfax, FSEGS 3018 Sfax, Tunis.
2 Information technology department, Taif University, Saoudi Arabia.
3 LaBRI, CNRS, Bordeaux INP, University of Bordeaux, 33405 Talence, France.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 51 (2017) no. 2, pp. 51-70

Voir la notice de l'article provenant de la source Numdam

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 distributed 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.

Reçu le :
Accepté le :
DOI : 10.1051/ita/2017007
Classification : 68.00
Keywords: Dynamic networks, distributed algorithms, mobile agents, local computation models, spanning tree

Ktari, Mouna 1 ; Haddar, Mohamed Amine 2 ; Mosbah, Mohamed 3 ; Hadj Kacem, Ahmed 1

1 ReDCAD, University of Sfax, FSEGS 3018 Sfax, Tunis.
2 Information technology department, Taif University, Saoudi Arabia.
3 LaBRI, CNRS, Bordeaux INP, University of Bordeaux, 33405 Talence, France. 
@article{ITA_2017__51_2_51_0,
     author = {Ktari, Mouna and Haddar, Mohamed Amine and Mosbah, Mohamed and Hadj Kacem, Ahmed},
     title = {Maintenance of a {Spanning} {Tree} {For} {Dynamic} {Graphs} by {Mobile} {Agents} and {Local} {Computations}},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {51--70},
     publisher = {EDP-Sciences},
     volume = {51},
     number = {2},
     year = {2017},
     doi = {10.1051/ita/2017007},
     mrnumber = {3731537},
     zbl = {1382.68031},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2017007/}
}
TY  - JOUR
AU  - Ktari, Mouna
AU  - Haddar, Mohamed Amine
AU  - Mosbah, Mohamed
AU  - Hadj Kacem, Ahmed
TI  - Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2017
SP  - 51
EP  - 70
VL  - 51
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita/2017007/
DO  - 10.1051/ita/2017007
LA  - en
ID  - ITA_2017__51_2_51_0
ER  - 
%0 Journal Article
%A Ktari, Mouna
%A Haddar, Mohamed Amine
%A Mosbah, Mohamed
%A Hadj Kacem, Ahmed
%T Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2017
%P 51-70
%V 51
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita/2017007/
%R 10.1051/ita/2017007
%G en
%F ITA_2017__51_2_51_0
Ktari, Mouna; Haddar, Mohamed Amine; Mosbah, Mohamed; Hadj Kacem, Ahmed. Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 51 (2017) no. 2, pp. 51-70. doi: 10.1051/ita/2017007

Cité par Sources :