DTN routing (CDPR) algorithm based on contact and deliver probability

In Delay-tolerant networks (DTNs), it is difficult to select the best next hop for a relay node with the help of its contact information. In this paper, we combine history contact information of a node with its delivery successfully probability to deliver data to the destination, and apply the Binomial distribution to predict the future largest possible number of successful delivery of the nodes. In addition, we also provide a polynomial time algorithm to describe the procedure of the proposed routing algorithm and prove it´s correctness.