An Efficient Probabilistic Routing Algorithm Based on Limiting The Number of Replications

Opportunistic network is one of the most interesting evolutions of MANETs. In opportunistic network, the frequent disconnection of nodes is very common. This is a huge challenge for an efficient routing protocol. Several routing protocols have been proposed but there are performance limitations such as the high overhead, the high delivery latency, and the low delivery rate. In order to solve those problems, we propose an efficient probabilistic routing algorithm based on limiting the number of replications (PRoPHET-L). Which considers the history of encounters to predict the meeting probability between two nodes and limits the number of replications to reduce overhead in the network. The proposed routing protocol is compared with other routing protocols. The obtained results indicate that PRoPHET-L can efficiently improve the delivery rate, the overhead ratio, and the delivery delay.