Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search

Dobrev, Štefan; Flocchini, Paola; Santoro, Nicola

doi:10.1109/icdcs.2006.25

Cited by 11 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the existing work deals with the black hole search problem for a single black hole [9,10,15,16,17,18,19,20,21,22,23,27,32,33,34]. Some work has been done for multiple black holes in [8,35], although both of these papers use the synchronous model, as do some of the single black hole papers [9,10,33,34].…”

Section: Black Hole Search -A Classification Reviewmentioning

confidence: 99%

See 1 more Smart Citation

A Review of Computation Solutions by Mobile Agents in an Unsafe Environment

Zarrad¹,

Daadaa²

2013

IJACSA

View full text Add to dashboard Cite

Abstract-Exploration in an unsafe environment is one of the major problems that can be seen as a basic block for many distributed mobile protocols. In such environment we consider that either the nodes (hosts) or the agents can pose some danger to the network. Two cases are considered. In the first case, the dangerous node is a called black hole, a node where incoming agents are trapped, and the problem is for the agents to locate it. In the second case, the dangerous agent is a virus; an agent moving between nodes infecting them, and the problem is for the "good" agents to capture it, and decontaminate the network.In this paper, we present several solutions for a black-hole and network decontamination problems. Then, we analyze their efficiency. Efficiency is evaluated based on the complexity, and the effort is in the minimization of the number of simultaneous decontaminating elements active in the system while performing the decontamination techniques.

show abstract

Section: Black Hole Search -A Classification Reviewmentioning

confidence: 99%

“…In [15,20,21], Dobrev et al investigate the black hole search problem for two agents with a map and whiteboard searching for a single black hole. In [20], authors present a search protocol that improves the bounds from the worst case lower bound of agents moves to agents moves, where is the diameter of the network.…”

Section: B Synchronous Modelmentioning

confidence: 99%

A Review of Computation Solutions by Mobile Agents in an Unsafe Environment

Zarrad¹,

Daadaa²

2013

IJACSA

View full text Add to dashboard Cite

show abstract

“…A very simple algorithm that works on any topology (a-priori known by the agents) is shown in [27]. The algorithm, based on the pre-computation of an open vertex cover by cycles of the network, uses the optimal number of agents (two); its cost (number of moves) depends on the choice of the cover and it is optimal for several classes of networks.…”

Section: Impact Of Knowledgementioning

confidence: 99%

Distributed Security Algorithms by Mobile Agents

Flocchini

Santoro

2006

Distributed Computing and Networking

View full text Add to dashboard Cite

Abstract. Mobile Agents have been extensively studied for several years by researchers in Artificial Intelligence and in Software Engineering. They offer a simple and natural way to describe distributed settings where mobility is inherent, and an explicit and direct way to describe the entities of those settings, such as mobile code, software agents, viruses, robots, web crawlers, etc. Further, they allow to express immediately notions such as selfish behaviour, negotiation, cooperation, etc arising in the new computing environments. As a programming paradigm, they allow a new philosophy of protocol and software design, bound to have an impact as strong as that caused by that of object-oriented programming. As a computational paradigm, mobile agents systems are an immediate and natural extension of the traditional message-passing settings studied in distributed computing.In spite of all this, mobile agents systems have been largely ignored by the mainstream distributed computing community. It is only in the last few years that several researchers, some motivated by long investigated and well established problems in automata theory, computational complexity, and graph theory, have started to systematically explore this new and exciting distributed computational universe.In this paper we describe some interesting problems and solution techniques developed in this investigations.

show abstract

“…The computational issues related to the presence of a harmful agent have been explored in the context of intruder capture and network decontamination; in the case of harmful host, the focus has been on the black hole (BH), a node that disposes of any incoming agent without leaving any observable trace of this destruction [2,3,5,6,7,8,9,10,13]. In this paper, we continue the investigation of the black hole search problem.…”

Section: Introductionmentioning

confidence: 99%

“…The computability and complexity of BHS depend on a variety of factors, first and foremost on whether the system is asynchronous [5,6,7,8,9] or synchronous [2,4,3,13]. Indeed the nature of the problem changes drastically and dramatically.…”

Section: Introductionmentioning

confidence: 99%