Software mobile agents are a modern computing paradigm offering new methods to deal with various problems in a distributed environment. In this report we consider the problem of capturing a malicious entity moving along a network. We devise a strategy to capture the entity in a particular network, the WK-R(3,L), using a team of collaborating agents. WK-R networks have some properties interesting "per se" and useful to understand how to deal with other networks. The malicious entity, the "intruder", has the ability to move along the network knowing the positions of the agents, the "defenders". The agents move asynchronously along the links of the network and can see the state of the neighbour nodes. They "disinfect" the nodes infected by the intruder with a monotone strategy, namely a node disinfected is not infected anymore. The disinfection strategy is fully distributed and optimal with respect to number of required agents, number of moves and time steps. We devise also a strategy where the agents have not visibility of neighbour nodes: in such a case a leader seems necessary, even if the number of agents doesn't vary.

Intruders capture in wk-r networks

2014

Abstract

Software mobile agents are a modern computing paradigm offering new methods to deal with various problems in a distributed environment. In this report we consider the problem of capturing a malicious entity moving along a network. We devise a strategy to capture the entity in a particular network, the WK-R(3,L), using a team of collaborating agents. WK-R networks have some properties interesting "per se" and useful to understand how to deal with other networks. The malicious entity, the "intruder", has the ability to move along the network knowing the positions of the agents, the "defenders". The agents move asynchronously along the links of the network and can see the state of the neighbour nodes. They "disinfect" the nodes infected by the intruder with a monotone strategy, namely a node disinfected is not infected anymore. The disinfection strategy is fully distributed and optimal with respect to number of required agents, number of moves and time steps. We devise also a strategy where the agents have not visibility of neighbour nodes: in such a case a leader seems necessary, even if the number of agents doesn't vary.
2014
Istituto di Scienze Applicate e Sistemi Intelligenti "Eduardo Caianiello" - ISASI
Istituto Motori - IM - Sede Napoli
Network decontamination
graph searching
mobile agents
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/278025
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact