Stable Neighbor Based Adaptive Replica Allocation in Mobile Ad Hoc Networks

  • Zheng Jing
  • Su Jinshu
  • Yang Kan
  • Wang Yijie
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3036)


In mobile ad hoc networks (MANET), nodes move freely and the replica allocation in such a dynamic environment is a significant challenge. In this paper, a dynamic adaptive replica allocation algorithm that can adapt to the nodes motion is proposed to minimize the communication cost of the 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 the replica to neighbors or to relinquish the replica. This algorithm dynamically adjusts the replica allocation scheme towards a local optimal one. To reduce the oscillation of replica allocation, a statistical method based on history information is utilized to choose stable neighbors and to expand the replica to relatively stable nodes. Simulation results show that our algorithms efficiently reduce the communication cost of object access in MANET environment.


  1. 1.
    Wolfson, O., Jajodia, S., Huang, Y.: An Adaptive Data Replication Algorithm. ACM Transactions on Database System 22(4), 255–314 (1997)CrossRefGoogle Scholar
  2. 2.
    Cook, S.A., Pachl, J.K., Pressman, I.S.: The Optimal Location of Replicas in A Network Using A Read-One-Write-All Policy. Distribute Computing 15(1), 7–17 (2002)Google Scholar
  3. 3.
    Barbara, D., Imielinski, T.: Sleeper and Workholics: Caching Strategies in Mobile Environment. In: Proceedings of ACM SIGMOD 1994, pp. 1–12 (1994)Google Scholar
  4. 4.
    Cay, J., Tan, K.L., Ooi, B.C.: On Incremental Cache Coherency Schemes in Mobile Computing Environments. In: Proceeding of IEEE ICDE 1997, pp. 114–123 (1977)Google Scholar
  5. 5.
    Huang, Y., Pistla, S., Wolfson, O.: Data Replication for Mobile Computer. In: Proceedings of ACM SIGMOD 1994, pp. 13–24 (1994)Google Scholar
  6. 6.
    Hare, T.: Replica Allocation in Ad hoc Networks with Periodic Data Update. In: Proceedings of Int’l Conference on Mobile Data Management (MDM 2002), pp. 79–86 (2002)Google Scholar
  7. 7.
    Wang, K., Li, B.: Efficient and Guaranteed Service Coverage in Partitionable Mobile Adhoc Networks. In: IEEE Joint Conference of Computer and Communication Societies (INFOCOM 2002), New York City, New York, June 23-27, pp. 1089–1098 (2002)Google Scholar
  8. 8.
    Wolfson, O., Milo, A.: The Mulicast Policy and Its Relationship to Replicated Data Placement. ACM Transaction on Database System 16(1), 181–205 (1991)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Camp, T., Boleng, J., Davies, v.: A Survey of Mobility Models for Ad Hoc Network Research. Wireless Communication & Mobile Computing (WCMC): Special Issue On Mobile Ad Hoc Networking: Reach, Tends and Applications 2(5), 483–502 (2002)Google Scholar
  10. 10.
    Zhengjing, et al.: An Adaptive Replica Allocation Algorithm in MANET Environment, Tech. Rep. PDD-2003-9, School of computer, National University of Defense Technology (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Zheng Jing
    • 1
  • Su Jinshu
    • 1
  • Yang Kan
    • 1
  • Wang Yijie
    • 1
  1. 1.School of Computer ScienceNational University of Defense TechnologyChangsha, HunanChina

Personalised recommendations