Research On Routing Of Delay Tolerant Network

Delay-Tolerant Network (DTN) is a kind of new network, which characterized with high link delays, intermittent connectivity and limited node resources, there is no continuously available connection between source and destination to support end-to-end interaction. The standard Internet suite of protocol TCP/IP because of the special nature of DTN no longer apply; the mobile Ad Hoc networks characterized with dynamic topology, its routing technology but also because a large latency, intermittent connectivity can not be used in DTN. Therefore, we need to study the routing technology for DTN. In this paper, firstly we discuss state-of-the-art architecture and characteristics of DTN. Secondly, we analyze the performance of the TCP/IP and Ad Hoc routing protocol applied in DTN. Thirdly, we also discuss the IRTF proposed DTN network solutions and analyze some DTN routing algorithms. In this paper, a novel routing algorithm for DTN-Scheduling Based Routing (SBR) is proposed. SBR based on predictable links contacts and adopts store-forward mechanism, computes the path between source and destination. It is a kind of link scheduling algorithm, using different links in different time periods and to achieve maximum throughput. Finally, in the Linux system, we use the Socket network programming to complete the data store and forward based on SBR, and verify the feasibility of the algorithm.