Performance evaluation of network coding in disruption tolerant networks

Delay/Disruptive Tolerant Network (DTN) differs from the traditional networks in that it has no continuous or contemporaneous connections but only intermittent connections among wireless nodes and thus it is viewed as an opportunistic networks. DTNs emerge as a good alternative to provide services to a variety of applications in highly challenged environments. However, the characteristics of DTNs make existing solutions infeasible to be applied directly and new solutions are required to be explored, such as multicast which has been extensively studied before in internet and mobile ad hoc networks. Network coding has been proved been proved as an efficient way to improve the performance of multicast in traditional networks. In this paper, we use simulations to study how multicast with network coding performs in DTNs in terms of delivery delay under various application requirements (i.e., the amount of content to distribute and the number of multicast group members) and the network settings (i.e., the popularity of the network and the contact rate). Some empirical results are provided in this paper as well.

[1]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

[2]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[3]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

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

[6]  Baochun Li,et al.  Stochastic analysis of network coding in epidemic routing , 2008, IEEE Journal on Selected Areas in Communications.

[7]  Yunnan Wu,et al.  Minimum-energy multicast in mobile ad hoc networks using network coding , 2004, Information Theory Workshop.

[8]  Kang-Won Lee,et al.  RelayCast: Scalable multicast routing in Delay Tolerant Networks , 2008, 2008 IEEE International Conference on Network Protocols.

[9]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[10]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.

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

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

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

[14]  G. Neglia,et al.  On the Benefits of Random Linear Coding for Unicast Applications in Disruption Tolerant Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[15]  Steven McCanne,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995, SIGCOMM '95.

[16]  Muriel Médard,et al.  Achieving minimum-cost multicast: a decentralized approach based on network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Baochun Li,et al.  Efficient Network Coded Data Transmissions in Disruption Tolerant Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

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

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