Paper Info
Title
DTN Routing with Probabilistic Trajectory Prediction
Abstract
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.
Year
DOI
Venue
2008
10.1007/978-3-540-88582-5_7
WASA
Keywords
Field
DocType
real-world dtn application,mobile node,trajectory prediction dtn routing,dtn routing scheme,contact estimation,probabilistic trajectory prediction,node trajectory,predefined trajectory,cases node,node computes contact profile,contact schedule,delay tolerant network,routing protocol,markov process,markov model
Link-state routing protocol,Dynamic Source Routing,Static routing,Policy-based routing,Computer science,Computer network,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Distributed computing,Zone Routing Protocol,Routing protocol
Conference
Volume
ISSN
Citations 
5258
0302-9743
11
PageRank 
References 
Authors
0.81
15
4
Name
Order
Citations
PageRank
Ionut Cardei130316.76
Cong Liu258630.47
Jie Wu38307592.07
Quan Yuan424711.59