RET: A Random and Encounter Time Based Forwarding Mechanism for Opportunistic Network

Based on the analysis of the existing utility-based forwarding mechanisms, for the inefficient forwarding of history encounter time based forwarding mechanism in the initial phase of the node movement, a Random and Encounter Time Based algorithm named RET is proposed in this paper. RET divides the nodes moving into two phases-random forwarding phase (initial phase) and utility-based forwarding phase. In random forwarding phase, random algorithm is used to forward packets. And in utility-based forwarding phase, the packets are forwarded by using utility value. The results of simulation experiment show that the RET algorithm can reduce the delivery delay under low node density.