A Novel Approach for Efficient Delay Tolerant Networks Using Conditional Shortest Path Routing
This paper deals with Delay Tolerant Networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. Delay tolerant networks are characterized by the sporadic connectivity between their nodes and therefore the lack of stable end-to-end paths from source to destination. Since the future node connections are mostly unknown in these networks, opportunistic forwarding is used to deliver messages. Based on the observations about human mobility traces and the findings of previous work, the authors introduce a new metric called conditional intermeeting time. They propose Conditional Shortest Path Routing (CSPR) protocol that route the messages over conditional shortest paths in which the cost of links between nodes is defined by conditional intermeeting times rather than the conventional intermeeting times.