Opportunistic shortest path forwarding in delay tolerant networks

Abstract

Delay Tolerant Networks (DTNs) are characterized by probabilistic links formed among mobile nodes indicating their probabilistic encounters. Prior work on DTN routing uses expected delays as a routing metric to decide the next hop relay node for packet delivery to the destination. However, they measure the expected delays by taking the minimum of the expected delays over all possible paths from a candidate relay. This metric, denoted by MinEx, does not account for the opportunity gain enabled by having multiple paths to the destination through encountering multiple future neighbors. Since DTN routing uses as the relay the first encountered node satisfying given routing criteria, the random delays to multiple relay nodes should be aggregated. Thus, the true expected delays can be measured by taking the expectation of the minimum delays, denoted as ExMin, over all possible probabilistic paths from the candidate.