An optimal joint scheduling and drop policy for Delay Tolerant Networks

Abstract

Delay tolerant networks (DTN) are wireless networks where disconnections may occur frequently. In order to achieve data delivery in DTNs, researchers have proposed the use of store-carry-and-forward protocols: there, a node may store a message in its buffer and carry it along for long periods of time, until an appropriate forwarding opportunity arises. Multiple message replicas are often propagated to increase delivery probability. This combination of long-term storage and replication imposes a high storage and bandwidth overhead. Thus, efficient scheduling and drop policies are necessary to: (i) decide on the order by which messages should be replicated when contact durations are limited, and (ii) which messages should be discarded when nodespsila buffers operate close to their capacity. In this paper, we propose an efficient joint scheduling and drop policy that can optimize different performance metrics, like average delay and delivery probability. Using the theory of encounter-based message dissemination, we first propose an optimal policy based on global knowledge about the network. Then, we introduce a distributed algorithm that can approximate the performance of the optimal algorithm, in practice. Using simulations based on a synthetic mobility model and a real mobility trace, we show that our optimal policy and its distributed variant outperform existing resource allocation schemes for DTNs, such as the RAPID protocol [4], both in terms of average delivery ratio and delivery delay.