In this paper, we propose an algorithm that analyses characteristic nodes to select efficient relay nodes using message distribution. Existing delay tolerant network (DTN) routing algorithms have problems with large latency and overhead on account of the deficiency of network information in an unsteady network. We must solve this problem, predict future networks using node state information, and apply a weight factor that changes according to the message distribution. Simulation results show that the proposed algorithm provides enhanced performance compared to existing DTN routing algorithms.

delay tolerant network, relay node select, DTN routing algorithm.