A routing scheme based on Spray-and-Wait and Connecting-Capability of Node

DTNs overcome the problems associated with intermittent connectivity, long or variable delay, asymmetric data rates, and high error rates by using store-carry-forward message switching. In DTNs, a node is an entity with a bundle layer. A node may be a host, router, or gateway (or some combination) acting as a source, destination, or forwarder of bundles. In addition, the performance of node shows great differences. However, the previous DTN routings show blindly and randomly, which do not measure the performance of node when they forward messages. To deal with this issue, we present the concept of Node Connection Intensity (NCI) and Node Connection Stability (NCS), then propose a routing scheme based on Spray-and-Wait and Connecting-Capability of Node (SW-CCN), which evaluate relay node's forward capability synthetically according to the NCI and the NCS. The SW-CCN routing can allocate message replications dynamically and solve the problem of selecting the relay node blindly. Compared with the classical routing protocols, the simulation results show that the proposed algorithm can significantly enhance delivery rate and improve network performance.

[1]  Jie Wu,et al.  LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[2]  Radim Bartos,et al.  Energy efficient Reactive Store-and-Forward protocol for intermittently connected networks , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[3]  Pan Hui,et al.  Promoting tolerance for delay tolerant network research , 2008, CCRV.

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

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

[6]  Thrasyvoulos Spyropoulos,et al.  Putting contacts into context: mobility modeling beyond inter-contact times , 2011, MobiHoc '11.

[7]  Alessandro Puiatti,et al.  Probabilistic Routing Protocol for Intermittently Connected Mobile Ad hoc Network (PROPICMAN) , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[8]  Zhenfu Cao,et al.  A Probabilistic Misbehavior Detection Scheme toward Efficient Trust Establishment in Delay-Tolerant Networks , 2014 .

[9]  Jie Wang,et al.  An Adaptive Spray and Wait Routing Algorithm Based on Capability of Node in DTN , 2014 .

[10]  Song Guo,et al.  Exploiting Small World Properties for Message Forwarding in Delay Tolerant Networks , 2015, IEEE Transactions on Computers.

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

[12]  Xiaodong Lin,et al.  An Opportunistic Batch Bundle Authentication Scheme for Energy Constrained DTNs , 2010, 2010 Proceedings IEEE INFOCOM.

[13]  Milind R. Penurkar,et al.  Max-Util: A Utility-Based Routing Algorithm for a Vehicular Delay Tolerant Network Using Historical Information , 2016 .

[14]  Vinny Cahill,et al.  When TCP Breaks: Delay- and Disruption- Tolerant Networking , 2006, IEEE Internet Computing.