Searching for a black hole in interconnected networks using mobile agents and tokens
We show topological structure impacts on the complexity of Black Hole search (Bhs). With mobile agents communicating via tokens , cost of Bhs goes from ?(nlogn) ? ( n log n ) to ?(n) ? ( n ) . Our solutions use a constant number of tokens and run on asynchronous networks. We consider the use of initially scattered agents in a torus and a complete network.
black hole mobile agents tokens scattered co-located un-oriented simulation