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 …

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 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 …

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 …

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 …

In this paper we investigate the problem of searching for a black hole in a dynamic graph by
a set of scattered agents (ie, the agents start from arbitrary locations of the graph). The black …

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 study the problem of mobile entities that synchronously have to explore and
repair a graph with faulty nodes, usually called black-holes, that destroy any entering entity …

We consider synchronous and mobile entities that have to explore and make safe a network
with faulty nodes, called black-holes, that destroy any entering entity. We are interested in …

In distributed mobile computing environments one of the most pressing concerns is security.
Two are the most important security threats: a malicious mobile process which can move …