Plankton: An efficient DTN routing algorithm

In this paper, we present an efficient routing algorithm, Plankton, for Delay/Disruptive Tolerant Network (DTN). Plankton utilizes replica control to reduce overhead and contact probability estimates to improve performance. Plankton has two major features. First, it uses a combination of both short-term bursty contacts and long-term association based statistics for contact prediction. Second, it dynamically adjusts replication quotas based on estimated contact probabilities and delivery probabilities. Our evaluation on extensive traces shows that Plankton achieves significantly better prediction accuracy than existing algorithms for contact probability prediction. In addition, we show that while Plankton incurs much lower communication overhead compared to Spray-and-Wait, MaxProp and RAPID with savings from 14% to 88%, it can also achieve similar if not better delivery ratios and latencies.