Encounter-based routing in delay tolerant networks

Abstract

Delay tolerant networks are intermittently connected. In this paper, we propose a DTN routing scheme EBR. The scheme is based on the idea of exploiting inter-contact time between mobile nodes to predict the number of nodes with no copy a node will encounter within the expected delay. In EBR, every node with message copies dynamically chooses the number of copies by itself. We evaluate the performance of EBR through various simulations. Simulation results show that EBR has good performance with low overhead in most scenarios.