Probabilistic Delay Routing for Delay Tolerant Networks

With the fast development of wireless networks and wireless devices, the designing of effective routing algorithms considering intermittent connectivity and without end-to-end path is desirable. In this paper, we present a probabilistic delay routing (PDR) scheme that takes transmission delay, historical information of connection and prediction of future information of connection into consideration. Depending on two different historical information of connection, connected and unconnected, we deduce two prediction-functions correspondingly which can predict future information more precisely. Simulation results show that PDR scheme performs better in the aspects of delivery ratio and decreasing delay than other classical routing algorithms.