Meeting delay expect value in spray and forward routing algorithm

The existing DTN routing algorithms tend to make data transition inflexible and have a long delay in contact.To solve those problems,an algorithm was proposed which called meeting delay expect value in spray and forward routing algorithm for DTN（MDESF）.This algorithm will use mobile node's contact history to conduct the expected average contact/disconnect time and message expected wait value（EWV）.With those attributes the MDESF will proportionally distribute replicas of a message between two nodes in multiple replicas phase.A buffer management strategy was proposed in order to improve the success rate of imformation fornarded.The simulation results illustrate that the proposed MDESF protocol outperform other existing ones.