Efficient PROPHET with Buffer Management for Multicasting in DTN

Delay Tolerant Network (DTN) have materialized as a solution to networks that experience persistent partition. Owing to intermittent connectivity finding schemes in multicasting is more complex problem than as compared to mobile ad hoc networks (MANETS). Multicasting in DTN finds its application in varied regions such as in battlefields, catastrophes, deep space communication, etc. For routing DTN uses store, carry and forward technique to transfer the data. Some of the multicasting techniques already proposed utilizes the history information of the nodes to forward the data. Such schemes require better scheduling and needs buffer management. Earlier proposed buffer management techniques show better result in messages unicasting but don't give promising solution in multicasting techniques. In this paper we are proposing an improved Prophet Protocol multicasting in DTN environment. The proposed Protocol has been enhanced by introducing a utility function for prioritizing the messages in buffer beside, choosing the relay node based on the probability of the nodes meeting in future.

[1]  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..

[2]  Chih-Lin Hu,et al.  Enhanced Buffer Management for Data Delivery to Multiple Destinations in DTNs , 2016, IEEE Transactions on Vehicular Technology.

[3]  Thrasyvoulos Spyropoulos,et al.  Message Drop and Scheduling in DTNs: Theory and Practice , 2012, IEEE Transactions on Mobile Computing.

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

[5]  Jie Wu,et al.  A non-replication multicasting scheme in delay tolerant networks , 2010, The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010).

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

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

[8]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM 2007.

[9]  Laura Galluccio,et al.  Sociality-Aided New Adaptive Infection Recovery Schemes for Multicast DTNs , 2016, IEEE Transactions on Vehicular Technology.

[10]  Mooi Choo Chuah,et al.  An encounter-based multicast scheme for disruption tolerant networks , 2009, Comput. Commun..

[11]  Wing Cheong Lau,et al.  Forwarding and Replication Strategies for DTN with Resource Constraints , 2007, 2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring.

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

[13]  Jie Wu,et al.  Multi-Copy Routing with Trajectory Prediction in Social Delay-Tolerant Networks , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

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

[15]  Brian D. Davison,et al.  OS-multicast: On-demand Situation-aware Multicasting in Disruption Tolerant Networks , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[16]  Augusto Casaca,et al.  Multicast in Delay Tolerant Networks Using Probabilities and Mobility Information , 2009, Ad Hoc Sens. Wirel. Networks.

[17]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[18]  Mario Gerla,et al.  A two-level multicast routing strategy for delay tolerant networks , 2015, 2015 14th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET).

[19]  Bo Zong,et al.  Efficient multicasting for delay tolerant networks using graph indexing , 2012, 2012 Proceedings IEEE INFOCOM.

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