Efficient probabilistic routing in delay tolerant networks

This paper addresses the problem of routing in delay tolerant networks (DTNs). Normally, one of the most fundamental requirements in delay tolerant networks is to find a communication path between nodes in a sparse network and partitioned into several zones, in this case, communication between zones of the network depends only on the displacement of certain nodes between zones and as the delivery of messages depends on the mobility of nodes, it is very difficult to obtain information on the dynamics of the network and routing becomes an important issue. With the aim of reducing the delay from End to End and minimize the resources consumed in the network, we propose a routing approach which is to improve the PROPHET routing protocol based on two routing metrics: History contact between the mobile nodes and the frequency of visiting different zones of the network. To implement our approach, we developed a DTN simulator according to the delay tolerant networks architecture.