Message Deletion and Mobility Patterns for Efficient Message Delivery in DTNs

This paper discusses the efficient message deletion mechanism, which will be able to apply regardless of applied routing protocol, in DTNs (Delay Tolerant Networks). In order to achieve an acceptable quality of message delivery probability, we will need to allow the multiple message replicas in the system. In this context, the capability and capacity of store-carry-and-forward at the nodes is crucial. Since the mobile nodes´ storage capacity is not infinite, but is rather limited, an efficient resource management mechanism, i.e., message management algorithm, has to be applied. In this paper, we propose an approach, where we design the message deletion algorithm, while take into account the heuristic knowledge of actual human mobility. Through the preliminary numerical evaluation in this paper, we show that the proposed approach will achieve an effective network resource utilization and good/acceptable message delivery probability, while reducing the system overhead and the message delivery latency. We evaluate the system performance related to several key parameters. We found and showed that the introduction of message deletion mechanism into Epidemic, PRoPHET, and Spray and Wait routing algorithm could achieve better performance.