Contact-based routing in DTNs

Multi-copy replication is an efficient approach for routing a message between a pair of source and destination nodes in a Delay Tolerant Network (DTN). However, such an approach disseminates an undesirable number of replicas of messages, which increases the overhead of the network. To restrain this, disparate routing techniques have evolved that limit the number of copies of the messages. However, in these schemes a message stays undesirably long in the buffer of a node. To address this issue, we propose a contact-based routing algorithm for DTNs that minimizes the average message buffer time of a node, while maintaining a targeted message delivery ratio compared to the existing state-of-the-art routing protocols. Simulation results show that the average message buffer time reduces upto one fourth from the existing quota-based schemes, and the message delivery ratio improves upto 18% over the well-known flooding based schemes.

[1]  Maode Ma,et al.  CCS-DTN: Efficient routing in social DTNs based on clustering and network coding , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[2]  Christophe Diot,et al.  CRAWDAD dataset cambridge/haggle (v.2006-01-31) , 2006 .

[3]  Jörg Widmer,et al.  Network coding for efficient communication in extreme networks , 2005, WDTN '05.

[4]  Pan Hui,et al.  CRAWDAD dataset cambridge/haggle (v.2009-05-29) , 2009 .

[5]  Dongkyun Kim,et al.  HVR: History-Based Vector Routing for Delay Tolerant Networks , 2009, 2009 Proceedings of 18th International Conference on Computer Communications and Networks.

[6]  Hemal Shah,et al.  CHBR: Contact History Based Routing in Time Varying Approach , 2014, BIOINFORMATICS 2014.

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

[8]  Arun Venkataramani,et al.  Replication Routing in DTNs: A Resource Allocation Approach , 2010, IEEE/ACM Transactions on Networking.

[9]  Robin Kravets,et al.  Encounter: based routing in DTNs , 2009, MOCO.

[10]  Amarsinh Vidhate,et al.  Routing in Delay Tolerant Network , 2016 .

[11]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

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

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

[14]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[15]  Vijay Erramilli,et al.  Diversity of forwarding paths in pocket switched networks , 2007, IMC '07.

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

[17]  Julinda Stefa,et al.  Give2Get: Forwarding in Social Mobile Wireless Networks of Selfish Individuals , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

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

[19]  Jie Wu,et al.  Social feature-based multi-path routing in delay tolerant networks , 2012, 2012 Proceedings IEEE INFOCOM.

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

[21]  Oliver Brock,et al.  MV routing and capacity building in disruption tolerant networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[22]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.