A mobility vector based routing algorithm for Delay Tolerant Networks using history geographic information

The concept of Delay Tolerant Networks (DTNs) are proposed to facilitate communication in challenged mobile wireless networks using the Store-Carry-Forward (SCF) routing behavior. In this paper, our motivation is to take advantage of geographic routing since it routes message without the knowledge about network topology by using realtime location information, overcoming the challenge of large network topology variation in DTNs. Different from traditional geographic algorithms, our approach only adopts history geographic information due to the difficulty to obtain the realtime location of destination, suffering from sparse network density and high mobility. The key insight of our algorithm is to separate message replication depending on the proximity to the movement range estimated for destination, followed by the proposed scheduling methodology for prioritized transmission between each phase as well as anti-diffusion function for redundancy reduction. Simulation results under the Helsinki city scenario show an improvement comparing with two well known geographic approaches in DTNs, considering delivery ratio, average latency as well as overhead ratio.