48 search results - page 7 / 10 » Moving Network Voronoi Diagram |
COMPGEOM
2004
ACM
14 years 28 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
ICNP
2003
IEEE
14 years 23 days ago
2003
IEEE
Abstract—In the paper, we devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the...
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...