85 search results - page 16 / 17 » Landmark-Based Routing in Dynamic Graphs |
HICSS
2000
IEEE
15 years 2 months ago
2000
IEEE
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...
109
click to vote
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
— We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a si...
SPAA
1997
ACM
15 years 2 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
DEXA
2010
Springer
14 years 10 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
114
click to vote
MOBICOM
2010
ACM
14 years 10 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...