eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2024-05-31
6:1
6:16
10.4230/LIPIcs.SAND.2024.6
article
Black Hole Search in Dynamic Tori
Bhattacharya, Adri
1
https://orcid.org/0000-0003-1517-8779
Italiano, Giuseppe F.
2
https://orcid.org/0000-0002-9492-9894
Mandal, Partha Sarathi
1
https://orcid.org/0000-0002-8632-5767
Indian Institute of Technology Guwahati, Assam, India
Luiss University, Rome, Italy
We investigate the black hole search problem using a set of mobile agents in a dynamic torus. A black hole is defined as a dangerous stationary node that has the capability to destroy any number of incoming agents without leaving any trace of its existence. A torus of size n× m (3 ≤ n ≤ m) is a collection of n row rings and m column rings, and the dynamicity is such that each ring is considered to be 1-interval connected, i.e., in other words at most one edge can be missing from each ring at any round. The parameters which define the efficiency of any black hole search algorithm are: the number of agents and the number of rounds (or time) for termination. We consider two initial configurations of mobile agents: first, the agents are co-located, second, the agents are scattered. In each case, we establish lower and upper bounds on the number of agents and on the amount of time required to solve the black hole search problem.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol292-sand2024/LIPIcs.SAND.2024.6/LIPIcs.SAND.2024.6.pdf
Black Hole Search
Time Varying Graphs
Dynamic Torus
Distributed Algorithms
Mobile Agents