173 search results - page 9 / 35 » A Geometric Routing Protocol in Disruption Tolerant Network |
111
click to vote
MOBIHOC
2001
ACM
15 years 11 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
104
click to vote
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
One challenge in delay tolerant networks (DTNs) is efficient routing, as the lack of contemporaneous end-to-end paths makes conventional routing schemes inapplicable. Many existing...
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
MOBIHOC
2007
ACM
15 years 11 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
COMCOM
2000
14 years 11 months ago
2000
We proposea simple distance-vectorprotocolfor routingin networkshavingunidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in...