NDLI: Mobile Search for a Black Hole in an Anonymous Ring

Content Provider	Springer Nature Link
Author	Dobrev, Stefan Flocchini, Paola Prencipe, Giuseppe Santoro, Nicola
Copyright Year	2007
Abstract	In this paper we address the problem of mobile agents searching for a highly harmful item (called a black hole) in a ring network. The black hole is a stationary process that destroys visiting agents upon their arrival without leaving any observable trace of such a destruction. The task is to have at least one surviving agent able to unambiguously report the location of the black hole. We consider different scenarios and in each situation we answer some computational as well as complexity questions. We first consider agents that start from the same home base (co-located). We prove that two such agents are necessary and sufficient to locate the black hole; in our algorithm the agents perform O(n log n) moves (where n is the size of the ring) and we show that such a bound is optimal. We also consider time complexity and show how to achieve the optimal bound of 2n - 4 units of time using n - 1 agents. We generalize our technique to establish a trade-off between time and number of agents. We then consider the case of agents that start from different home bases (dispersed) and we show that if the ring is oriented, two dispersed agents are still necessary and sufficient. Also in this case our algorithm is optimal in terms of number of moves (Θ(n log n)). We finally show that if the ring is unoriented, three agents are necessary and sufficient; an optimal algorithm follows from the oriented case.
Starting Page	67
Ending Page	90
Page Count	24
File Format	PDF
ISSN	01784617
Journal	Algorithmica
Volume Number	48
Issue Number	1
e-ISSN	14320541
Language	English
Publisher	Springer-Verlag
Publisher Date	2007-02-09
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Algorithm Analysis and Problem Complexity Theory of Computation Mathematics of Computing Algorithms Computer Systems Organization and Communication Networks Data Structures, Cryptology and Information Theory
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Anonymous Meeting in Networks

Black-Box Search by Unbiased Variation

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles

Ranking-Based Black-Box Complexity

On Nonlinear Parametric Search

Theory of Randomized Search Heuristics

Optimal Search and One-Way Trading Online Algorithms

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

Biased Predecessor Search

Mobile Search for a Black Hole in an Anonymous Ring

Similar Documents

Anonymous Meeting in Networks

Black-Box Search by Unbiased Variation

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles

Ranking-Based Black-Box Complexity

On Nonlinear Parametric Search

Theory of Randomized Search Heuristics

Optimal Search and One-Way Trading Online Algorithms

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

Biased Predecessor Search

Mobile Search for a Black Hole in an Anonymous Ring