Please use this identifier to cite or link to this item:

Anycast routing in delay tolerant networks

Authors Gong, Yili
Xiong, Yongqiang
Zhang, Qian
Zhang, Zhensheng
Wang, Wenjie
Xu, Zhiwei
Issue Date 2006-11
Source Proceedings IEEE Global Telecommunications Conference, GLOBESCOM 06, San Francisco, California, USA , 27 Nov.-1 Dec. 2006
Summary 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.
Rights © 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Language English
Format Conference paper
Files in this item:
File Description Size Format
anycast.pdf 212892 B Adobe PDF