Yili GongYongqiang XiongQian ZhangZhensheng ZhangWenjie WangZhiwei Xu
Anycast routing is very useful for many applications such as resource discovery in Delay Tolerant Networks (DTNs). In this paper, based on a new DTN model, we first analyze the anycast semantics for DTNs. 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 anycastrouting 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.
Mingjun XiaoLiusheng HuangAn LiuWei-can Chen
Éderson R. SilvaPaulo Roberto Guardieiro