A general model for store-carry-forward routing schemes with multicast in delay tolerant networks

Delay tolerant networks (DTNs) are sparse and highly mobile wireless ad hoc networks, where no contemporaneous end-to-end path may ever exist at any given time instant, and thus the “store-carry-forward” kind of schemes becomes a natural routing option. A lot of models have been proposed to analyze the unicast performance of such routing schemes in the DTNs, while few works consider the multicast scenario. In this paper, we develop a general continuous time Markov chain-based theoretical framework to characterize the complicated message delivery process of the DTN multicast scenarios, based on which analytical expressions are further derived for both the expected delivery delay and expected delivery cost. The developed theoretical framework is general in the sense that: 1) it can be used to analyze the DTN multicast performance under the common “store-carry-forward” routing schemes; 2) it can also be used for the common mobility models; 3) it covers some available models developed for the DTN unicast as special cases. We then apply the theoretical framework to explore the delivery performance of two popular routing schemes, the epidemic routing and the two-hop relaying.

[1]  Merkourios Karaliopoulos,et al.  Assessing the vulnerability of DTN data relaying schemes to node selfishness , 2009, IEEE Communications Letters.

[2]  ChaintreauAugustin,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007 .

[3]  Zygmunt J. Haas,et al.  A new networking model for biological applications of ad hoc sensor networks , 2006, IEEE/ACM Transactions on Networking.

[4]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2004, IEEE Transactions on Information Theory.

[5]  Pan Hui,et al.  Evaluating the Impact of Social Selfishness on the Epidemic Routing in Delay Tolerant Networks , 2010, IEEE Communications Letters.

[6]  Xiaohong Jiang,et al.  Performance Modeling for Two-Hop Relay with Erasure Coding in MANETs , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[7]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[8]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[9]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[10]  Xiaohong Jiang,et al.  Delay and Capacity in Ad Hoc Mobile Networks with ¿-Cast Relay Algorithms , 2011, 2011 IEEE International Conference on Communications (ICC).

[11]  Eitan Altman,et al.  Performance of Ad Hoc Networks with Two-Hop Relay Routing and Limited Packet Lifetime , 2006, 200614th IEEE International Workshop on Quality of Service.

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

[13]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[14]  Ioannis Stavrakakis,et al.  Study of two-hop message spreading in DTNs , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[15]  Stephen Farrell,et al.  DTN: an architectural retrospective , 2008, IEEE Journal on Selected Areas in Communications.

[16]  Xiaohong Jiang,et al.  Message delivery probability of two-hop relay with erasure coding in MANETs , 2012, 7th International Conference on Communications and Networking in China.

[17]  Rajesh Sundaresan,et al.  Delay and energy optimal two-hop relaying in delay tolerant networks , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[18]  Francesco De Pellegrini,et al.  Dynamic control of Coding in Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[19]  Xiaohong Jiang,et al.  Group-based two-hop relay with redundancy in MANETs , 2011, 2011 IEEE 12th International Conference on High Performance Switching and Routing.

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

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

[22]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[23]  Honggang Zhang,et al.  Impact of source counter on DTN routing control under resource constraints , 2010, MobiOpp '10.

[24]  Eitan Altman,et al.  Forward Correction and Fountain Codes in Delay-Tolerant Networks , 2008, IEEE/ACM Transactions on Networking.

[25]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[26]  Xiaohong Jiang,et al.  Delay and Capacity in Ad Hoc Mobile Networks with f-cast Relay Algorithms , 2011, IEEE Transactions on Wireless Communications.

[27]  Ahmad Al Hanbali,et al.  Simple Models for the Performance Evaluation of a Class of Two-Hop Relay Protocols , 2007, Networking.

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