Cleaning an arbitrary regular network with mobile agents

Authors:
Paola Flocchini;Amiya Nayak;Arno Schulz
Affiliations:
School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada;School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada;School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada
Venue:
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Year:
2005

Citing 8
Cited 6

Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
Min cut is NP-complete for edge weighted trees

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Recontamination does not help to search a graph

Journal of the ACM (JACM)
The vertex separation and search number of a graph

Information and Computation
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Capture of an intruder by mobile agents

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Contiguous Search in the Hypercube for Capturing an Intruder

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01

Intruder capture in Sierpinski graphs

FUN'07 Proceedings of the 4th international conference on Fun with algorithms
GSST: anytime guaranteed search

Autonomous Robots
A distributed dynamics for webgraph decontamination

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Distributed security algorithms by mobile agents

ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
The effect of intelligent escape on distributed SER-Based search

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Integer programming models and algorithms for the graph decontamination problem with mobile agents

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as efficiently as possible. We study under what conditions and what cost a team of mobile agents can do this in synchronous arbitrary regular graphs using the breadth-first-search strategy. Due to the nature of the experiment we use a genetic algorithm to find the minimum number of agents required to decontaminate a given network. The results show that there is a relation between the degree, the size of the graph, and the number of starting locations of the mobile agents. in particular, this relation demonstrates the possibility of improvements in reducing the number of mobile agents used depending on the number of starting location in arbitrary regular graphs.