Skip to main content
SpringerLink
Log in

Extension of Delay Tolerant Network’s Routing Protocols for Preventing Excessive Utilization of Resources

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The routing algorithms of DTN have the inbuilt storage management scheme such as Hop based TTL (Spray and Wait) or passive cure (Potential-based Entropy Adaptive Routing PEAR). There has been a significant amount of work in the past regarding buffer management policies. In this paper, we have proposed a new message deletion policy for multi-copy routing schemes. In this scheme, message delivery information is communicated to the other nodes in the network for removing useless bundles from the network, which prevents the nodes from the buffer overflow problem and avoid transfer of useless message replicas thus relaxing the resources of the nodes. We evaluate our proposed method by simulating network, on four major DTNs routing algorithms: Epidemic, Spray and Wait, ProPHET and MaxProp. The simulation results clearly show significant improvement in the value of delivery probability and the overhead ratio for an Epidemic, Spray and Wait, and Prophet routing protocols.

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

Access this article

Log in via an institution

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
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Khabbaz, M., Assi, C., & Fawaz, W. (2011). Disruption-tolerant networking: A comprehensive survey on recent developments and persisting challenges. Communications Surveys & Tutorials, IEEE, PP(99), 1–34.

    Google Scholar 

  2. Yu, H.-Z., Ma, J.-F., & Bian, H. (2011). Message redundancy removal of multi-copy routing in delay tolerant MANET. The Journal of China Universities of Posts and Telecommunications, 18(1), 42–48.

    Article  Google Scholar 

  3. Lindgren, A., Doria, A., & Schel, O. (2003). Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing and Communications Review, 7(3), 19–20.

    Article  Google Scholar 

  4. Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. SIGMOBILE Computing and Communications Review, 34(4), 145–158.

    Article  Google Scholar 

  5. Burleigh, S., Hooke, A., Torgerson, L., et al. (2003). Delay-tolerant networking: An approach to interplanetary Internet. IEEE Communications Magazine, 41(6), 128–136.

    Article  Google Scholar 

  6. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. Single-copy routing in intermittently connected mobile networks. pp. 235–244.

  7. Wenrui, Z., & Ammar, M. H. Message ferrying: Proactive routing in highly-partitioned wireless ad hoc networks. pp. 308–314.

  8. Sarafijanovic-Djukic, N., Grossglauser, M., & Mitrou, N., et al. (2004). Last encounter routing under random waypoint mobility NETWORKING 2004. Networking technologies, services, and protocols; performance of computer and communication networks; mobile and wireless communications, Lecture Notes in Computer Science, pp. 974–988: Berlin, Heidelberg: Springer.

  9. Zhao, W., Ammar, M., & Zegura, E. (2004). A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing (pp. 187–198). Tokyo, Japan: Roppongi Hills.

  10. Burns, B., Brock, O., & Levine, B. N. (2005, March). MV routing and capacity building in disruption tolerant networks. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE (Vol. 1, pp. 398–408). IEEE.

  11. Yang, J., Chen, Y., Ammar, M., & Lee, C. (2005, March). Ferry replacement protocols in sparse manet message ferrying systems. In Wireless communications and networking conference, 2005 IEEE(Vol. 4, pp. 2038–2044). IEEE.

  12. Zhao, W., Ammar, M., & Zegura, E. (2005, March). Controlling the mobility of multiple date transport ferries in a delay-tolerant network. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE (Vol. 2, pp. 1407–1418). IEEE.

  13. Shah, R. C., Roy, S., Jain, S., et al. (2003). Data MULEs: Modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 1(2–3), 215–233.

    Article  Google Scholar 

  14. Glance, N., Snowdon, D., & Meunier, J.-L. (2001). Pollen: Using people as a communication medium. Computer Networks, 35(4), 429–442.

    Article  Google Scholar 

  15. Beaufour, A., Leopold, M., & Bonnet, P. (2002). Smart-tag based data dissemination. In Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications. Georgia, USA: Atlanta.

  16. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks.

  17. Chen, X., & Murphy, A. L. Enabling disconnected transitive communication in mobile ad hoc networks.

  18. Grossglauser, M., & Tse, D. N. C. (2002). Mobility increases the capacity of ad hoc wireless networks. Networking, IEEE/ Acm Transactions On, 10(4), 477–486.

    Google Scholar 

  19. Juang, P., Oki, H., Wang, Y., et al. (2002). Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. SIGARCH Computer Architecture News, 30(5), 96–107.

    Article  Google Scholar 

  20. Dubois-Ferriere, H., Grossglauser, M., & Vetterli, M. (2003). Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing. Maryland, USA: Annapolis.

  21. Li, Q., & Rus, D. (2003). Communication in disconnected ad hoc networks using message relay. Journal of Parallel and Distributed Computing, 63(1), 75–86.

    Article  MATH  Google Scholar 

  22. Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., et al. (1999). The broadcast storm problem in a mobile ad hoc network. In Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking. Washington, United States: Seattle.

  23. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. Philadelphia, Pennsylvania, USA, 2005, pp. 252–259.

  24. James, A. D. Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks. pp. 141–141.

  25. Grossglauser, M., & Vetterli, M. Locating nodes with EASE: Last encounter routing in ad hoc networks through mobility diffusion. vol. 3. pp. 1954–1964.

  26. Burgess, J., Gallagher, B., Jensen, D., et al. MaxProp: Routing for vehicle-based disruption-tolerant networks. pp. 1–11.

  27. Balasubramanian, A., Levine, B., & Venkataramani, A. (2007). DTN routing as a resource allocation problem. SIGCOMM Computer Communication Review, 37(4), 373–384.

    Article  Google Scholar 

  28. Leguay, I., Friedman, T., & Conan, V., (2005). DTN routing in a mobility pattern space. In Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking (pp. 276–283). Philadelphia: Pennsylvania, USA.

  29. Musolesi, M., Hailes, S., & Mascolo, C. Adaptive routing for intermittently connected mobile ad hoc networks. pp. 183–189.

  30. Ghosh, J., Ngo, H. Q., & Qiao, C. (2006). Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN). In Proceedings of the 2006 international conference on Wireless communications and mobile computing. British Columbia, Canada: Vancouver.

  31. Lei, T., Qunwei, Z., Jun, L., et al. SMART: A selective controlled-flooding routing for delay tolerant networks. pp. 356–365.

  32. Ramanathan, R., Hansen, R., Basu, P., et al. (2007). Prioritized epidemic routing for opportunistic networks. In Proceedings of the 1st international MobiSys workshop on mobile opportunistic networking (pp. 62–66). Puerto Rico: San Juan.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, DR B R Ambedkar National Institute of Technology, Jalandhar, India

    Harminder Singh Bindra & A. L. Sangal

Authors
  1. Harminder Singh Bindra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. L. Sangal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Harminder Singh Bindra.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bindra, H.S., Sangal, A.L. Extension of Delay Tolerant Network’s Routing Protocols for Preventing Excessive Utilization of Resources. Wireless Pers Commun 73, 535–553 (2013). https://doi.org/10.1007/s11277-013-1201-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1201-1

Keywords

Search

Navigation