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 consider the problem of locating a black hole in synchronous anonymous networks
using finite state agents. A black hole is a harmful node in the network that destroys any …

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 …

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 …

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 is a harmful …

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 …

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 …

We study the impact of the topological structure on the complexity of the Black hole search
(Bhs) problem using mobile agents that communicate via tokens. First, we show that 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 …