173 search results - page 9 / 35 » A Geometric Routing Protocol in Disruption Tolerant Network |
189
click to vote
MOBIHOC
2001
ACM
16 years 6 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...
184
click to vote
GLOBECOM
2010
IEEE
15 years 4 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...
171
click to vote
SPAA
2005
ACM
16 years 4 days 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 ...
197
click to vote
MOBIHOC
2007
ACM
16 years 6 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...
136
click to vote
COMCOM
2000
15 years 6 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...