Mobility

Efficient Implementation of Conditional Shortest Path Routing in Delay Tolerant Networks

Free registration required

Executive Summary

Routing in Delay Tolerant Networks (DTN) is a challenging problem because at any given time instance, the probability that there is an end-to-end path from a source to a destination is low. Since the routing algorithms for conventional networks assume that the links between nodes are stable most of the time and do not fail frequently, they do not generally work in DTN's. Therefore, the routing problem is still an active research area in DTN's To realize the DTN vision, routes must be found over multiple unreliable, intermittently-connected hops.

  • Format: PDF
  • Size: 1202 KB