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) exten...

• Type: Conference
• Year: 2008
• Where: IPPS
• Authors: Samee Ullah Khan, Anthony A. Maciejewski, Howard Jay Siegel, Ishfaq Ahmad
• Keywords: Ad Hoc Network, Distributed And Parallel Computing, IPPS 2008, Mobile Ad Hoc Network, Mobile Servers