Black hole search in common interconnection networks

Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that destroys incoming agents without leaving any trace. To determine the location of such a harmful host is a dangerous but cru...

Full description

Saved in:
Bibliographic Details
Published in:Networks Vol. 47; no. 2; pp. 61 - 71
Main Authors: Dobrev, S., Flocchini, P., Královič, R., Ružička, P., Prencipe, G., Santoro, N.
Format: Journal Article
Language:English
Published: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.03.2006
John Wiley & Sons
Subjects:
anonymous networks
Applied sciences
biconnected graphs
Computer science; control theory; systems
Computer systems and distributed systems. User interface
distributed mobile computing
distributed search
Exact sciences and technology
interconnection networks
malicious host
mobile agents
Software
traversal pair
Information system
Mobility
Connected graph
malicious host
interconnection networks
Distributed computing
biconnected graphs
Black hole
anonymous networks
mobile agents
traversal pair
Mobile agent
Localization
Computer security
Cycle(graph)
distributed mobile computing
distributed search
Anonymity
Information retrieval
Distributed system
Topology
Multiagent system
Multidimensional database
Cube
Ring
Hypercube
Telecommunication network
Wireless network
Mobile computing
ISSN:0028-3045, 1097-0037
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that destroys incoming agents without leaving any trace. To determine the location of such a harmful host is a dangerous but crucial task, called black hole search. The most important parameter for a solution strategy is the number of agents it requires (the size); the other parameter of interest is the total number of moves performed by the agents (the cost). It is known that at least two agents are needed; furthermore, with full topological knowledge, Ω(n log n) moves are required in arbitrary networks. The natural question is whether, in specific networks, it is possible to obtain (topology‐dependent but) more cost efficient solutions. It is known that this is not the case for rings. In this article, we show that this negative result does not generalizes. In fact, we present a general strategy that allows two agents to locate the black hole with O(n) moves in common interconnection networks: hypercubes, cube‐connected cycles, star graphs, wrapped butterflies, chordal rings, as well as in multidimensional meshes and tori of restricted diameter. These results hold even if the networks are anonymous. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(2), 61–71 2006
Bibliography:Natural Sciences and Engineering Research Council of Canada
ArticleID:NET20095
istex:3A2B8016778676A8D2386B3847760FC13CE70E13
Slovak Research and Development Support Agency (Slovak Republic) - No. APVT-20-018902
Progetto ALINWEB: Algoritmica per Internet e per Web, MIUR: Programmi di Ricerca Scientifica di Rilevante Interesse Nazionale
ark:/67375/WNG-PL2N7V17-Z
ISSN:0028-3045
1097-0037
DOI:10.1002/net.20095