DTN-Knca: A High Throughput Routing Based on Contact Pattern Detection in DTNs

摘要

In current routing algorithms based on encounter history in Delay-Tolerant Networks (DTNs), packets are always forwarded to nodes with highest probability to reach destination node. However, to the best of our knowledge, no analytical node transient contact pattern detection to achieve high performance, is reported in the literature. In this letter, DTN-Knca - a novel routing which detects frequently encountered nodes' transient contact patterns by correlation analysis is proposed. The trace-driven simulations demonstrate the higher throughput of DTN-Knca in comparison to the state-of-the-art DTN typical routing algorithms based on the encounter history knowledge.