HNSARA: A history-and-node-state-based active routing algorithm for DTN

The routing algorithm of the DTN, which experience frequent long-duration partitions, is quite different from the normal networks. Active routing algorithms usually adopt an active host (data mule/message ferry) to exchange and forward the messages. In the existing studies in DTN, the active routing problem is generally solved by adopting the solutions of the Travelling Salesman Problem (TSP). In such solutions, the active routing problem is often solved by finding a simple cycle with no repeated nodes nor edges. By considering a more general scenario, we propose an active routing algorithm, which is based on the historical information and node states, where the route is a closed walk. The simulations verify the accuracy and efficiency of the active routing algorithm we proposed in this paper.