Network Decontamination with Temporal Immunity by Cellular Automata

Daadaa, Yassine; Flocchini, Paola; Zaguia, Nejib

doi:10.1007/978-3-642-15979-4_31

Cited by 12 publications

(29 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Cada uma das regras com seu tempo de imunidade associado foram provados óti-mos para descontaminar as suas respectivas CIs, neste trabalho estas CIs são as CIs de referência. Para provar ótimos a regra e o tempo de imunidade foram assumidas premissas rígidas, permitindo provar os teoremas enunciados (Daadaa, 2012).…”

Section: O Problema De Descontaminação De Rede Bidimensional E a Eficunclassified

“…Descontaminação básica ótima pode ser obtida em um autômato celular finito de duas dimensões e vizinhança de von Neumann, usando n células simultâneas no estado descontaminando (Daadaa, 2012).…”

Section: Teorema 41unclassified

“…Descrevem-se aqui resultados obtidos ao medir a eficácia de regras dos autômatos celulares definidos por Daadaa (2012), regras estas capazes de descontaminar reticulados bidimensionais com condições iniciais pré-definidas. Com premissas rígidas para as regras e condições iniciais (CI) foi possível provar teoremas de que as regras são ótimas para descontaminar as CIs previstas.…”

Section: Introductionunclassified

“…

Abstract − Here we expand the limits imposed by Daadaa (2012) about the decontamination process of the lattice of a twodimensional cellular automaton, by understanding the characteristics of the rules proposed therein. It was possible to identify two general rules for each type of neighborhood addressed, and to show that they outperform those by Daadda (2012), in terms of their efficacy on a set of randomly distributed initial configurations.

Keywords − Cellular automaton, network decontamination, discrete dynamical system, two-dimensional neighbourhoods.

Resumo − Expandem-se aqui os limites impostos por Daadaa (2012) a respeito do processo de descontaminação do reticulado de um autômato celular bidimensional, a partir de um maior entendimento das características das regras lá propostas.

…”

mentioning

confidence: 99%

“…Abstract − Here we expand the limits imposed by Daadaa (2012) about the decontamination process of the lattice of a twodimensional cellular automaton, by understanding the characteristics of the rules proposed therein. It was possible to identify two general rules for each type of neighborhood addressed, and to show that they outperform those by Daadda (2012), in terms of their efficacy on a set of randomly distributed initial configurations.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Generalização de estratégias de descontaminação de reticulados de autômatos celulares

Nogueira¹,

Oliveira²

2013

Proceeding Series of the Brazilian Society of Computational and Applied Mathematics

View full text Add to dashboard Cite

− Here we expand the limits imposed by Daadaa (2012) about the decontamination process of the lattice of a twodimensional cellular automaton, by understanding the characteristics of the rules proposed therein. It was possible to identify two general rules for each type of neighborhood addressed, and to show that they outperform those by Daadda (2012), in terms of their efficacy on a set of randomly distributed initial configurations.Keywords − Cellular automaton, network decontamination, discrete dynamical system, two-dimensional neighbourhoods.Resumo − Expandem-se aqui os limites impostos por Daadaa (2012) a respeito do processo de descontaminação do reticulado de um autômato celular bidimensional, a partir de um maior entendimento das características das regras lá propostas. Foi possível identificar duas regras gerais para cada tipo de vizinhança utilizado, e mostrar que, para condições iniciais aleatórias, tais regras possuem eficácia superior que as definidas por Daadaa (2012).Palavras-chave − Autômato celular, descontaminação de rede, sistema dinâmico discreto, vizinhança bidimensional.

show abstract

Section: O Problema De Descontaminação De Rede Bidimensional E a Eficunclassified

Section: Teorema 41unclassified

Section: Introductionunclassified

“…

Keywords − Cellular automaton, network decontamination, discrete dynamical system, two-dimensional neighbourhoods.

…”

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Generalização de estratégias de descontaminação de reticulados de autômatos celulares

Nogueira¹,

Oliveira²

2013

Proceeding Series of the Brazilian Society of Computational and Applied Mathematics

View full text Add to dashboard Cite

show abstract

Network Decontamination

Nisse

2019

Distributed Computing by Mobile Entities

View full text Add to dashboard Cite

The Network Decontamination problem consists in coordinating a team of mobile agents in order to clean a contaminated network. The problem is actually equivalent to tracking and capturing an invisible and arbitrarily fast fugitive. This problem has natural applications in network security in computer science or in robotics for search or pursuitevasion missions. Many different objectives have been studied: the main one being the minimization of the number of mobile agents necessary to clean a contaminated network. Many environments (continuous or discrete) have also been considered. In this Chapter, we focus on networks modeled by graphs. In this context, the optimization problem that consists in minimizing the number of agents has a deep graph-theoretical interpretation. Network decontamination and, more precisely, graph searching models, provide nice algorithmic interpretations of fundamental concepts in the Graph Minors theory by Robertson and Seymour. For all these reasons, graph searching variants have been widely studied since their introduction by Breish (1967) and mathematical formalizations by and Petrov (1982). This chapter consists of an overview of algorithmic results on graph decontamination and graph searching.

show abstract

On-line Search in Two-Dimensional Environment

Dereniowski

Urbańska

2018

Approximation and Online Algorithms

View full text Add to dashboard Cite

Network Decontamination with Temporal Immunity by Cellular Automata

Cited by 12 publications

References 9 publications

Generalização de estratégias de descontaminação de reticulados de autômatos celulares

Generalização de estratégias de descontaminação de reticulados de autômatos celulares

Network Decontamination

On-line Search in Two-Dimensional Environment

Contact Info

Product

Resources

About