In DTNs, most of the routing developments are addressed in specific scenarios. However, about zero-knowledge routing, fewer breakthroughs can make their ways for novel developments. From this paper, we propose a novel routing in terms of zero-knowledge, namely OOPFE. We get the routing idea through observations in the daily life. In the 400-meter relay race of the World Olympic Game, the average speed is faster than that of the individual 400-meters race. We attempt to use the characteristic and further research by the way of “relay-delivering message” to tackle the tradeoff for increasing the delivery ratio and decreasing the number of duplication in the random moving scenarios. And, we have got a novel method and used NS2 Simulator to verify. Since the hop-limit greatly affects the efficiency, we also analyze the average number of hop counts for different hop-limits. The results show that this routing more ssuitable for the scenarios when the speed of source nodes is slower or the size of the network scenario is larger.
Journal of Communications and Information Sciences 3(1), pp.47-59