A Dynamic Energy-Efficient Epidemic Routing for Delay Tolerant Networks

Delay tolerant networks (DTNs) are network environments with high latency, low data rate, intermittent connection, and limited resources. The communication between the nodes is conducted through the store-carry-forward mechanism, and multi-copy routing strategy is often used to improve the reliability of communication. In order to improve the message delivery probability, reduce network overhead and manage the node buffer more effectively in DTNs, this paper proposed a dynamic energy-efficient Epidemic routing algorithm for DTNs (DERD). The algorithm utilizes the dynamic energy threshold strategy to determine whether to transmit the message from the sending node to the receiving node, the ACK acknowledgment information is incorporated in the algorithm to delete the outdated message. The simulation results show that the algorithm is superior to the contrast routing algorithm in terms of the number of survived nodes, message delivery probability and network overhead ratio.