Delay Tolerant Networks (DTNs) are networks that network partitioning frequently occurs due to lacking of continuous network connectivity. The network partitioning leads to the unavailability of fully connected paths from sources to destinations. To deal with this problem, previous research works have proposed routing protocols that focus on increasing the number of messages to reach the destination, but their protocols incur high transmission overhead. This thesis proposes a spray and wait routing scheme for delay tolerant networks by using the different neighbor history from neighbor nodes. In this scheme, a sender node uses neighbor history lists of its neighbors to calculate the appropriate number of message copies for forwarding. From our simulation results, the proposed routing protocol can reduce overhead from previous protocols while maintaining the number of messages reaching the destinations. In addition, our protocol can reduce network load and has higher delivery utility from previous works.
