EXPLORATION WITH RETURN OF HIGHLY DYNAMIC NETWORKSJournal: International Journal of Advanced Research (Vol.9, No. 10)
Publication Date: 2021-10-13
Authors : Ahmed Mouhamadou Wade;
Page : 315-319
Keywords : Dynamic network Exploration Mobile Agent Graph;
In this paper, we study the necessary and sufficient time to explore with return constantly connected dynamic networks modelled by a dynamic graphs. Exploration with return consists, for an agent operating in a dynamic graph, of visiting all the vertices of the graph and returning to the starting vertex. We show that for constantly connected dynamic graphs based on a ring of sizen,3n-4 time units are necessary and sufficient to explore it. Assuming that the agent knows the dynamics of the graph.
Other Latest Articles
Last modified: 2021-11-01 20:26:57