Research For Technique Of Routing In Delay-Tolerant Nerwork

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 radiolinks,communica-tion 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,On the basis of the reference of Jain and others which they proposed the knowledge oracle and some DTN routing algorithm.With different knowledge oracles,the algorithms perform in different way. This article on the advantages and disadvantages of these algorithms are described and analyzed in detail.Furthermore,this paper introduces the ONE (Opportunistic Networking Environment) simulation theory,and use ONE platform provides a simulation method, implementation,and comparison of the current delay tolerant network's five primary routing algorithm.The simulation results can be found in the node's cache,the size of the information base for network performance has important implications.Unlimited increase in the node cache is not possible,Therefore, this paper was to increase the network through the nodes of style static information repository to enhance the network information database,and thus improve the capacity performance of the better program no later than the network routing scheme,that is increase the static information in the database based on the node,static information library node to node to help forward the load light,heavy load of three nodes and all nodes forwarding strategy.And to achieve this in ONE simulator improved routing scheme,and the performance comparison.In this paper, We studied the following issues. First,delay tolerant network,routing algorithm is introduced and the main comparison.This information base from the perspective of a different database for the main summary and comparison of routing algorithms,Including the Epidemic, FirstContact, DirectDelivery, PROPHET and SpayAndWait other five routing algorithm. Also,this simulator in the ONE based on the comparison of the above-mentioned five kinds of delay tolerant network routing algorithm performance.Second,raised by increasing the static database node,to expand the capacity of the routing information base no later than the network program.Larger cache node, the message forwarding higher the success,however,increase the node cache is not unlimited,and this node by increasing the static repository approach,expanding the network capacity database no later than the size of the routing program improvement. Static information base node to node to help forward the lighter the load,the load weight of three kinds of nodes and all nodes participate in forwarding strategy to delay tolerant network,routing process.In this paper,based on ONE simulator of the proposed routing scheme to improve.ONE simulator simulation results show that the three strategies compared SpayAndWait forward algorithm can effectively improve the network transmission capacity no later than the success rate;delivery rate and delay on the two performance indicators taken into account,then static information database grids to help forward the routing strategy of the load light node has made the best results.