153 search results - page 2 / 31 » An experimental study of greedy routing algorithms |
IPPS
2010
IEEE
13 years 4 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...
SPAA
1994
ACM
13 years 10 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
MSWIM
2005
ACM
13 years 11 months ago
2005
ACM
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
MOBIHOC
2010
ACM
13 years 4 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
INFOCOM
2007
IEEE
14 years 17 days 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 ...