266 search results - page 1 / 54 » Distributed Routing in Tree Networks with Few Landmarks |
CAAN
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
INFOCOM
2006
IEEE
14 years 1 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...
GSN
2009
Springer
13 years 11 months ago
2009
Springer
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
VTC
2008
IEEE
14 years 1 months ago
2008
IEEE
—In this paper, we introduce a routing solution called “Landmark Overlays for Urban Vehicular Routing Environments” (LOUVRE), an approach that efficiently builds a landmark ...