Sciweavers

736 search results - page 87 / 148
» Approximating the Number of Network Motifs
Sort
View
ALGOSENSORS
2004
Springer
15 years 3 months ago
The Expected Uncertainty of Range Free Localization Protocols in Sensor Networks
We consider three range-free localization protocols for sensor networks and analyze their accuracy in terms of the expected area of uncertainty of position per sensor. Assuming a ...
Gideon Stupp, Moshe Sidi
HICSS
2003
IEEE
108views Biometrics» more  HICSS 2003»
15 years 3 months ago
Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks
In this paper, we propose some improvements to the flooding protocols that aim to efficiently broadcast a given information through the whole ad-hoc network. These improvements ...
Julien Cartigny, David Simplot
ICPPW
2002
IEEE
15 years 2 months ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
OPODIS
2004
14 years 11 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...
JCO
2006
150views more  JCO 2006»
14 years 10 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson