Extension of Delay Tolerant Network's Routing Protocols for Preventing Excessive Utilization of Resources

The routing algorithms of DTN have the inbuilt storage management scheme such as Hop based TTL (Spray and Wait) or passive cure (Potential-based Entropy Adaptive Routing PEAR). There has been a significant amount of work in the past regarding buffer management policies. In this paper, we have proposed a new message deletion policy for multi-copy routing schemes. In this scheme, message delivery information is communicated to the other nodes in the network for removing useless bundles from the network, which prevents the nodes from the buffer overflow problem and avoid transfer of useless message replicas thus relaxing the resources of the nodes. We evaluate our proposed method by simulating network, on four major DTNs routing algorithms: Epidemic, Spray and Wait, ProPHET and MaxProp. The simulation results clearly show significant improvement in the value of delivery probability and the overhead ratio for an Epidemic, Spray and Wait, and Prophet routing protocols.