Epidemic Routing Optimization Algorithm Based on Node Cache Status

In response to the issue that the Epidemic routing algorithm in DTN generates a large number of message copies in the network, which can easily deplete network resources and even cause network congestion, we propose an optimized Epidemic routing algorithm based on node cache state, called EBNCS (Epidemic Based on Node Cache State). The EBNCS algorithm classifies nodes based on their cache status and adopts different message forwarding strategies for nodes with different cache statuses, thereby avoiding the resource waste and network congestion caused by blind flooding. Additionally, an ACK acknowledgment mechanism is introduced to delete successfully delivered message copies in the network, reducing network overhead. Simulation experiments show that the EBNCS routing algorithm significantly improves message delivery rate, network overhead, and transmission delay.