Adaptive Forwarding Scheme for Bounded Time Constraint in Delay Tolerant Networks

In parallel with lots of research to improve message delivery rate in Delay Tolerant Networks (DTN), additional application specific requirements are demanded to deploy them in the real world. Among many requirements, we focus on desired delivery ratio within required deadline in DTN. To achieve this, we propose an adaptive forwarding algorithm primarily based on well-known DTN algorithm, Spray and Wait. Unlike conventional static forwarding schemes, the number of message copies and forwarding algorithm are dynamically adjusted according to the difference between current service level and given requirement in the proposed scheme. Furthermore, analytical model and recorded history on a node are used sequentially depending on availability of parameters to meet application specific requirement. Finally, simulation results demonstrate that our proposed algorithm can meet given requirement with lower resources consumption than existing protocols in varying network conditions.