A dynamic adaptive replica allocation algorithm in mobile ad hoc networks

In mobile ad hoc networks (MANET), nodes move freely and the distribution of access requests changes dynamically. Replica allocation in such a dynamic environment is a significant challenge. A dynamic adaptive replica allocation algorithm that can adapt to the nodes motion is proposed to minimize the communication cost of object access. When changes occur in the access requests of the object or the network topology, each replica node collects access requests from its neighbors and makes decisions locally to expand replica to neighbors or to relinquish the replica. The algorithm dynamically adapts the replica allocation scheme to a local optimal one. Simulation results show that our algorithms efficiently reduce the communication cost of object access in MANET environment.

[1]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

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

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

[4]  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.

[5]  Sushil Jajodia,et al.  An adaptive data replication algorithm , 1997, TODS.

[6]  Baochun Li,et al.  Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[8]  Stephen A. Cook,et al.  The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy , 2002, Distributed Computing.

[9]  Ouri Wolfson,et al.  The multicast policy and its relationship to replicated data placement , 1991, TODS.

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

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