Data Replication in Cooperative Mobile Ad-Hoc Networks

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.

[1]  M. Archetti,et al.  Cooperation as a volunteer’s dilemma and the strategy of conflict in public goods games , 2009, Journal of evolutionary biology.

[2]  Bhaskar Krishnamachari,et al.  Comparison of replication strategies for content availability in C2P2 networks , 2005, MDM '05.

[3]  Narottam Chand,et al.  Efficient Cooperative Caching in Ad Hoc Networks , 2006, 2006 1st International Conference on Communication Systems Software & Middleware.

[4]  Oliver P. Waldhorst,et al.  Modeling epidemic information dissemination on mobile devices with finite buffers , 2005, SIGMETRICS '05.

[5]  Jeroen Weesie,et al.  Cost Sharing in a Volunteer's Dilemma , 1998 .

[6]  Bo Xu,et al.  Mobile Peer-to-Peer Data Dissemination with Resource Constraints , 2007, 2007 International Conference on Mobile Data Management.

[7]  Guohong Cao,et al.  Supporting Cooperative Caching in Ad Hoc Networks , 2006, IEEE Trans. Mob. Comput..

[8]  Sanjay Kumar Madria,et al.  A cooperative game theoretic approach for data replication in mobile ad-hoc networks , 2011, 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom).

[9]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[10]  Yeim-Kuan Chang,et al.  A Novel Cooperative Caching Scheme for Wireless Ad Hoc Networks: GroupCaching , 2007, 2007 International Conference on Networking, Architecture, and Storage (NAS 2007).

[11]  Anthony A. Maciejewski,et al.  A game theoretical data replication technique for mobile ad hoc networks , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[12]  Takahiro Hara,et al.  Data Replication Considering Power Consumption in Ad Hoc Networks , 2007, 2007 International Conference on Mobile Data Management.

[13]  Ben Y. Zhao,et al.  Energy consumption and conservation in mobile peer-to-peer systems , 2006, MobiShare '06.

[14]  Françoise Sailhan,et al.  Cooperative Caching in Ad Hoc Networks , 2003, Mobile Data Management.

[15]  M. Yamanaka,et al.  A replica distrubution scheme for location-dependent information on vehicular ad hoc networks , 2006, VANET '06.

[16]  Sanjay Kumar Madria,et al.  A Resource-Efficient Adaptive Caching Scheme for Mobile Ad Hoc Networks , 2010, 2010 29th IEEE Symposium on Reliable Distributed Systems.

[17]  Seungjoon Lee,et al.  Backbone construction in selfish wireless networks , 2007, SIGMETRICS '07.

[18]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.