Adaptive Spray and Wait Routing Based on Relay-Probability of Node in DTN

DTN (Delay Tolerant Network) is a new type of mobile Ad Hoc network. Due to its characteristics such as long communication delay, high dynamic topology, it is difficult to maintain the stability of end to end paths. Therefore, design of effective and reliable routing algorithms has become the key issue in DTN. To avoid random and blindfold forwarding in Spray and Wait routing, a DTN routing algorithm named R-ASW (Relay-probability-based Adaptive Spay and Wait) has been proposed, R-ASW uses the performance of receiver nodes to determine whether forward message to the encounter node and calculate the number of message copies to be forwarded. This algorithm thought over synthetically the factors of node´s energy, delivery predictability and speed. NS2 network simulation software is used to analyze the validity and reliability of the proposed DTN routing algorithm. The simulation results show that the proposed algorithm has better performances and it is suitable for DTN.