Probabilistic Routing Algorithm Based on Inter-node Reliability in DTN

In delay-tolerant networks, due to the characteristics of frequent link breaks, limited resources, and dynamic changes in network topology, how to forward messages effectively is a key problem to be solved. For this reason this paper proposes a probabilistic routing algorithm INR-PRA (Probabilistic Routing Algorithm Based on Inter-Node Reliability). This algorithm determines the forwarding order of messages based on the message quality of nodes, with messages with high quality being forwarded first. When forwarding the message to select the next hop node, the forwarding probability is determined based on the inter-node reliability, and the node with high forwarding probability is selected for forwarding the message; the inter-node reliability takes into full consideration the node's own attributes including the inter-node connection statistics, the node's cache idle rate, and the forwarding rate. The evaluation using ONE simulation tool shows that INR-PRA can effectively improve message transmission rate, reduce average latency, reduce network overhead, and improve network performance to a certain extent.