We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
Reseach Article

Distributed Cooperative Caching Strategies in Wireless Ad Hoc Networks

by B. Rajkumar Rathod, G. Narsimha
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 57 - Number 10
Year of Publication: 2012
Authors: B. Rajkumar Rathod, G. Narsimha
10.5120/9151-3403

B. Rajkumar Rathod, G. Narsimha . Distributed Cooperative Caching Strategies in Wireless Ad Hoc Networks. International Journal of Computer Applications. 57, 10 ( November 2012), 20-25. DOI=10.5120/9151-3403

@article{ 10.5120/9151-3403,
author = { B. Rajkumar Rathod, G. Narsimha },
title = { Distributed Cooperative Caching Strategies in Wireless Ad Hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 57 },
number = { 10 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 20-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume57/number10/9151-3403/ },
doi = { 10.5120/9151-3403 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:00:05.386888+05:30
%A B. Rajkumar Rathod
%A G. Narsimha
%T Distributed Cooperative Caching Strategies in Wireless Ad Hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 57
%N 10
%P 20-25
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Wireless devices have scarcity of resources such as storage capacity and processing power. For WANETs, cooperative caching strategies are proposed in this paper to improve efficiency in information exchange in peer-to-peer fashion. The caching strategies such as small sized caches and large sized caches depend on the estimation of density of information being flown in the network. In the former strategy content replacement takes place when new information is received while in the latter a decision is made as to whether the information is to be cached and for how long. In either case every node is capable of deciding as per the content in the caches of near by nodes. This is to ensure that each node has different content that is content diversity and share the content of other nodes thus managing memory efficiently. The simulations made using NS2 show that our caching strategies are capable of making expected content diversity and improve performance of information sharing in wireless ad hoc network.

References
  1. A. Lindgren and P. Hui, "The quest for a killer app for opportunistic anddelay-tolerant networks," in Proc. ACM CHANTS, 2009, pp. 59–66.
  2. P. Padmanabhan, L. Gruenwald, A. Vallur, and M. Atiquzzaman, "A surveyof data replication techniques for mobile ad hoc network databases,"VLDB J. , vol. 17, no. 5, pp. 1143–1164, Aug. 2008.
  3. A. Derhab and N. Badache, "Data replication protocols for mobile ad hocnetworks: A survey and taxonomy," IEEE Commun. Surveys Tuts. , vol. 11,no. 2, pp. 33–51, Second Quarter, 2009.
  4. B. -J. Ko and D. Rubenstein, "Distributed self-stabilizing placement of replicated resources in emerging networks," IEEE/ACM Trans. Netw. ,vol. 13, no. 3, pp. 476–487, Jun. 2005.
  5. G. Cao, L. Yin, and C. R. Das, "Cooperative cache-based data access inad hoc networks," Computer, vol. 37, no. 2, pp. 32–39, Feb. 2004.
  6. C. -Y. Chow, H. V. Leong, and A. T. S. Chan, "GroCoca: Group-basedpeer-to-peer cooperative caching in mobile environment," IEEE J. Sel. AreasCommun. , vol. 25, no. 1, pp. 179–191, Jan. 2007.
  7. T. Hara, "Cooperative caching by mobile clients in push-based informationsystems," in Proc. CIKM, 2002, pp. 186–193.
  8. L. Yin and G. Cao, "Supporting cooperative caching in ad hoc networks,"IEEE Trans. Mobile Comput. , vol. 5, no. 1, pp. 77–89, Jan. 2006.
  9. N. Dimokas, D. Katsaros, and Y. Manolopoulos, "Cooperative caching inwireless multimedia sensor networks," ACM Mobile Netw. Appl. , vol. 13, no. 3/4, pp. 337–356, Aug. 2008.
  10. Y. Du, S. K. S. Gupta, and G. Varsamopoulos, "Improving on-demand dataaccess efficiency in MANETs with cooperative caching," Ad Hoc Netw. ,vol. 7, no. 3, pp. 579–598, May 2009.
  11. Y. Zhang, J. Zhao, and G. Cao, "Roadcast: A popularity-aware contentsharing scheme in VANETs," in Proc. IEEE Int. Conf. Distrib. ComputSyst. , Los Alamitos, CA, 2009, pp. 223–230.
  12. E. Cohen and S. Shenker, "Replication strategies in unstructured peer-topeernetworks," in Proc. ACM SIGCOMM, Aug. 2002, pp. 177–190.
  13. B. Tang, H. Gupta, and S. Das, "Benefit-based data caching in ad hocnetworks," IEEE Trans. Mobile Comput. , vol. 7, no. 3, pp. 289–304,Mar. 2008.
  14. W. Li, E. Chan, and D. Chen, "Energy-efficient cache replacement policiesfor cooperative caching in mobile ad hoc network," in Proc. IEEE WCNC,Kowloon, Hong Kong, Mar. 2007, pp. 3347–3352.
  15. M. K. Denko and J. Tian, "Cross-layer design for cooperative cachingin mobile ad hoc networks," in Proc. IEEE CCNC, Las Vegas, NV,Jan. 2008, pp. 375–380.
  16. H. Chen, Y. Xiao, and X. Shen, "Update-based cache replacement policiesin wireless data access," in Proc. BroadNets, Boston, MA, Oct. 2005,pp. 797–804.
  17. J. Xu, Q. Hu, W. -C. Lee, and D. L. Lee, "Performance evaluation of anoptimal cache replacement policy for wireless data dissemination," IEEETrans. Knowl. Data Eng. , vol. 16, no. 1, pp. 125–139, Jan. 2004.
  18. J. Cao, Y. Zhang, G. Cao, and L. Xie, "Data consistency for cooperativecaching in mobile environments," Computer, vol. 40, no. 4, pp. 60–66,Apr. 2007.
  19. N. Dimokas, D. Katsaros, and Y. Manolopoulos, "Cache consistency in wireless multimedia sensor networks," Ad Hoc Netw. , vol. 8, no. 2, pp. 214–240, Mar. 2010.
  20. K. Chen, S. H. Shah, and K. Nahrstedt, "Cross-layer design for data accessibilityin mobile ad hoc networks," Wireless Pers. Commun. , vol. 21,no. 1, pp. 49–76, Apr. 2002.
  21. M. Fiore, C. Casetti, and C. -F. Chiasserini, "Information density estimationfor content retrieval in MANETs," IEEE Trans. Mobile Comput. , vol. 8, no. 3, pp. 289–303, Mar. 2009.
  22. T. Hara, "Replica allocation methods in ad hoc networks with data update,"ACM Mobile Netw. Appl. , vol. 8, no. 4, pp. 343–354, Aug. 2003.
  23. W. Li, E. Chan, D. Chen, and S. Lu, "Maintaining probabilistic consistencyfor frequently offline devices in mobile ad hoc networks," in Proc. IEEE ICDCS, Montreal, QC, Canada, Jun. 2009, pp. 215–222.
  24. M. Fiore, J. Haerri, F. Filali, and C. Bonnet, "Vehicular mobilitysimulation for VANETs," in Proc. IEEE ANSS, Norfolk, VA, Mar. 2007,pp. 301–309.
  25. E. M. Royer, P. M. Melliar-Smith, and L. E. Moser, "An analysis of theoptimum node density for ad hoc mobile networks," in Proc. IEEE ICC,Helsinki, Finland, Jun. 2001, pp. 857–861.
Index Terms

Computer Science
Information Sciences

Keywords

Cooperative caching content diversity wireless ad hoc networks