ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks

Abstract

Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes' probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes' intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet.