Replica allocation in ad hoc networks with periodic data update

Recent advances in computer and wireless communication technologies have led to an increasing interest in ad hoc networks which are temporarily constructed by only mobile hosts. In ad hoc networks, since mobile hosts move freely, disconnections occur frequently, and this causes frequent network division. Consequently, data accessibility in ad hoc networks is lower than that in the conventional fixed networks. Assuming an environment where each data item is periodically updated, we propose three replica allocation methods to improve data accessibility by replicating data items on mobile hosts. In these three methods, we take into account the access frequency from mobile hosts to each data item, the status of the network connection, and the time remaining until each item is updated next. We also show the results of simulation experiments regarding the performance evaluation of our proposed methods.

[1]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

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

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

[4]  Michael Stonebraker,et al.  Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres , 1979, IEEE Transactions on Software Engineering.

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

[6]  Takahiro Hara,et al.  Dynamic replica allocation using database migration in broadband networks , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[7]  David Wai-Lok Cheung,et al.  A Transaction Replication Scheme for a Replicated Database with Node Autonomy , 1994, VLDB.

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

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

[10]  Miron Livny,et al.  Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication , 1988, VLDB.

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

[12]  Zygmunt J. Haas,et al.  Determining the optimal configuration for the zone routing protocol , 1999, IEEE J. Sel. Areas Commun..

[13]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[14]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[15]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

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

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