DTN earliest-delivery routing algorithm based on routing reliability

DTN network is a new type of network architecture, according to the different network environment, DTN network presents different forms. Because this network has large and uncertain time delay and is frequently interrupted, it becomes a key issue to improve routing reliability of the DTN network. This paper makes a detailed analysis on the deficiency of ED (Earliest-Delivery), a routing algorithm of the DTN network. According to the characteristics of DTN link, the paper puts forward the algorithm to select the best end-to-end path, introducing connection reliability value (CRV) and the concept of the historical information to calculate, and then put forward a more robust routing algorithm-EDH. A detailed analysis of the inadequacies of existing DTN a routing algorithm ED (Earliest-Delivery) algorithm, according to DTN link the characteristics of the proposed algorithm to select the best end-to-end path, the introduction of the connection reliability value (CRV computing) concepts and historical information, and then proposed a more robust routing algorithm-EDH algorithm. The simulation results show that the improved ED algorithm can effectively reduce the delay, reduce routing overhead, and improve the data transfer rate.