Research And Improvement Of The Dtn Routing Algorithm

Increasing number of new network is characterized with long link delay, high link error rate, end to end path disconnected frequently, limited storage resources and lack of continuous energy supply, and so on. The network and Internet are different in the network architecture and network performance characteristics, so the traditional network protocol does not work. In this context, researchers propose a new concept of delay tolerant network (DTN). On this basis, its various aspects have been researched. DTN routing technology is a hot research topic. Because of DTN network environment diversity and complexity, routing algorithm is also divided into different categories. According to the master node network topology information, it can be divided into deterministic and random routing algorithm.This paper focuses on one of DTN's deterministic routing algorithm——ED, and makes an analysis of its calculation of delay cost function. To select the accurate time of routing decision-making and optimize the calculation of delay cost, a link connection state table is employed. On this basis, the transmission delay and rules of node-link connection are taken into account. Experimental results show that the improved ED can effectively reduce the delay and the routing overhead, improve routing success rate.Then, based on the analysis of the random routing algorithm——PROPHET's calculation of delivery predictability, routing, and network congestion, an improved PROPHET is proposed. According to the survival time of information, a reasonable node queue cache management mechanism is created. A node link table to optimize the calculation of delivery predictability is employed and a network congestion treatment program is introduced. Simulation results show that the improved PROPHET has better performance of delivery ratio, average latency and routing overhead, compared with PROPHET.