Controlled Epidemic Routing for Multicasting in Delay Tolerant Networks

Delay tolerant networks (DTNs) are a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. DTN multicasting is a desirable feature for applications where some form of group communication is needed. In this paper, we examine multicasting in DTNs using controlled flooding schemes. Specifically, we analyze basic multicast routing schemes for fundamental performance metrics such as message delivery ratio, message delay, and buffer occupancy. Further, we study the effects of different controlled Epidemic routing schemes using TTL and message expiration times. Our experiments show that our analytical results are accurate and that with careful protocol parameter selection it is possible to achieve high delivery rates for various system scenarios.

[1]  Zygmunt J. Haas,et al.  Resource and performance tradeoffs in delay-tolerant wireless networks , 2005, WDTN '05.

[2]  Robert Simon,et al.  Analysis of Core-Assisted Routing in Opportunistic Networks , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[3]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[5]  Kevin C. Almeroth,et al.  Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks , 2005, NETWORKING.

[6]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[7]  Mostafa Ammar,et al.  Multicasting in delay tolerant networks: semantic models and routing algorithms , 2005, WDTN '05.

[8]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[9]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[10]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[11]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[12]  R. Simon,et al.  Analytical Techniques for Performance Analysis of Multi-copy Routing Schemes in Delay Tolerant Networks , 2009 .

[13]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[14]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

[15]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2010, IEEE Trans. Mob. Comput..

[16]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2007, IEEE Transactions on Mobile Computing.

[17]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[18]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[19]  Cauligi S. Raghavendra,et al.  Performance analysis of mobility-assisted routing , 2006, MobiHoc '06.

[20]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[21]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[22]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.