Abstract: Due to its characteristics such as long communication delay, high dynamic topology, sparse distribution of nodes and frequent link break, a DTN routing algorithm with the mechanism of "storage-carry-forward" was proposed. Source nodes do not establish a complete route to destination nodes to send data packets. However, they just choose relay nodes which can carry data to destination nodes with larger probilities in their neighborhood. Under this circumstance, the relay node receives packets, stores them and then finds the destination or a better relay node to forward packets. Through hop-by-hop storage-carry-forward strategy, packet will finally arrive at the destination nodes. In the storage-carry-forward process, routs are constructed by considering the characteristics of the DTN. Although DTN topology is frequently changing, nodes within local area may be strongly connected in a short time and thus can provide a path from source or relay nodes to destination or better relay nodes. Ad hoc network routing strategies are used to improve the network performance. NS2 network simulation software is used to analyze the validity and reliability of the proposed DTN routing algorithm. Simulation results show that the proposed algorithm has better performances and it is suitable for DTN applications.