Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Sleepers and workaholics: caching strategies in mobile environments
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Data replication for mobile computers
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Bit-sequences: an adaptive cache invalidation method in mobile client/server environments
Mobile Networks and Applications
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Incremental Cache Coherency Schemes in Mobile Computing Environments
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Energy-Efficient Caching for Wireless Mobile Computing
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Maintaining consistency of data in mobile distributed environments
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
An Overview of Data Replication on the Internet
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Replica allocation methods in ad hoc networks with data update
Mobile Networks and Applications
A Powerful Direct Mechanism for Optimal WWW Content Replication
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
RAMM: A Game Theoretical Replica Allocation and Management Mechanism
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Distributed Database Replication — A Game Theory?
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A Novel Way of Determining the Optimal Location of a Fragment in a DDBS: BGBR
ICSNC '06 Proceedings of the International Conference on Systems and Networks Communication
Optimal File Allocation in a Multiple Computer System
IEEE Transactions on Computers
Routing in Ad Hoc Networks of Mobile Hosts
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
Allocation of copies of a file in an information network
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A Pure Nash Equilibrium-Based Game Theoretical Method for Data Replication across Multiple Servers
IEEE Transactions on Knowledge and Data Engineering
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Due to the continuous mobility of hosts, an ad hoc network suffers from frequent disconnections. This phenomenon is undesirable when mobile hosts are accessing data from each other, and thus, data accessibility is lower than that in conventional fixed networks. Because one cannot control network disconnections, an alternative solution to this problem is to replicate data objects onto mobile hosts so that when disconnections occur, mobile hosts can still access data. In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. We prove that this problem in general is NP-complete and propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative environment to improve data accessibility by replicating data objects. The technique incorporates the access frequency from mobile hosts to each data object, the status of the network connectivity, and communication costs. In the proposed scheme, players (mobile hosts) compete through bids in a non-cooperative environment to replicate data objects that are beneficial to themselves and the system as a whole. To cater for the possibility of cartel type behavior of the players, the scheme uses the Vickrey payment protocol that leaves the players with no option than to bid in such a fashion that is beneficial to the system as a whole. The paper also identifies some useful properties of the proposed scheme and the necessary conditions of optimality. The proposed technique is extensively evaluated against some well-known ad hoc network replica allocation methods, such as: (a) randomized, (b) extended static access frequency, (c) extended dynamic access frequency and neighborhood, and (d) extended dynamic connectivity grouping. The experimental results reveal that the proposed approach outperforms the four techniques in solution quality and projects a competitive execution time.