In this paper, we start the investigation of distributed computing by mobile agents in
dangerous dynamic networks. The danger is posed by the presence in the network of a …

Consider a team of (one or more) mobile agents operating in a graph G. Unaware of the
graph topology and starting from the same node, the team must explore the graph. This …

We study the problem of black hole search by a set of mobile agents, where the underlying
graph is a dynamic cactus. A black hole is a dangerous vertex in the graph that eliminates …

As the size and use of networks continue to increase, network anomalies and faults are
commonplace. Consequently, effective detection of such network issues is crucial for the …

We investigate the black hole search problem by a set of mobile agents in a dynamic torus.
Black hole is defined to be a dangerous stationary node which has the capability to destroy …

In networked environments supporting mobile agents, a pressing problem is the presence of
network sites harmful for the agents. In this paper we consider the danger posed by a node …

Anomalies and faults are inevitable in computer networks, today more than ever before. This
is due to the large scale and dynamic nature of the networks used to process big data and to …

Consider a set of k identical asynchronous mobile agents located in an anonymous ring of n
nodes. The classical Gather (or Rendezvous) problem requires all agents to meet at the …

In this paper, we consider the problem of decontaminating a network from a black virus (BV)
using a team of mobile system agents. The BV is a harmful process which, like the …

We consider the problem of locating a black hole in a synchronous, anonymous, and
unoriented torus network using mobile agents. A black hole is a harmful network node that …