By Topic

OOPFE: A new routing method to use the rule of First Encounter within OOP-Routing in delay tolerant mobile ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shih-Yang Yang ; Dept. of Media Arts, Kang-Ning Junior Coll. of M. C. & M., Taipei, Taiwan ; Jiun-Ting Jiang ; Po-Zung Chen

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.

Published in:

Computing and Networking Technology (ICCNT), 2012 8th International Conference on

Date of Conference:

27-29 Aug. 2012