Replica Allocation Considering Data Update Intervals in Ad Hoc Networks

  • Hideki Hayashi
  • Takahiro Hara
  • Shojiro Nishio
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 162)


In ad hoc networks, since network division occurs frequently, it is effective to replicate data items. This paper proposes effective replica allocation methods in ad hoc networks where each data item is updated at irregular intervals. The proposed methods allocate replicas based on probability density functions of the update intervals of data items. Also, they invalidate replicas that have been updated with high probability because accesses to old replicas impose extra computational overhead and roll backs. As a result, the proposed methods not only improve data accessibility but also reduce the number of accessing old replicas.


ad hoc networks replica allocation data accessibility data update mobile computing environment 


  1. [1]
    A.V. Aho, J.E. Hopcroft, and J.D. Ullman, “The Design and Analysis of Computer Algorithms,” Addison-Wesley, 1974.Google Scholar
  2. [2]
    T. Hara, “Effective replica allocation in ad hoc networks for improving data accessibility,” Proc. IEEE Infocom’01, pp. 1568–1576, 2001.Google Scholar
  3. [3]
    T. Hara, “Replica allocation methods in ad hoc networks with data update,” ACM-Kluwer Journal on Mobile Networks and Applications (MONET), vol. 8, no. 4, pp. 343–354, 2003.MathSciNetCrossRefGoogle Scholar
  4. [4]
    T. Hara, N. Murakami, and S. Nishio, “Replica allocation for correlated data items in ad-hoc sensor networks,” SIGMOD Record, vol. 33, no. 1, pp. 38–43, 2003.CrossRefGoogle Scholar
  5. [5]
    H. Hayashi, T. Hara, and S. Nishio, “Cache invalidation for updated data in ad hoc networks,” Proc. CoopIS’03, pp. 516–535, 2003.Google Scholar
  6. [6]
    H. Hayashi, T. Hara, and S. Nishio, “Updated data dissemination in ad hoc networks,” Proc. Int’l Workshop on Ubiquitous Mobile Information and Collaboration Systems (UMICS’04), pp. 29–43, 2004.Google Scholar
  7. [7]
    G. Karumanchi, S. Muralidharan, and R. Prakash, “Information dissemination in partitionable mobile ad hoc networks,” Proc. Symposium on Reliable Distributed Systems (SRDS’99), pp. 4–13, 1999.Google Scholar
  8. [8]
    S. Lim, W-C. Lee, G. Cao, and C.R. Das, “A novel caching scheme for internet based mobile ad hoc networks,” Proc. ICCCN’03, pp. 38–43, 2003.Google Scholar
  9. [9]
    J. Luo, J.P. Hubaux, and P. Eugster, “PAN: Providing reliable storage in mobile ad hoc networks with probabilistic quorum systems,” Proc. ACM MobiHoc’03, pp. 1–12, 2003.Google Scholar
  10. [10]
    K. Rothermel, C. Becker, and J. Hahner, “Consistent update diffusion in mobile ad hoc networks,” Technical Report 2002/04, Computer Science Department, University of Stuttgart, 2002.Google Scholar
  11. [11]
    F. Sailhan, and V. Issarny, “Cooperative caching in ad hoc networks,” Proc. Int’l Conf. on Mobile Data Management MDM’03, pp. 13–28. 2003.Google Scholar
  12. [12]
    K. Wang, and B. Li, “Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks,” Proc. IEEE Infocom’02, vol. 2, pp. 1089–1098, 2002.zbMATHGoogle Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Hideki Hayashi
    • 1
  • Takahiro Hara
    • 1
  • Shojiro Nishio
    • 1
  1. 1.Dept. of Multimedia Eng., Grad. Sch. of Information Science and Tech.Osaka Univ.Osaka

Personalised recommendations