A Message Forwarding Scheme with Some Incentive and Minimum Number of Hops in Delay Tolerant Networks

Delay tolerant networks got more attraction due to its property of enabling communication where no end to end connectivity exist between nodes, by storing data to the storage till the connectivity does not exist. Now a days we can not survive without mobile devices in our life for sharing data and we cannot compromise with the forwarding data. İf connection not exist between nodes there will be no communication between them. DTNs enable communication in this type of networks. Traditional protocols for routing can not be applied in DTNs, many protocols have been proposed for DTN but performance is not good in terms of delivery ratio with minimum delay. In this study, we proposed a message forwarding scheme in DTNs to improve the message delivery ratio and minimum hop count with minimum delay by selecting node that have higher encounters and farthest from source with giving incentive to the forwarder node. We simulate the environment in ONE simulator and compare the algorithm with existing routing protocols and find that proposed algorithm improves the performance in terms of delivery ratio and latency.