Routing in Disruption Tolerant Networks with Limited Storage

Abstract

In this paper, we consider a disruption tolerant network (DTN) which enables data transmission with intermittent connectivity and in which instantaneous end-to-end path between a source and destination may not exist. We explore routing problems in such networks in consideration of limited storage for each intermediate node. A graph model called the storage enhanced time-varying graph (STVG) is presented, which fits the dynamic topology characteristics and time- varying parameters of DTN. We transform the nodes with finite buffer in DTN into links with limited bandwidth in STVG. Then, a Shortest Path Computation with Flow Guaranteed (SPFG) algorithm is proposed to select a path with minimum overall cost (delay), meanwhile, to guarantee the transfer of a certain flow. Simulation results show that the proposed algorithm based on the STVG model can obtain better performance in delay and delivery ratio (which can be improved to more than 90%) as compared with existing routing algorithms without considering the buffer constraints.