DTN Routing with Probabilistic Trajectory Prediction

摘要

Many real-world DTN application involve vehicles that do not have a purely random mobility pattern. In most cases nodes follow a predefined trajectory in space that may deviate from the norm due to environment factors or random events. In this paper we propose a DTN routing scheme for applications where the node trajectory and the contact schedule can be predicted probabilistically. We describe a technique for contact estimation for mobile nodes that uses a Time Homogeneous Semi Markov model. With this method a node computes contact profiles describing the probabilities of contacts per time unit, and uses them to select the next hop such that the delivery ratio is improved. We develop the Trajectory Prediction DTN Routing algorithm and we analyze its performance with simulations.