A game theoretical data replication technique for mobile ad hoc networks

Adaptive replication of data items on servers of a mobile ad hoc network can alleviate access delays. The selection of data items and servers requires solving a constrained optimization problem, that is in general NP-complete. The problem is further complicated by frequent partitions of the ad hoc network. In this paper, a mathematical model for data replication in ad hoc networks is formulated. We treat the mobile servers in the ad hoc network as self-interested entities, hence they have the capability to manipulate the outcome of a resource allocation mechanism by misrepresenting their valuations. We design a game theoretic "truthful" mechanism in which replicas are allocated to mobile servers based on reported valuations. We sketch the exact properties of the truthful mechanism and derive a payment scheme that suppresses the selfish behavior of the mobile servers. The proposed technique is extensively evaluated against three ad hoc network replica allocation methods: (a) extended static access frequency, (b) extended dynamic access frequency and neighborhood, and (c) extended dynamic connectivity grouping. The experimental results reveal that the proposed approach outperforms the three techniques in solution quality and has competitive execution times.

[1]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[2]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[3]  Ishfaq Ahmad,et al.  A pure Nash equilibrium guaranteeing game theoretical replica allocation method for reducing Web access time , 2006, 12th International Conference on Parallel and Distributed Systems - (ICPADS'06).

[4]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[5]  Anthony T. Chronopoulos,et al.  Algorithmic mechanism design for load balancing in distributed systems , 2002, Proceedings. IEEE International Conference on Cluster Computing.

[6]  Takahiro Hara,et al.  Dynamic Data Replication Using Aperiodic Updates in Mobile Adhoc Networks , 2004, DASFAA.

[7]  Vincenzo Grassi.  Prefetching policies for energy saving and latency reduction in a wireless broadcast data delivery system , 2000, MSWIM '00.

[8]  Wesley W. Chu,et al.  Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[9]  Ishfaq Ahmad,et al.  Evolutionary Algorithms for Allocating Data in Distributed Database Systems , 2004, Distributed and Parallel Databases.

[10]  Ishfaq Ahmad,et al.  Design and Evaluation of Data Allocation Algorithms for Distributed Multimedia Database Systems , 1996, IEEE J. Sel. Areas Commun..

[11]  Éva Tardos,et al.  Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  Howard Jay Siegel,et al.  An Analysis of Procedures and Objective Functions for Heuristics to Perform Data Staging in Distributed Systems , 2006, J. Interconnect. Networks.

[13]  Ishfaq Ahmad,et al.  Discriminatory Algorithmic Mechanism Design Based WWW Content Replication , 2007, Informatica.

[14]  Laurent Pautet,et al.  GLADE: a framework for building large object-oriented real-time distributed systems , 2000, Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607).

[15]  K. Arrow.  A Difficulty in the Concept of Social Welfare , 1950, Journal of Political Economy.

[16]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[17]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[18]  Éva Tardos,et al.  An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.

[19]  Werner Hildenbrand,et al.  Advances in Economic Theory , 1983 .

[20]  Takahiro Hara,et al.  Replica Allocation Methods in Ad Hoc Networks with Data Update , 2003, Mob. Networks Appl..

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Wang Heng-jun.  Routing in AD HOC Networks of Mobile Hosts , 2002 .

[23]  Ishfaq Ahmad,et al.  Optimizing download time of embedded multimedia objects for Web browsing , 2004, IEEE Transactions on Parallel and Distributed Systems.

[24]  Margo I. Seltzer,et al.  The case for geographical push-caching , 1995, Proceedings 5th Workshop on Hot Topics in Operating Systems (HotOS-V).

[25]  Ishfaq Ahmad,et al.  Replicating Data Objects in Large-scale Distributed Computing Systems using Extended Vickrey Auction , 2007 .

[26]  David C. Parkes,et al.  Hard-to-Manipulate Combinatorial Auctions , 2004 .

[27]  Ishfaq Ahmad,et al.  A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[28]  A. Prasad Sistla,et al.  Data replication for mobile computers , 1994, SIGMOD '94.

[29]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[30]  Ishfaq Ahmad,et al.  A powerful direct mechanism for optimal WWW content replication , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[31]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[32]  A. Gibbard.  Manipulation of Voting Schemes: A General Result , 1973 .

[33]  Ahmed K. Elmagarmid,et al.  Bit-Sequences: An adaptive cache invalidation method in mobile client/server environments , 1997, Mob. Networks Appl..

[34]  Takahiro Hara,et al.  Effective replica allocation in ad hoc networks for improving data accessibility , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[35]  Edwin K. P. Chong,et al.  Heuristics for Scheduling Data Requests Using Collective Communications in a Distributed Communication Network , 2001, J. Parallel Distributed Comput..

[36]  Éva Tardos,et al.  Frugal path mechanisms , 2002, SODA '02.

[37]  Nikolaos Laoutaris,et al.  Distributed Selfish Replication , 2006, IEEE Transactions on Parallel and Distributed Systems.