70 search results - page 11 / 14 » On the connectivity of dynamic random geometric graphs |
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
MSWIM
2004
ACM
14 years 3 months ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
SIGMETRICS
2008
ACM
13 years 9 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
TNN
2010
13 years 4 months ago
2010
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
ICRA
2000
IEEE
14 years 2 months ago
2000
IEEE
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...