[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content

Advertisement

Log in

Data Replication in Cooperative Mobile Ad-Hoc Networks

A Game Theoretic Replication Algorithm Using Volunteers’ Dilemma

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

The mobile computing environment provides many benefits such as ubiquitous access to computing but includes constraints on resources such as available bandwidth and battery life. Replication is a widely recognized method for balancing the demands of storage space with bandwidth and battery life. We propose a novel scheme that seeks to strategically balance these constrained resources through a cooperative game-theory approach for replication in a mobile environment. Our replication strategy relies on the cooperation of the nodes within the network to make replica caching decisions which are spatiotemporally local-optimal for the network from an energy and bandwidth conservation standpoint. In cooperative altruistic data replication, each node calculates the net global benefit, for caching a replica of the requested data, as the result data is returned from the responding node to the requesting node, where it determines the spatiotemporally local-optimal node for replicating the data item. Performance results from our research indicate that our scheme, CADR, improves the query response time by 25 and 45 %, mean hop count is improved by 26 and 46 %, query error is reduced by 30 and 48 %, while energy utilization is reduced 30 and 57 % when compared with both another game theoretic replication approach and standard cooperative caching respectively.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

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. Archetti M (2009) Cooperation as a volunteer’s delimma and the strategy of conflict in public. J Evol Biol 22(11):2192

    Article  Google Scholar 

  2. Chand N, Joshi RC, Misra J (2006) Efficient cooperative caching in ad hoc networks. In: Comsware 2006: first international conference on communication system software and middleware, pp 1–8

  3. Ghandeharizadeh S, Kapadia S, Krishnamachari B (2005) Comparison of replication strategies for content availability in c2p2 networks. In: MDM 2005: proceedings of the 6th international conference on Mobile Data Management, MDM ’05. ACM, New York, pp 107–115

    Google Scholar 

  4. Gurun S, Nagpurkar P, Zhao BY (2006) Energy consumption and conservation in mobile peer-to-peer systems. In: MobiShare 2006: proceedings of the 1st international workshop on decentralized resource sharing in mobile computing and networking. ACM, New York, pp 18–23

    Chapter  Google Scholar 

  5. Hara T, Madria SK (2006) Data replication for improving data accessibility in ad hoc networks. IEEE Trans Mob Comput 5(11):1515–1532

    Article  Google Scholar 

  6. Hirsch D, Madria S (2010) A resource-efficient adaptive caching scheme for mobile ad hoc networks. In: SRDS 2010: 29th IEEE symposium on reliable distributed systems, pp 64–71

  7. Hirsch D, Madria S (2011) A cooperative game theoretic approach for data replication in mobile ad-hoc cetworks. In: CollaborateCom 2011: 7th international conference on collaborative computing: networking, applications and worksharing (CollaborateCom), pp 115–124

  8. Johnson D, Maltz D (1996) Dynamic source routing in ad hoc wireless networks.Mobile Computing, Kluwer Academic Publishers, pp 153–181

  9. Khan SU, Maciejewski AA, Siegel HJ, Ahmad I (2008) A game theoretical data replication technique for mobile ad hoc networks. In: IPDPS 2008: IEEE international symposium on parallel and distributed processing, pp 1–12

  10. Lee S, Levin D, Gopalakrishnan V, Bhattacharjee B (2007) Backbone construction in selfish wireless networks. In: SIGMETRICS 2007: proceedings of the 2007 ACM SIGMETRICS international conference on measurement and modeling of computer systems, SIGMETRICS ’07. ACM, New York, pp 121–132

    Chapter  Google Scholar 

  11. Lindemann C, Waldhorst OP (2005) Modeling epidemic information dissemination on mobile devices with finite buffers. In: SIGMETRICS 2005: proceedings of the 2005 ACM SIGMETRICS international conference on measurement and modeling of computer systems. ACM, New York, pp 121–132

    Chapter  Google Scholar 

  12. Royer E, Chai-Keong T (1999) A review of current routing protocols for ad hoc mobile networks. IEEE Pers Commun 6(2):46–55

    Article  Google Scholar 

  13. Sailhan F, Issarny V (2003) Cooperative caching in ad hoc networks. In: MDM 2003: proceedings of the 4th international conference on mobile data management, pp 13–28

  14. Shinohara HT, Nishio MS (2007) Data replication considering power consumption in ad hoc networks. In: MDM 2007: proceedings of the 2007 international conference on mobile data management. IEEE Computer Society, Washington, DC, pp 118–125

    Chapter  Google Scholar 

  15. Ting YW, Chang Y-K (2007) A novel cooperative caching scheme for wireless ad hoc networks: groupcaching. In: NAS 2007: proceedings of the international conference on networking, architecture, and storage, pp 62–68

  16. Weesie J (1998) Cost sharing in a volunteer’s dilemma. J Confl Resolut 42(5):600

    Article  Google Scholar 

  17. Wolfson O, Xu B, Tanner RM (2007) Mobile peer-to-peer data dissemination with resource constraints. In: MDM 2007: proceedings of the 8th international conference on mobile data management, pp 16–23

  18. Yamanaka M, Tsuchida G, Ishihara S (2006) A replica distrubution scheme for location-dependent information on vehicular ad hoc networks. In: VANET 2006: proceedings of the 3rd international workshop on vehicular ad hoc networks, VANET ’06. ACM, New York, pp 98–99

    Chapter  Google Scholar 

  19. Yin L, Cao G (2006) Supporting cooperative caching in ad hoc networks. IEEE Trans Mob Comput 5(1):77–89

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sanjay Madria.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hirsch, D., Madria, S. Data Replication in Cooperative Mobile Ad-Hoc Networks. Mobile Netw Appl 18, 237–252 (2013). https://doi.org/10.1007/s11036-012-0393-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-012-0393-z

Keywords

Navigation