Vector Routing for Delay Tolerant Networks

Recently, much research work has paid attention to Delay Tolerant Networks (DTNs), which are networks with a frequent occurrence of network partitioning. Since the successful establishment of an end-to-end path between source and destination nodes is not guaranteed in these networks, routing is a challenging issue. In typical routing protocols for DTNs such as Epidemic Routing, they depend on data replication techniques over multiple paths for reliable data delivery. However, they invoke a large number of duplicated packets in the network. This paper therefore proposes an efficient routing (called Vector Routing) by utilizing the vector of node movements.