A Risk Taking Routing Algorithm for Delay Tolerant Networks

Delay Tolerant Networks (DTNs) suffer from frequent disruptions and partitioning. Because of dynamic environment and lack of knowledge about the whole network topology, routing is quiet challenging in DTNs. Prediction based algorithms in DTNs are able to predict nodes future contacts in the case where each node has a movement model. In this paper we are going to propose a risk taking routing algorithm, which differs from previous algorithms in predicting the future contacts and waiting for those nodes instead of forwarding to the currently in contact good forwarders. Considering the forwarding strategy as an online problem, we evaluate the algorithm using a risk reward competitive analysis. Simulation results show that our algorithm performs much better than PROPHET which is a base to our algorithm. The results also show that the optimum risk value is 2 which results in best performance.