Probabilistic Routing Algorithm in Delay Tolerant Network Based on Node Similarity

Abstract

In Delay Tolerant Network(DTN),due to the frequent network partitions caused by sparse node density and node mobility,there is not always a connected end-to-end path in the process of message delivery.Thus,the routing algorithms in DTN generally adopt a store,carry and forward mechanism so as to deliver a message from a source to a destination.For the above problems,a Similarity-based Probabilistic Routing(SBPR) algorithm is proposed,which combines the concept of node similarity with the delivery probability to the destination during the messages’ Time to Live(TTL).Both message replication and message forwarding strategies are adopted in SBPR.Concretely,on one hand,when a node holding messages encounters other nodes,it replicates the message to the neighboring node which has a smaller inter-node similarity,so as to increase the message delivery ratio.On the other hand,if a neighboring node has a larger node similarity and delivery probability to the destination node,it forwards the message to this neighboring node for the purpose of saving the network resource consumption.Expermental result shows that the proposed SBPR outperforms Epidemic,Prophet and First Contact(FC) routing algorithms in terms of delivery ratio,network overhead ratio and message dropping ratio in the case of insufficient node buffer.