Spray and Wait Routing Based on Relay-Probability in DTN

Due to the blindness in choices of relay nodes,a DTN routing algorithm named R-SW(spray and wait routing based on relay-probability) was proposed.In the stage of relay node selection,the probability of packet forwarding and the number of packet copies were under control.If the forwarding probability of a relay node was greater than the current node,packet forwarding would be permitted.Therefore,nodes with larger forwarding probability could carry more packets to avoid causing poor performance in transmission delay and packet delivery ratio.Furthermore,with congestion control,NS2 network simulation software was used to analyze the validity and reliability of the proposed DTN routing algorithm.Simulation results showed that the proposed algorithm could decrease routing overhead and transmission delay,and it could also improve packet delivery ratio,which is suitable for DTN.