Performance Analysis of the Well-Known DTN Routing Protocols

Delay /disruption-tolerant networks (DTNs) are described by an absence of persistent paths between nodes because of roaming of nodes, constrained information storage capacity of a few or the greater part of its nodes. To beat the successive separations, and obliged energy resources, the nodes in DTNs are demanding to carry and hold on information bundles until they get close to different nodes. Storing of this information might take a long time. Additionally, to build up the delivery likelihood, they spread numerous duplicates of a similar bundle through the network in order to be ensure that one of these copies will arrive to its final recipient. Due to, the constrained power sources and restricted storage of numerous hubs in this environment, so there is a big tradeoff between expanding the packet Delivery Ratio and storage capacity utilization. Therefore, this thesis concentrates the routing issue in DTNs with constrained resources and limited storage and study the performance of five well-know DTN routing protocols such as, MaxProp, PROPHET, Spray and Wait, Epidemic and Social Group-based Routing (SGBR). Additionally, we modified SGBR protocol by reformulating the main equation to maximize the packet Delivery Ratio while reducing network overhead. Next, we compare the protocol that we modified with current famous DTNs routing protocols using the ONE simulator. The simulation results demonstrate that the SGBR_V2 protocol realizes a better Delivery Ratios and lower levels in terms of the network Overhead Ratio contrasted with the original SGBR protocol when the traffic load is high.