Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Optimal elections in labeled hypercubes
Journal of Parallel and Distributed Computing
Seven good reasons for mobile agents
Communications of the ACM
A model for distributed multi-agent traffic control
IEA/AIE '99 Proceedings of the 12th international conference on Industrial and engineering applications of artificial intelligence and expert systems: multiple approaches to intelligent systems
D'Agents: applications and performance of a mobile-agent system
Software—Practice & Experience - Special issue: Mobile agent systems
Security Issues in Mobile Code Systems
Mobile Agents and Security
Characteristics of the MasPar parallel I/O system
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Mobile Agent Architecture Integration for a Wireless Sensor Medical Application
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Theory of Computing Systems
Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Hardness and approximation results for Black Hole Search in arbitrary networks
Theoretical Computer Science
Agilla: A mobile agent middleware for self-adaptive wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Black Hole Search with Tokens in Interconnected Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Tight bounds for scattered black hole search in a ring
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Black hole search with finite automata scattered in a synchronous torus
DISC'11 Proceedings of the 25th international conference on Distributed computing
Searching for black-hole faults in a network using multiple agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Black hole search in asynchronous rings using tokens
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Method to balance the communication among multi-agents in real time traffic synchronization
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
Research note: Security issues related to mobile code and agent-based systems
Computer Communications
IEEE Communications Magazine
Complexity of Searching for a Black Hole
Fundamenta Informaticae
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science
Hi-index | 0.00 |
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 token model can support the same cost as in the whiteboard model, despite the fact that communication between mobile agents is considerably more restricted (and complex) in a token model than in a whiteboard one. More precisely, in this paper, we focus on three specific topologies, namely: an asynchronous (i) hypercube, (ii) torus and (iii) complete network. With knowledge of which of these topologies is being used, we present token-based solutions for Bhs where the number of moves executed by a team of two co-located anonymous agents can be reduced to @Q(n). These proposed solutions do not require the availability of a map and do not assume FIFO on either nodes or links. Second, we consider the use of scattered agents for Bhs in an asynchronous (i) torus and (ii) complete network. We show that, using 3 scattered agents and 7 tokens in total, a black hole can be located with @Q(n) moves in an oriented asynchronous torus. Again, the solution does not assume FIFO on the links and nodes. If the number of scattered agents in a torus increases, the cost is reduced but communication between these agents becomes significantly more complicated. We propose an algorithm that solves Bhs using k (k3) scattered agents, with only 1 token per agent, with O(k^2n^2) moves. Beyond theoretical proofs, we also discuss simulations of an actual system in order to evaluate our proposed solutions.