Skip to main content
Log in

DF++ : an adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

The delegated forwarding (DF) curb transmissions by forwarding the message to a node that holds high quality value seen by the message. However, DF assumes infinite buffer space that is not possible in real time applications. In addition, quality value computation considers the encountering history and does not account for additional network parameters such as aging and transitive connectivity. In this paper, we have proposed a routing protocol called as DF++ that compute quality value based on probabilistic model used in PRoPHET protocol and forwards the message to current node by adaptive computation of available buffer space. We have compared performance of DF++ with DF, Epidemic and PRoPHET routing protocols. The proposed DF++ has higher delivery probability and fewer message drop and transmissions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Bansal, M., Rajput, R., Gupta, G.: Mobile ad hoc networking (MANET): routing protocol performance issues and evaluation considerations. Mobile Ad-hoc Network (MANET) Working Group, IETF (1998)

  2. Fall, K., Farrell, S.: DTN: an architectural retrospective. IEEE J. Sel. Areas Commun. 26(5), 828–836 (2008)

    Article  Google Scholar 

  3. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Single-copy routing in intermittently connected mobile networks. In: Proc. IEEE Conf. Sensor and Ad Hoc Communications and Networks (SECON). IEEE Press, New York (2004)

    Google Scholar 

  4. Shah, R.C., et al.: Data mules: modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Netw. 1(2–3), 215–233 (2003)

    Article  Google Scholar 

  5. Vahdat, A., Becker, D.: Epidemic Routing for Partially Connected Ad Hoc Networks. Citeseer, Princeton (2000)

    Google Scholar 

  6. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. ACM, New York (2005)

    Google Scholar 

  7. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility. IEEE Press, New York (2007)

    Google Scholar 

  8. Wang, G., Wang, B., Gao, Y.: Dynamic Spray and Wait Routing Algorithm with Quality of Node in Delay Tolerant Network. IEEE Press, New York (2010)

    Google Scholar 

  9. Soares, V.N., Rodrigues, J.J., Farahmand, F.: GeoSpray: a geographic routing protocol for vehicular delay-tolerant networks. Inf. Fusion (2011). doi:10.1016/j.inffus.2011.11.003

    Google Scholar 

  10. Prodhan, A.T.D., Kabir, R., Shoja, H.G.C.: TTL based routing in opportunistic networks. J. Netw. Comput. Appl. 34(5), 1660–1670 (2011)

    Article  Google Scholar 

  11. Zhang, J., Luo, G.: Adaptive spraying for routing in delay tolerant networks. Wirel. Pers. Commun. 66(1), 217–233 (2012)

    Article  Google Scholar 

  12. Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10(11), 1576–1589 (2011)

    Article  Google Scholar 

  13. Nelson, S.C., Bakht, M., Kravets, R.: Encounter-based routing in DTNs. In: INFOCOM. IEEE Press, New York (2009)

    Google Scholar 

  14. Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. In: Service Assurance with Partial and Intermittent Resources, pp. 239–254. Springer, Berlin Heidelberg (2004)

    Chapter  Google Scholar 

  15. Jathar, R., Gupta, A.: Probabilistic routing using contact sequencing in delay tolerant networks. In: Second International Conference on Communication Systems and Networks (COMSNETS). IEEE Press, New York (2010)

    Google Scholar 

  16. de Oliveira, E.C.R., de Albuquerque, C.V.N.: NECTAR: A DTN Routing Protocol Based on Neighborhood Contact History. ACM, New York (2009)

    Google Scholar 

  17. Srinivasa, S., Krishnamurthy, S.: CREST: an opportunistic forwarding protocol based on conditional residual time. In: 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON’09. IEEE Press, New York (2009)

    Google Scholar 

  18. Bulut, E., Geyik, S.C., Szymanski, B.K.: Conditional shortest path routing in delay tolerant networks. In: IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM). IEEE Press, New York (2010)

    Google Scholar 

  19. Gao, W., Cao, G.: On exploiting transient contact patterns for data forwarding in delay tolerant networks. In: 18th IEEE International Conference on Network Protocols (ICNP). IEEE Press, New York (2010)

    Google Scholar 

  20. Sandulescu, G., Nadjm-Tehrani, S.: Opportunistic DTN routing with window-aware adaptive replication. In: Proceedings of the 4th Asian Conference on Internet Engineering. ACM, New York (2008)

    Google Scholar 

  21. Elwhishi, A., Ho, P.H., Naik, S., Shihada, B.: Contention aware routing for intermittently connected mobile networks. In: AFIN 2011, The Third International Conference on Advances in Future Internet, pp. 8–15 (2011)

    Google Scholar 

  22. Abdelkader, T., et al.: A socially-based routing protocol for delay tolerant networks. In: Global Telecommunications Conference (GLOBECOM 2010). IEEE Press, New York (2010)

    Google Scholar 

  23. Lee, K., et al.: Max-contribution: on optimal resource allocation in delay tolerant networks. In: Proceedings IEEE INFOCOM. IEEE Press, New York (2010)

    Google Scholar 

  24. Yuan, Q., Cardei, I., Wu, J.: Predict and Relay: An Efficient Routing in Disruption-Tolerant Networks. IEEE Press, New York (2009)

    Google Scholar 

  25. Elwhishi, A., Ho, P.H., Naik, K., Shihada, B.: ARBR: adaptive reinforcement-based routing for DTN. In: IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), pp. 376–385. IEEE Press, New York (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sulma Rashid.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ayub, Q., Zahid, M.S.M., Rashid, S. et al. DF++ : an adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network. Cluster Comput 17, 1465–1472 (2014). https://doi.org/10.1007/s10586-013-0331-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-013-0331-2

Keywords

Navigation