The paper considers variants of the gathering problem of oblivious and asynchronous robots
moving in the plane. When n> 2 n> 2 robots are free to gather anywhere in the plane, the …

This paper studies the well-known problem of gathering multiple mobile agents moving in a
graph, but unlike previous results, we consider the problem in the presence of an …

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

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 …

We study the problem of locating a particularly dangerous node, the so-called black hole in
a synchronous anonymous ring network with mobile agents. A black hole destroys all mobile …