New predictability concept for routing in DTN

Recently, a great interest to routing concept in Delay Tolerant Networks has been increased notably. Deplorably, while several DTN routing protocols have been proposed, there are hardly any approaches which take as objective an attempt to improve such protocols. In this paper we focus on the predictability concept and present a new routing algorithm for DTN. We present a comparison to other existing DTN routing protocols such Spray & Wait, prophet, epidemic and maxprop. We prove through a various scale simulations, the efficiency in term of aborted transmissions and dropped messages between nodes, buffer time, and the hop count enhancement.