A Storage-limited Adaptive DTN Routing Algorithm Research

With the rapid development of information technology,the traditional architecture of the Internet network is difficult to deal with networks where end-to-end connectivity is intermittent,high delay of network transmission,node energy and limited storage capacity.Delay Tolerant Network(DTN)was presented to deal with the scene.Among the DTN network study,the routing algorithm research is its top priority.At present,there are many kinds of DTN routing algorithms.According to the routing policy can be divided into flood-based routing algorithm and forward-based routing algorithm.Typical flood-based algorithm contains Epidemic routing algorithm,the Spray and Wait,the Spray and Focus.Multi-Simbet,etc.Typical forward-based routing algorithm contains Single Recent,Direct Transmission.One Hop Encounter Prediction,etc.In this paper,we abstract the storage-limited conditions into the node capacity to handle the number of messages at the same time.At the same time,we choose the Epidemic,the Spray and Wait,Multi-Simbet,Single Recent,Direct Transmission as five typical routing algorithm,simulation,using the Python at MIT,SW data set to these five algorithm performance evaluation analysis.And based on the simulation result.we advances an adaptive routing algorithm which can choose routing algorithm according to network real-time load.Comprehensive utilization of the algorithm is appropriate to the various classical routing algorithm,choose appropriate routing algorithm,implements the performance overhead than a boost.The simulation results show that the adaptive routing algorithm to improve the success rate of transmission and reduce the routing resource consumption.