63 search results - page 1 / 13 » Greedy Routing with Bounded Stretch |
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
ICCCN
2007
IEEE
13 years 6 months ago
2007
IEEE
—Geographic face routing provides an attractive way for packet delivery in wireless networks due to its high reliability and low overhead. A good face routing protocol should pro...
INFOCOM
2007
IEEE
13 years 11 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 ...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
ICNP
2007
IEEE
13 years 11 months ago
2007
IEEE
— We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing performance of existing geographic routing algori...