WSN12-3: Anycast Routing in Delay Tolerant Networks

Author

Gong, Yili ; Xiong, Yongqiang ; Zhang, Qian ; Zhang, Zhensheng ; Wang, Wenjie ; Xu, Zhiwei

fYear

2006

fDate

Nov. 27 2006-Dec. 1 2006

Firstpage

1

Lastpage

5

Abstract

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 any-cast 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 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.

Keywords

delays; telecommunication network routing; DTN; EMDDA; MED algorithm; anycast routing; delay tolerant networks; expected multidestination delay-for anycast; minimum expected delay algorithm; routing algorithm; Asia; Delay; Disruption tolerant networking; IP networks; Intrusion detection; Mobile ad hoc networks; Peer to peer computing; Routing; Unicast; Watches;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE

Conference_Location

San Francisco, CA

ISSN

1930-529X

Print_ISBN

1-4244-0356-1

Electronic_ISBN

1930-529X

Type

conf

DOI

10.1109/GLOCOM.2006.960

Filename

4151590