Abstract:

In order to reduce the waste of network resources caused by multiple copies routing in delay tolerant networks (DTN), a routing algorithm based on probability gradient and fresh gradient (PFG) is proposed. In the algorithm, the historical track of the destination node and the coverage potential field of the destination node are established with probability gradient and fresh gradient. When the two nodes meet, the message will be sent to the node which is much fresher and with higher probability to the destination node, it means that more waste of network resources can be avoided. Simulations show that the PFG can efficiently reduce data copies in network under the same message delivery rate and message average delivery delay, and hence improve the system performance.

Key words: delay tolerant networks, probability routing, local connected network, gradient