Cart (Loading....) | Create Account
Close category search window
 

HVR: History-Based Vector Routing for Delay Tolerant 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

2 Author(s)
Hyunwoo Kang ; Electron. & Telecommun. Res. Inst. (ETRI), Daejeon, South Korea ; Dongkyun Kim

In delay tolerant networks (DTNs) with frequent network partitioning, routing packets is a challenge, because the successful establishment of an end-to-end path between source and destination nodes is not guaranteed. Typical routing protocols for DTNs depend on data replications over multiple paths for reliable data delivery. Since they invoke a lot of replicated packets, our previous work introduced a Vector Routing protocol utilizing the vector of node movement in order to reduce such replications. In this paper, we extend the previous work and propose a more efficient Vector Routing protocol to exploit some features of history-based routing protocols where packets are forwarded to nodes with higher probability to meet their destination nodes. Unlike the existing protocols where the number of nodal encounters is used to calculate the probability of forwarding, our proposed protocol allows a node to maintain the vector information of other nodes that it has met and share this information with other nodes. Using the history information, a node predicts the location area of each packet's destination node in order to perform more accurate forwarding. The ns-2 simulations using random waypoint and Manhattan mobility models verify that our protocol achieves better performance in terms of less amount of traffic incurred without loss of packet delivery ratio.

Published in:

Computer Communications and Networks, 2009. ICCCN 2009. Proceedings of 18th Internatonal Conference on

Date of Conference:

3-6 Aug. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.