Delegation forwarding in delay tolerant networks multicasting

被引：4

作者：

Wang Y. ^{[1
]}

Li X. ^{[1
]}

Wu J. ^{[1
]}

机构：

[1] Department of Computer and Information Sciences, Temple University, Philadelphia

来源：

Journal of Communications | 2011年 / 6卷 / 05期

关键词：

Delay tolerant networks (DTNs); Delegation forwarding (DF); Forwarding algorithms; Message replication; Multicast;

D O I：

10.4304/jcm.6.5.384-392

中图分类号：

学科分类号：

摘要：

Delay tolerant networks (DTNs) are a special type of wireless mobile networks which may lack continuous network connectivity. Multicast supports the distribution of data to a group of users, a service needed for many potential DTNs applications. While multicasting in the Internet and mobile ad hoc networks has been studied extensively, due to the unique characteristic of frequent partitioning in DTNs, multicasting in DTNs is a considerably different and challenging problem. It not only requires new destinations of multicast semantics, but also brings new issues to the design of routing algorithms. In this paper, we propose new forwarding models for DTNs multicast and develop several multicast forwarding algorithms. We use delegation forwarding (DF) in DTNs multicast and compare it with single and multiple copy multicast models, which are also proposed in this paper. From the analytical results, we have the following conclusions: (1) Although the single copy model has the smallest number of forwardings, its latency is much longer than the other two models. (2) Among these three models, the delegation forwarding model has the least delay. The effectiveness of our approach is verified through extensive simulation both in synthetic and real traces. © 2011 ACADEMY PUBLISHER.

引用

页码：384 / 392

页数：8

共 23 条

[1]

Fall K., A delay-tolerant network architecture for challenged Internets, Proc. of ACM SIGCOMM, pp. 27-34, (2003)

[2]

Lindgren A., Doria A., Schelen O., Probabilistic routing in intermittently connected networks, SIGMOBILE Mob. Comput. Commun. Rev, 7, 3, pp. 19-20, (2003)

[3]

Liu C., Wu J., An optimal probabilistic forwarding protocol in delay tolerant networks, Proc. of ACM MobiHoc, pp. 105-114, (2009)

[4]

Erramilli V., Crovella M., Forwarding in opportunistic networks with resource constraints, Proc. of the Third ACM Workshop on Challenged Networks (CHANTS), pp. 41-48, (2008)

[5]

Uddin M.Y.S., Godfrey B., Abdelzaher T., Relics: Innetwork realization of incentives to combat selfishness in dtns, Proc. of IEEE International Conference on Network Protocols (ICNP), (2010)

[6]

Reich J., Chaintreau A., The age of impatience: Optimal replication schemes for opportunistic networks, Proc. of ACM the 5th International Conference on Emerging Networking Experiments and Technologies (CoNEXT), pp. 85-96, (2009)

[7]

Erramilli V., Crovella M., Chaintreau A., Diot C., Delegation forwarding, Proc. of ACM MobiHoc, pp. 251-260, (2008)

[8]

Scott J., Gass R., Crowcroft J., Hui P., Diot C., Chaintreau A., CRAWDAD Trace Cambridge/haggle/imote/cambridge (v. 2006-01-31), (2006)

[9]

Wu J., Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, (2005)

[10]

Moy J.T., OSPF: Anatomy of An Internet Routing Protocol, (1998)

← 1 2 3 →