E-PRAN: Enhanced prophet routing algorithm in delay tolerant networks

Abstract

Delay tolerant networks(DTN) belong to a category of SHIP (Sparse,Hybrid, Intermittent,Partitioned) networks where aim is to deliver a message with acceptable delay. In the literature of DTN, many routing protocols exist that aim to determine the optimized path from source to Destination Node(DN). One of the most commonly used algorithm is Prophet Routing Protocol (PRP). Prophet routing protocol maintains a set of delivery probabilities corresponding to every node in DTN. It exploits the opportunistic contact for message delivery. The PRP does not consider factors such as encountered node available buffer space, energy level of battery and delivery predictability of encountered node to destination node. In the proposed work, an improvised version of PRP is suggested that not only consider these factors but as a part of current research work, a new factor named as virtual credibility (VC) has been proposed. All these factors collectively results in the increase in MDR and reduced message overhead in the network.