A Competitive Replica Placement Methodology for Ad Hoc Networks

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 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. The proposed technique is extensively evaluated against four well-known ad hoc network replica allocation methods. The experimental results reveal that the proposed approach outperforms the four techniques in both the execution time and solution quality.

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

[2]  Tomasz Imielinski,et al.  Sleepers and workaholics: caching strategies in mobile environments , 1994, SIGMOD '94.

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

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

[5]  David C. Parkes,et al.  Hard-to-Manipulate VCG-Based Auctions , 2004 .

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

[7]  Takahiro Hara,et al.  Replica allocation in ad hoc networks with periodic data update , 2002, Proceedings Third International Conference on Mobile Data Management MDM 2002.

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

[9]  Bharat K. Bhargava,et al.  Maintaining consistency of data in mobile distributed environments , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[10]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

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

[12]  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).

[13]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[14]  Beng Chin Ooi,et al.  On incremental cache coherency schemes in mobile computing environments , 1997, Proceedings 13th International Conference on Data Engineering.

[15]  Philip S. Yu,et al.  Energy-efficient caching for wireless mobile computing , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[16]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.