Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Cleaning an Arbitrary Regular Network with Mobile Agents

  • Conference paper
Distributed Computing and Internet Technology (ICDCIT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3816))

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.

Keywords: Mobile Agents, Intruder Capture, Graph Search, Mesh.

Work partially supported by Natural Sciences and Engineering Research Council of Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flocchini, P., Nayak, A., Schulz, A. (2005). Cleaning an Arbitrary Regular Network with Mobile Agents. In: Chakraborty, G. (eds) Distributed Computing and Internet Technology. ICDCIT 2005. Lecture Notes in Computer Science, vol 3816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604655_17

Download citation

  • DOI: https://doi.org/10.1007/11604655_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30999-4

  • Online ISBN: 978-3-540-32429-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics