Delay Tolerant Networks (DTNs) are characterized by very long delay paths and frequent network partitions. In this paper, a novel E-Scheme is proposed which can be utilized by most of the existing routing approaches that employ the 'probability to deliver' metric. Providing there are n opportunities, the E-Scheme is to let the first (n-1)/e opportunities go by (except for encountering the destination of messages) and then accept the first one to appear that is better than all of those. Meanwhile a probabilistic metric, called Two-Hop (TH) delivery predictability value, is presented here according to the small world theory. Our scheme has been evaluated using some existing approaches as well as the TH delivery predictability value and been shown to exhibit excellent performances.
展开▼