Research And Simulation Of Related Problems In Delay Tolerant Network

Delay-Tolerant Network (DTN) is a common, message-oriented, stable architecture to connect networks with high latency and low data rate. It is suitable for terrestrial mobile networks, satellite communications, very long-distance radio links, communication using acoustic modulation in water, free-space optical communication, military Ad-Hoc networks, sensor networks and so on. It is valuable for both research and practice.This thesis focuses on delay-tolerant networking routing problems. After the background and the architecture are introduced, we analyze the typical routing algorithms and propose knowledge oracle and develop several new algorithms. With different knowledge oracles, the algorithms perform in different way. The performances of them are compared.In delay-tolerant network, routing performance and network resource remains competitive relations. It is the main point of designing routing protocols to conduct trade-offs. Base on RIP, OSPF and Epidemic routing protocol, a new protocol is designed for delay-tolerant network including the usage of knowledge oracles.Our research uses simulation to compare the performance of the routing algorithms in different environments. We get to the conclusion that the algorithms using the most knowledge tend to perform well. We also find that with limited knowledge, efficient algorithms can be constructed for routing in such environments for the reason that the importance of knowledge oracles are different.There remains plenty of related works in the delay-tolerant network architecture. It is a great challenge to realize congestion control, stream control, security framework and security routing.