63 search results - page 6 / 13 » Greedy Routing with Bounded Stretch |
134
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
174
click to vote
ICDCS
2008
IEEE
16 years 7 days ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
171
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
191
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
203
click to vote
SENSYS
2010
ACM
15 years 3 months ago
2010
ACM
Geographic routing is of interest for sensor networks because a point-to-point primitive is an important building block for data-centric applications. While there is a significant...