Graph-based single-copy routing in delay tolerant networks

This paper presents a new graph-based single-copy routing method in delay tolerant networks (DTN). With time goes on in the networks, a DTN connectivity graph is constituted with mobility ofnodes and communication, and a corresponding greedy tree is obtained using a greedy algorithm inDTN connectivity graph. While there are some bad nodes such as disabled nodes or selfish nodes in delay tolerant networks, the nodes can choose the next proper intermediate node to transmit the mes- sage by comparing the location of neighboring nodes in the greedy tree. The single-copy routing method is very appropriate for energy-constrained, storage-constrained and bandwidth-constrained applications such as mobile wireless DTN networks. We show that delivery ratio is increased signifi- cantly by using the graph-based single-copy routing when bad nodes exist.