Sciweavers

Share
CORR
2011
Springer
536views Education» more  CORR 2011»
8 years 9 months ago
Performance Analysis of AODV under Black Hole Attack through Use of OPNET Simulator
— Mobile ad hoc networks (MANETs) are dynamic wireless networks without any infrastructure. These networks are weak against many types of attacks. One of these attacks is the bla...
H. A. Esmaili, M. R. Khalili Shoja, Hossein Gharae...
COCOA
2010
Springer
9 years 9 days ago
Time Optimal Algorithms for Black Hole Search in Rings
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. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
SCHOLARPEDIA
2008
187views more  SCHOLARPEDIA 2008»
9 years 1 months ago
Bekenstein-Hawking entropy
We demonstrate how Sakharov's idea of induced gravity allows one to explain the statistical-mechanical origin of the entropy of a black hole. According to this idea, gravity b...
Jacob Bekenstein
NETWORKS
2006
9 years 2 months ago
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 de...
Stefan Dobrev, Paola Flocchini, Rastislav Kralovic...
JNW
2008
153views more  JNW 2008»
9 years 2 months ago
Prevention of Co-operative Black Hole Attack in MANET
Latha Tamilselvan, V. Sankaranarayanan
OPODIS
2003
9 years 3 months ago
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
SIROCCO
2004
9 years 3 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
OPODIS
2004
9 years 3 months ago
Searching for a Black Hole in Tree Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
MCU
2004
141views Hardware» more  MCU 2004»
9 years 3 months ago
Abstract Geometrical Computation for Black Hole Computation
geometrical computation for Black hole computation d abstract) J
Jérôme Durand-Lose
FGCN
2007
IEEE
173views Communications» more  FGCN 2007»
9 years 4 months ago
Preventing Cooperative Black Hole Attacks in Mobile Ad Hoc Networks: Simulation Implementation and Evaluation
A black hole attack is a severe attack that can be easily employed against routing in mobile ad hoc networks. A black hole is a malicious node that falsely replies for any route r...
Hesiri Weerasinghe, Huirong Fu
books