By Topic

DNH-SaW: The Different Neighbor-History Spray and wait routing scheme 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
$33 $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)
Vittawus Prueksasri ; Department of Computer Engineering, Chulalongkorn University, Bangkok, Thailand ; Chalermek Intanagonwiwat ; Kultida Rojviboonchai

In Delay Tolerant Networks (DTNs), network partitioning is likely to happen due to sparse and mobile nodes with limited transmission ranges. The network partitioning leads to the unavailability of fully connected paths from sources to destinations. To deal with this problem, many routing schemes are proposed such as Epidemic routing and Spray and Wait routing. These schemes obtain high delivery rate but incur high overhead. In this paper, we propose a Different Neighbor-History Spray and Wait (DNH-SaW) routing scheme. DNH-SaW calculates the number of data copies to forward based on the neighbor-history of each receiver. Our simulation result shows that DNH-SaW can reduce overhead up to 27% and increases delivery utility up to 21.68% while achieving comparable delivery probability with previous works.

Published in:

Intelligent Signal Processing and Communications Systems (ISPACS), 2011 International Symposium on

Date of Conference:

7-9 Dec. 2011