Skip to Main Content
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.
Date of Conference: 7-9 Dec. 2011