425 search results - page 23 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
HICSS
2003
IEEE
14 years 2 months ago
2003
IEEE
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
On-demand routing protocols use route caches to make routing decisions. Due to frequent topology changes, cached routes easily become stale. To address the cache staleness issue i...
ISCAPDCS
2007
13 years 10 months ago
2007
The coverage problem is of great interest for many sensor network applications, for example, detection of intruders in the sensor field. Topological changes in sensor networks ma...
KDD
2004
ACM
14 years 2 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
JPDC
2006
13 years 8 months ago
2006
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...