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 …

[PDF][PDF] Mobile agents in distributed computing: Network exploration

S Das - Bulletin of EATCS, 2013 - eatcs.org
One of the recent paradigms in networked distributed computing is the use of mobile agents.
Mobile agents are software robots that can autonomously migrate from node to node within …

Shape recognition by a finite automaton robot

R Gmyr, K Hinnenthal, I Kostitsyna, F Kuhn… - … of Computer Science …, 2018 - research.tue.nl
Motivated by the problem of shape recognition by nanoscale computing agents, we
investigate the problem of detecting the geometric shape of a structure composed of …

Cadbots: algorithmic aspects of manipulating programmable matter with finite automata

SP Fekete, R Gmyr, S Hugo, P Keldenich, C Scheffer… - Algorithmica, 2021 - Springer
We contribute results for a set of fundamental problems in the context of programmable
matter by presenting algorithmic methods for evaluating and manipulating a collective of …

Black hole search in computer networks: State-of-the-art, challenges and future directions

M Peng, W Shi, JP Corriveau, R Pazzi… - Journal of Parallel and …, 2016 - Elsevier
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 …

Dangerous graphs

E Markou, W Shi - Distributed Computing by Mobile Entities: Current …, 2019 - Springer
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 …

[HTML][HTML] Improved periodic data retrieval in asynchronous rings with a faulty host

E Bampas, N Leonardos, E Markou… - Theoretical Computer …, 2015 - Elsevier
The exploration problem has been extensively studied in unsafe networks containing
malicious hosts of a highly harmful nature, called black holes, which completely destroy …

[HTML][HTML] On mobile agent verifiable problems

E Bampas, D Ilcinkas - Information and Computation, 2018 - Elsevier
We consider decision problems that are solved in a distributed fashion by synchronous
mobile agents operating in an unknown, anonymous network. Each agent has a unique …

[HTML][HTML] More agents may decrease global work: A case in butterfly decontamination

F Luccio, L Pagli - Theoretical Computer Science, 2016 - Elsevier
This paper is a contribution to network decontamination with a view inherited from parallel
processing. At the beginning some or all the vertices may be contaminated. The network is …

[PDF][PDF] Models and algorithms for hybrid networks and hybrid programmable matter.

K Hinnenthal - 2021 - digital.ub.uni-paderborn.de
This dissertation is devoted to the study of two different hybrid distributed systems, hybrid
networks and hybrid programmable matter. Hybrid networks are communication networks in …