A New Routing Scheme Based on Greedy Tree in Delay Tolerant Networks

Delay tolerant networking (DTN) is a new store-and-forward architecture and protocol suite for the networks which is intermittent connectivity. Depending on the nodes ability of store and forward, the messages are delivered to their destination with the proper choice of routing protocol by nodes´ mobility. In order to successful delivery, many routing protocols use multiply copies methods. Although the messages are transferred to the destination, the redundant of messages copies increase much. These routing protocols are not appropriate for energyconstrained and bandwidth-constrained applications such as the wireless networks. In many resource-constrained mobile wireless DTN networks, single copy routing schemes should be used suitably. This paper presents a new routing scheme of single-copy based on the DTN connectivity graph and the corresponding greedy tree. The nodes choose the next intermediate node to transmit the message by comparing the location of nodes in the greedy tree. We show that delivery ratio is increased significantly by using our scheme in the single-copy routing.