Anycast Routing in Delay Tolerant Networks

Anycast routing is very useful for many applications such as resource discovery in Delay Tolerant Networks (DTNs). In this paper, we first analyze the anycast semantics for DTN based on a new DTN model. Then we present a novel metric named EMDDA (Expected Multi-Destination Delay for Anycast) and a corresponding routing algorithm for anycast routing in DTNs. Extensive simulation results show that the proposed EMDDA routing scheme can effectively improve the efficiency of anycast routing in DTNs. It outperforms another algorithm, Minimum Expected Delay (MED) algorithm, by 11.3% on average in term of routing delays and by 19.2% in term of average max queue length.