PRoPHET Routing Protocol Based on Neighbor Node Distance Using a Community Mobility Model in Delay Tolerant Networks

Abstract

In a Delay Tolerant Network (DTN), the Probabilistic Routing Protocol using the History of Encounters and Transitivity (PRoPHET) routing protocol mainly uses the delivery predictability of node encounters and transitivity to select and forward bundles to the desired neighbor nodes regardless of their distance. This concept introduces a delivery dilemma and the drawbacks of a low delivery ratio, high delay, and overhead when two or more neighbor nodes carry equal delivery predictability when the distance from these nodes to the source node varies from high node mobility. To solve these problems, we propose the use of the Distance-based PRoPHET (DiPRoPHET), a modified version of the traditional PRoPHET, along with the use of a DTN cross-layer implementation for distance value retrieval. We also conducted a simulation between the proposed protocol and a traditional protocol using both random and community models. The simulation results show that, by adding a distance metric to the existing PRoPHET delivery predictability vector, the bundle delivery ratio is increased, in contrast, the bundle delay and overhead are decreased during delivery dilemmas regarding the node to be selected as a message forwarder.