Skip to main content
Log in

Adaptive Backbone Based Cooperative Caching in Mobile Ad hoc Networks

  • Published:
International Journal of Wireless Information Networks Aims and scope Submit manuscript

Abstract

Existing cooperative caching algorithms for mobile ad hoc networks face serious challenges due to message overhead and scalability issues. To solve these issues, we propose an adaptive virtual backbone based cooperative caching that uses a connective dominating set (CDS) to find the desired location of cached data. Message overhead in cooperative caching is mainly due to cache lookup process used for cooperative caching. The idea in this scheme is to reduce the number of nodes involved in cache look up process, by constructing a virtual backbone adaptive to the dynamic topology in mobile ad hoc networks. The proposed algorithm is decentralized and the nodes in the CDS perform data dissemination and discovery. Simulation results show that the message overhead created by the proposed cooperative caching technique is very less compared to other approaches. Moreover, due to the CDS based cache discovery we applied in this work, the proposed cooperative caching has the potential to increase the cache hit ratio and reduce average delay.

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

Similar content being viewed by others

References

  1. G. Cao and L. Yin, Supporting cooperative caching in ad hoc networks, IEEE Transactions on MobileComputing, Vol. 5, No. 1, pp. 77–89, 2006.

    Google Scholar 

  2. C. Casetti, C. Chiasserini, M. Fiore, and F. Mininni, To Cache or not to Cache, In: Proceeding of IEEE International Conference on Computer Communications, 2009.

  3. Hassan Artail et.al, “COACS: A cooperative and adaptive caching system for MANETs”, IEEE Transactions on Mobile Computing, Vol. 7, No. 8, pp. 961–977, 2008.

  4. G. Cao, C. R. Das, W. C. Lee and S. Lim, A novel caching scheme for improving Internet-based mobile ad hoc networks performance, Ad Hoc Networks, Vol. 4, No. 2, p. 225, 2006.

    Article  Google Scholar 

  5. Preetha Theresa Joy and K. Poulose Jacob, “A Key Based Cache Replacement Policy for Cooperative Caching in Mobile Ad hoc Networks”, 3rd International Advance Computing Conference (IACC), 2013, pp. 383-387.

  6. S. Das, H. Gupta and B. Tang, Benefit-based data caching in ad hoc networks, In: Proc. of ICNP, SantaBarbara, California, 2006.

  7. T. Hara, Effective replica allocation in ad hoc networks for improving data accessibility, In: Proc. of INFOCOM, 2001.

  8. Y. Du and Gupta, S. K. S. “COOP-A cooperative caching service in MANETs,” In: Proc. Joint Int. Conf Autonomic and Autonomous Systems and Int. Conf. Networking and Services, pp. 58–63, (2005).

  9. N. Chand, R. C. Joshi and M. Misra, Cooperative caching strategy in mobile Ad Hoc Networks based on clusters, Wireless Personal Communications, Vol. 43, pp. 41–63, 2007.

    Article  Google Scholar 

  10. Yeim-Kuan Chang, and Yi-Wei Ting, A novel cooperative caching scheme for wireless ad hoc networks: Group caching, In NAS’07: Proceedings of the International Conference on Networking, Architecture, and Storage, (2007).

  11. Dan Hirsch, and Sanjay Madria, “A Resource- efficient adaptive caching scheme for mobile Ad-Hoc Networks”, In: 29th IEEE International Symposium on Reliable Distributed Systems.(2010).

  12. Y. Du, S. Gupta, and G. Varsamopoulos, Improving on-demand data access efficiency in MANETs with cooperative caching, Ad Hoc Networks pp. 579–598 (2009).

  13. A. Chan, C. Chow, and H. Leong, GroCoca: Group-based peer-to-peer cooperative caching in mobile environments, IEEE Journal on Selected Areas in Communications Vol. 25, No. 1, (2007).

  14. M. Taghizadeh, A. Plummer, and S. Biswas, “Cooperative caching for improving availability in social wireless networks”, In: Proc. of IEEE 7th International conference on Mobile Ad hoc and Wireless Systems (MASS), pp. 342–351, 2010.

  15. A. Jamalipour, and Y. Ma, A cooperative cache-based content delivery framework for intermittently connected mobile ad hoc networks, IEEE Transactions on Wireless Communications, Vol. 9, No. 1, pp. 366–373, (2010).

  16. J. Chen, W. Lai, and Y. Lin, Effects of cache mechanism on wireless data access, IEEE Transactions on Wireless Communications, Vol. 2, No. 6, pp. 1247–1258, (2003).

  17. S. Rao, A. W. Seah and Valera, Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing, IEEE Transactions on Mobile Computing, Vol. 4, No. 5, pp. 443–457, 2005.

    Article  Google Scholar 

  18. M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman and CompanySan Francisco, 1979.

    MATH  Google Scholar 

  19. K.M. Alzoubi, O. Frieder and P.-J. Wan, Distributed construction of connected dominating set in wireless Ad Hoc Networks, IEEE INFOCOM, pp. 1597–1604, 2002.

  20. K. Poulose Jacob, and Preetha Theresa Joy, “A location aided cooperative caching protocol for mobile Ad hoc Networks”, In: 6th IEEE International Conference on Advanced Infocomm Technology, Taiwan, 2013.

  21. Joonho Cho, et al., Neighbor caching in multi-hop wireless ad hoc networks, IEEE Communications Letters, Vol. 7, No. 11, pp. 525–527, 2003.

    Article  Google Scholar 

  22. Gonzalez, et. al. “A cross layer interception and redirection cooperative caching scheme for MANETs”, EURASIP Journal on Wireless Communications and Networking, pp. 1–21, 2012.

  23. B. Clark, C. Colbourn, and D. Johnson,\Unit disk graphs, “Discrete Mathematics, Vol. 86, No. 1–3, pp. 165–177, 1991.

  24. V. Bharghavan, and B. Das, “Routing in Ad Hoc Networks using minimum connected dominating sets”, In: International Conference on Communications’97, Montreal, Canada, 1997.

  25. F. Dai, and J. Wu, Distributed dominate pruning in ad hoc wireless networks, In: Proc. ICC, p. 353, 2003.

  26. H. Li, and J. Wu, On calculating connected dominating set for efficient routing in ad hoc wireless net-works, In: Proc. of the 3rd International workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14, 1999.

  27. X. Cheng, Ding, and G. Xue, Aggregation tree construction in sensor networks, In: Proc. of IEEE VTC, 2003.

  28. J. Broch, J. Jetcheva, Y. Hu, and D. Maltz, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” In: Proc. ACM MobiCom, 1998.

  29. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Sheker, “Web Caching and Zipf-Like Distributions: Evidence and Implications”, In: Proceedings of IEEE INFOCOM, pp. 126–134, 1999.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Preetha Theresa Joy.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Joy, P.T., Jacob, K.P. Adaptive Backbone Based Cooperative Caching in Mobile Ad hoc Networks. Int J Wireless Inf Networks 21, 306–316 (2014). https://doi.org/10.1007/s10776-014-0252-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10776-014-0252-x

Keywords

Navigation