Skip to Main Content
Routing algorithm plays a critical role in determining performance in DTNs. In particular, the network bandwidth is constrained, it is a big challenge to find routing paths that satisfy delay tolerant and resources restricted. In this paper, we propose a new routing method using the rule of “First Encounter” within our routing method “OOP-Routing”, named “OOPFE-Routing”. We use the ns2 network simulator to verify, and analysis the performance is better than before on the tradeoff between the delivery ratio and the number of forwarding packets. And, when the size of buffer queue is scarce or when the number of forwarding packets in Epidemic-Routing have grown huge, the delivery ratio of this routing has exceed Epidemic. Moreover, the performance is very similar to Two-Hop-Routing, but still can be applied in different scenarios. And, the OOPFE will better than Two-Hop when the number of hop-limit is larger or when the speed of source-node is slower.