Sciweavers

2294 search results - page 308 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
IPPS
2008
IEEE
15 years 9 months ago
On performance bottleneck of anonymous communication networks
Although a significant amount of effort has been directed at discovering attacks against anonymity communication networks and developing countermeasures to those attacks, there i...
Ryan Pries, Wei Yu, Steve Graham, Xinwen Fu
ESORICS
2004
Springer
15 years 7 months ago
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks
Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor dep...
Seyit Ahmet Çamtepe, Bülent Yener
INFOCOM
1999
IEEE
15 years 6 months ago
A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks
We present, prove correctness for, and evaluate a protocol for the reliable broadcast of topology and link-state information in a multihop communication network with a dynamic topo...
Bhargav R. Bellur, Richard G. Ogier
109
Voted
USITS
2001
15 years 3 months ago
Nettimer: A Tool for Measuring Bottleneck Link Bandwidth
Measuring the bottleneck link bandwidth along a path is important for understanding the performance of many Internet applications. Existing tools to measure bottleneck bandwidth a...
Kevin Lai, Mary Baker
111
Voted
TSMC
1998
169views more  TSMC 1998»
15 years 2 months ago
Real-time map building and navigation for autonomous robots in unknown environments
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...
Giuseppe Oriolo, Giovanni Ulivi, Marilena Venditte...