Distance-based PRoPHET routing protocol in Disruption Tolerant Network

PRoPHET routing protocol in DTN uses its delivery predictability of node encounters and transitivity to select and forward bundles to its neighbor node regardless of their distance. This concept faces delivery dilemmas in a source node and drawbacks of low delivery ratio and high delay in case two or more neighbor nodes carry equal delivery predictability and the distance between those nodes to the source node varies due to high node mobility. To deal with such consequences, we propose a Distance-based Probabilistic Routing Protocol using History of Encounters and Transitivity (DiPRoPHET), a modified version of traditional PRoPHET, with the use of cross layer implementation for distance value retrieval. Additionally, in this paper, we also simulate and evaluate between the proposed protocol and the traditional one. Simulation results of both protocols show that, by adding distance metric to existing delivery predictability vector of PRoPHET, bundle delivery ratio is increased; in contrast, the bundle delay is decreased during delivery dilemmas over which node to be selected as a forwarder of messages.