DFCT: A New Data Forwarding Algorithm Based on Cumulative Performance and Transient Performance in DTNs

Abstract

Delay Tolerant Networks (DTNs) are lack of end-to-end links. In order to overcome the frequent link interrupt, DTNs are often the store-carry-forwarding mechanism. Most routing forwarding algorithm only consider cumulative contact situation between network node and destination node, but in DTNs the frequent change of network topology can cause a lot of transient contact situation between network node and destination node. In order to make the fullest use of these transient contact situations, this paper proposes a new data forwarding algorithm based on cumulative performance and transient performance. It combines the cumulative performance and transient conditions between network node and destination node. We can choose a better relay node, so as to more efiectively improve the network performance. Then we use a realistic trace flle for simulation experiment, and compared with the two classic routing algorithms of Epidemic and Label. The experimental results show that the proposed algorithm can obviously reduce the network overhead compared with Epidemic algorithm and Label algorithm, and is close to the maximum delivery rate obtained by Epidemic algorithm.