Paper Info
Title
Distributed Computation and Maintenance of a Spanning Tree in Dynamic Networks by Mobile Agents.
Abstract
The continued evolution of dynamic distributedsystems keeps the distributed computing an open area ofresearch. To make designing distributed algorithms easier, wemodel these latter with a local computation model. Attractedby the success of mobile agent paradigm in several domains, we are interested to proving benefits in the dynamic distributedsystems. We present in this paper a distributed algorithmthat computes and maintains a hierarchical spanning tree indynamic networks based on mobile agent. The mobile agent hasa responsibility of both computing and maintaining spanningtrees. The variant of the algorithm shown in this paper proposes a solution when channels appears and disappears inthe underling network.
Year
DOI
Venue
2016
10.1109/WAINA.2016.58
AINA Workshops
Keywords
Field
DocType
Distributed Algorithms,Dynamic Networks,Local computation,Mobile Agents,Spanning Tree
Distributed minimum spanning tree,Computer science,Mobile agent,Communication channel,Computer network,Distributed design patterns,Distributed algorithm,Spanning tree,Maintenance engineering,Computation,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
6
Authors
4
Name
Order
Citations
PageRank
Mouna Ktari141.08
Mohamed Haddar2157.09
Mohamed Mosbah341562.79
Ahmed Hadj Kacem429564.22