Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

COCOA

2010

Springer

2010

Springer

In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. The black-hole search problem is the task of a team of k > 1 mobile entities, starting from the same safe location and executing the same algorithm, to determine within finite time the location of the black hole. In this paper we consider the black hole search problem in asynchronous ring networks of n nodes, and focus on the time complexity. It is known that any algorithm for black-hole search in a ring requires at least 2(n - 2) time in the worst case. The best algorithm achieves this bound with a team of n - 1 agents with an average time cost 2(n - 2), equal to the worst case. In this paper we first show how the same number of agents using 2 extra time units from optimal in the worst case, can solve the problem in only 7 4 n - O(1) time on the average. We then prove that the optimal average case complexit...

Related Content

Added |
10 Feb 2011 |

Updated |
10 Feb 2011 |

Type |
Journal |

Year |
2010 |

Where |
COCOA |

Authors |
Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro |

Comments (0)