Efficient dispersion on an anonymous ring in the presence of weak byzantine robots
The problem of dispersion of mobile robots on a graph asks that n robots initially placed
arbitrarily on the nodes of an n-node anonymous graph, autonomously move to reach a final …
arbitrarily on the nodes of an n-node anonymous graph, autonomously move to reach a final …
Black hole search in dynamic rings
GA Di Luna, P Flocchini, G Prencipe… - 2021 IEEE 41st …, 2021 - ieeexplore.ieee.org
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 …
dangerous dynamic networks. The danger is posed by the presence in the network of a …
Optimal dispersion on an anonymous ring in the presence of weak byzantine robots
The problem of dispersion of mobile robots on a graph asks that n robots initially placed
arbitrarily on the nodes of an n-node anonymous graph, autonomously move to reach a final …
arbitrarily on the nodes of an n-node anonymous graph, autonomously move to reach a final …
Locating a black hole in a dynamic ring
GA Di Luna, P Flocchini, G Prencipe… - Journal of Parallel and …, 2025 - Elsevier
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 …
network sites harmful for the agents. In this paper we consider the danger posed by a node …
Black Hole Search in Dynamic Rings: The Scattered Case
GA Di Luna, P Flocchini, G Prencipe… - … on Principles of …, 2023 - iris.uniroma1.it
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 …
a set of scattered agents (ie, the agents start from arbitrary locations of the graph). The black …
Asynchronous Gathering in a Dangerous Ring
S Dobrev, P Flocchini, G Prencipe, N Santoro - Algorithms, 2023 - mdpi.com
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 …
nodes. The classical Gather (or Rendezvous) problem requires all agents to meet at the …
Black Hole Search by a Set of Scattered Agents in Dynamic Rings
GA Di Luna, P Flocchini, G Prencipe… - arXiv preprint arXiv …, 2024 - arxiv.org
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 …
a set of scattered agents (ie, the agents start from arbitrary locations of the graph). The black …
Black virus decontamination of synchronous ring networks by initially scattered mobile agents
Abstract We study the Black Virus Decontamination problem in ring topologies for initially
scattered mobile agents. In this problem a number of mobile agents operate in a network …
scattered mobile agents. In this problem a number of mobile agents operate in a network …
Tight bounds for black hole search in dynamic rings
GA Di Luna, P Flocchini, G Prencipe… - arXiv preprint arXiv …, 2020 - arxiv.org
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 …
dangerous dynamic networks. The danger is posed by the presence in the network of a …
[PDF][PDF] Αλγοριθμική αντιμετώπιση προβλημάτων σε μη ασφαλή δίκτυα
Ν Γιαχούδης - 2021 - ir.lib.uth.gr
We often need to design algorithms used by entities which act autonomously having very
little or no initial knowledge about the environment, very limited or no communication or …
little or no initial knowledge about the environment, very limited or no communication or …