Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents

2020 ◽  
pp. 220-236
Author(s):  
Nikos Giachoudis ◽  
Maria Kokkou ◽  
Euripides Markou
Keyword(s):  
Mobile Agents ◽  
Ring Networks

Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks

2012 ◽  
pp. 303-314 ◽  
Author(s):  
Shinji Kawai ◽  
Fukuhito Ooshita ◽  
Hirotsugu Kakugawa ◽  
Toshimitsu Masuzawa
Keyword(s):  
Mobile Agents ◽  
Ring Networks

Randomized Gathering of Mobile Agents in Anonymous Unidirectional Ring Networks

2014 ◽  
Vol 25 (5) ◽  
pp. 1289-1296 ◽  
Author(s):  
Fukuhito Ooshita ◽  
Shinji Kawai ◽  
Hirotsugu Kakugawa ◽  
Toshimitsu Masuzawa
Keyword(s):  
Mobile Agents ◽  
Ring Networks

scholarly journals DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS

2007 ◽  
Vol 18 (03) ◽  
pp. 547-563 ◽  
Author(s):  
PAOLA FLOCCHINI ◽  
MIAO JUN HUANG ◽  
FLAMINIA L. LUCCIO
Keyword(s):  
Lower Bounds ◽  
Local Knowledge ◽  
Mobile Agents ◽  
Time Complexity ◽  
Optimal Strategies ◽  
The Other ◽  
Ring Networks ◽  
Complexity Measures ◽  
Minimum Number ◽  
Chordal Ring

In this paper we consider a network where an intruder is moving "contaminating" the nodes it passes by, and we focus on the problem of decontaminating such a network by a team of mobile agents. The contamination/decontamination process has the following asynchronous dynamics: when the team is deployed all nodes are assumed to be contaminated, when an agent transits on a node, it will clean the node, when the node is left with no agent, the node will be recontaminated as soon as at least one of its neighbours is contaminated. We study the problem in asynchronous chordal ring networks and in tori. We consider two variations of the model: one where agents have only local knowledge, the other in which they have "visibility", i.e., they can "see" the state of their neighbouring nodes. We first derive lower bounds on the minimum number of agents necessary for the decontamination. In the case of chordal rings we show that the number of agents necessary to perform the cleaning does not depend on the size of the network; in fact it is linear in the length of the longest chord (provided that it is not too long). In the case of a torus, the minimum number of agents is equal to 2 · h, where h is the smallest dimension. We then propose optimal strategies for decontamination and we analyse the number of moves and the time complexity of the decontamination algorithms, showing that the visibility assumption allows us to decrease substantially both complexity measures. Another advantage of the "visibility model" is that agents move independently and autonomously without requiring any coordination.

Symmetric degree-four chordal ring networks

1990 ◽  
Vol 137 (4) ◽  
pp. 310 ◽  
Author(s):  
R.F. Browne ◽  
R.M. Hodgson
Keyword(s):  
Ring Networks ◽  
Chordal Ring

FUNCTIONAL COORDINATION OF METHODS OF ORGANIZATION OF ADAPTIVE DATA COLLECTION PROCESSES AND METHODS OF SPATIAL SELF-ORGANIZATION OF MOBILE AGENTS

2017 ◽  
Vol 2 (1) ◽  
pp. 27-32
Author(s):  
Botchkaryov. A. ◽  
Keyword(s):  
Data Collection ◽  
Key Words ◽  
Motion Control ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Parallel Execution ◽  
Self Organization ◽  
Data Collection Process ◽  
Speed Up ◽  
Adaptive Data Collection

The way of functional coordination of methods of organization adaptive data collection processes and methods of spatial self-organization of mobile agents by parallel execution of the corresponding data collection processes and the process of motion control of a mobile agent using the proposed protocol of their interaction and the algorithm of parallel execution planning is proposed. The method allows to speed up the calculations in the decision block of the mobile agent by an average of 40.6%. Key words: functional coordination, adaptive data collection process, spatial self-organization, mobile agents

Sign in / Sign up

Export Citation Format

Share Document