Efficient routing in delay tolerant networks with correlated node mobility

Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path from source to destination is unlikely to exist, message delivery relies on opportunistic routing. However, effective forwarding based on a limited knowledge of contact behavior of nodes is challenging. Most of the previous studies looked at only the pairwise node relations to decide routing. In contrast, in this paper, we analyze the correlation between the meetings of each node with other nodes and focus on the utilization of this correlation for efficient routing of messages. We introduce a new metric called conditional intermeeting time, which computes the average intermeeting time between two nodes relative to a meeting with a third node using only the local knowledge of the past contacts. Then, we show how we can utilize the proposed metric on the existing DTN routing protocols to improve their performa...

• Type: Journal
• Year: 2010
• Where: MASS
• Authors: Eyuphan Bulut, Sahin Cem Geyik, Boleslaw K. Szymanski
• Keywords: Communications, Conditional Intermeeting Time, MASS 2010, Node, Routing