Routing in Delay Tolerant Networks Using Credit Based Spraying

The Delay Tolerant Network (DTN) is a binder for regional heterogeneous networks. Nodes in DTN rely on intermittent contacts between themselves to deliver packets. The key to improve performance in DTNs is to design a superior number of deportation fortuities. A considerable number of different routing strategies for DTN environment to route information in such decentralized scenarios have been proposed like the Epidemic Routing, Spray and Wait, etc. Routing in such environment should be effective of achieving high receivable rate with minimalistic overhead. In this paper we aim to achieve a high receivable rate keeping the number of message duplication to a significant low. We propose a routing strategy using credit distribution. This routing protocol improves delivery capability by replicating messages where it is advantageous. It provides a better way of message delivery in challenged environments and a suitable, efficient technique of solving certain prime issues of cost overhead, replication and loss of messages. To ascertain our claims, we have done simulations and compared our proposed approach with few of the notable existing protocols and the results manifest that our approach satisfies its objectives.

[1]  E. Jones Routing Strategies for Delay-Tolerant Networks , 2006 .

[2]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[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]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[6]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

[7]  Yin Zhang,et al.  Incentive-aware routing in DTNs , 2008, 2008 IEEE International Conference on Network Protocols.

[8]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[9]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

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

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

[12]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Paolo Santi,et al.  A Framework for Routing Performance Analysis in Delay Tolerant Networks with Application to Noncooperative Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[14]  Boleslaw K. Szymanski,et al.  Conditional shortest path routing in delay tolerant networks , 2010, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

[15]  Li Li,et al.  Practical Routing in Delay-Tolerant Networks , 2007, IEEE Trans. Mob. Comput..

[16]  Timur Friedman,et al.  DTN routing in a mobility pattern space , 2005, WDTN '05.

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