Cache Invalidation for Updated Data in Ad Hoc Networks

  • Hideki Hayashi
  • Takahiro Hara
  • Shojiro Nishio
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2888)


Recent advances in computer and wireless communication technologies have led to an increasing interest in ad hoc networks which are constructed of only mobile hosts. In this paper, we propose two cache invalidation methods in ad hoc networks where each data item is updated at inconstant intervals. In the first method, when a mobile host holding an original data item updates the data item, it broadcasts an invalidation report to all connected mobile hosts. In the other method, when two mobile hosts are connected, they rebroadcast invalidation reports received before to newly connected mobile hosts. Our proposed methods reduce the number of accesses to invalid cached data items which have been updated and the number of roll backs caused by such invalid accesses. We also show the results of simulation experiments regarding the performance evaluation of our proposed methods.


Data Item Time Stamp Mobile Host Radio Communication Range Access Frequency 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)zbMATHGoogle Scholar
  2. 2.
    Barbara, D., Imielinski, T.: Sleepers and workaholics: caching strategies in mobile environments. In: Proc. ACM SIGMOD 1994, pp. 1–12 (1994)Google Scholar
  3. 3.
    Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.C., Jetcheva, J.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Proc. ACM MobiCom 1998, pp. 85–97 (1998)Google Scholar
  4. 4.
    Cai, J., Tan, K.L., Ooi, B.C.: On incremental cache coherency schemes in mobile computing environments. In: Proc. IEEE ICDE 1997, pp. 114–123 (1997)Google Scholar
  5. 5.
    Cao, G.: A scalable low-latency cache invalidation strategy for mobile environments. In: Proc. ACM MobiCom 2000, pp. 200–209 (2000)Google Scholar
  6. 6.
    Hara, T.: Effective replica allocation in ad hoc networks for improving data accessibility. In: Proc. IEEE Infocom 2001, pp. 1568–1576 (2001)Google Scholar
  7. 7.
    Hara, T.: Replica allocation methods in ad hoc networks with data update, ACM– Kluwer Journal on Mobile Networks and Applications (2003) (to appear)Google Scholar
  8. 8.
    Hu, Q., Lee, D.: Cache algorithms based on adaptive invalidation reports for mobile environments. Cluster Computing 1(1), 39–48 (1998)CrossRefGoogle Scholar
  9. 9.
    Jiang, M., Li, J., Tay, Y.C.: Cluster based routing protocol(CBRP), Internet Draft, draft–ietf–manet–cbrp–spec–01.txt (1999)Google Scholar
  10. 10.
    Jing, J., Elmagarmid, A., Helal, A., Alonso, R.: Bit-sequences: An adaptive cache invalidation method in mobile client/server environments. ACM–Kluwer Journal on Mobile Networks and Applications 2(2), 115–127 (1997)CrossRefGoogle Scholar
  11. 11.
    Johnson, D.B.: Routing in ad hoc networks of mobile hosts. In: Proc. IEEE Workshop on Mobile Computing Systems and Applications, pp. 158–163 (1994)Google Scholar
  12. 12.
    Lee, S., Kim, C.: Neighbor supporting ad hoc multicast routing protocol. In: Proc. ACM MobiHoc 2000, pp. 37–44 (2000)Google Scholar
  13. 13.
    Lee, S., Su, W., Hsu, J., Gerla, M., Bagrodia, R.: A performance comparison study of ad hoc wireless multicast protocols. In: Proc. IEEE Infocom 2000, pp. 565–574 (2000)Google Scholar
  14. 14.
    Lee, S.K., Hwang, C.S., Yu, H.C.: Supporting transactional cache consistency in mobile database systems. In: Proc. ACM MobiDE 1999, pp. 6–13 (1999)Google Scholar
  15. 15.
    Luo, J., Hubaux, J.P., Eugster, P.: PAN: Providing reliable storage in mobile ad hoc networks with probabilistic quorum systems. In: Proc. ACM MobiHoc 2003, pp. 1– 12 (2003)Google Scholar
  16. 16.
    Pearlman, M.R., Haas, Z.J.: Determining the optimal configuration for the zone routing protocol. IEEE Journal on Selected Areas in Communications 17(8), 1395–1414 (1999)CrossRefGoogle Scholar
  17. 17.
    Perkins, C.E., Bhagwat, P.: Highly dynamic destination–sequenced distance– vector routing (DSDV) for mobile computers. In: Proc. ACM SIGCOMM 1994, pp. 234–244 (1994)Google Scholar
  18. 18.
    Perkins, C.E., Royer, E.M.: Ad hoc on demand distance vector routing. In: Proc. IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 1999), pp. 90–100 (1999)Google Scholar
  19. 19.
    Tan, K.L.: Organization of invalidation reports for energy-efficient cache invalidation in mobile environments. ACM–Kluwer Journal on Mobile Networks and Applications 6(3), 279–290 (2001)zbMATHCrossRefGoogle Scholar
  20. 20.
    Wang, K., Li, B.: Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks. In: Proc. IEEE Infocom 2002, vol. 2, pp. 1089–1098 (2002)Google Scholar
  21. 21.
    Wu, K.L., Yu, P.S., Chen, M.S.: Energy-efficient caching for wireless mobile computing. In: Proc. IEEE ICDE 1996, pp. 336–343 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Hideki Hayashi
    • 1
  • Takahiro Hara
    • 1
  • Shojiro Nishio
    • 1
  1. 1.Dept. of Multimedia Engineering, Graduate School of Information Science and TechnologyOsaka UniversityOsakaJapan

Personalised recommendations