85 search results - page 1 / 17 » Landmark-Based Routing in Dynamic Graphs |
WEA
2007
Springer
13 years 11 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...