Skip to main content
SpringerLink
Log in

Replica Allocation Methods in Ad Hoc Networks with Data Update

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

In ad hoc networks, since mobile hosts move freely, network division occurs frequently, and thus data accessibility is lower than that in conventional fixed networks. In this paper, 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. We further extend the proposed methods to adapt to an environment where aperiodic data updates occur.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Acharya, R. Alonso, M. Franklin and S. Zdonik, Broadcast disks: Data management for asymmetric communication environments, in: Proceedings of ACM SIGMOD'95 (1995) pp. 199–210.

  2. S. Acharya, M. Franklin and S. Zdonik, Dissemination-based data delivery using broadcast disks, IEEE Personal Communications 2(6) (1995) 50–60.

    Google Scholar 

  3. S. Acharya, M. Franklin and S. Zdonik, Prefetching from broadcast disks, in: Proceedings of IEEE ICDE'96 (1996) pp. 276–285.

  4. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, 1974).

  5. D.J. Baker, J. Wieselthier and A. Ephremides, A distributed algorithm for scheduling the activation of links in a self-organizing, mobile, radio network, in: Proceedings of IEEE ICC'82 (1982) pp. 2F6.1–2F6.5.

  6. D. Barbara and T. Imielinski, Sleepers and workholics: Caching strategies in mobile environments, in: Proceedings of ACM SIGMOD'94 (1994) pp. 1–12.

  7. M.J. Carey and M. Livny, Distributed concurrency control performance: A study of algorithm, distribution, and replication, in: Proceedings of VLDB'88 (1988) pp. 13–25.

  8. J. Cay, K.L. Tan and B.C. Ooi, On incremental cache coherency schemes in mobile computing environments, in: Proceedings of IEEE ICDE'97 (1997) pp. 114–123.

  9. Y.L. Chang and C.C. Hsu, Routing in wireless/mobile ad-hoc networks via dynamic group construction, Wireless Networks 5(1) (2000) 27–37.

    Google Scholar 

  10. A.W. Fu and D.W.L. Cheung, A transaction replication scheme for a replicated database with node autonomy, in: Proceedings of VLDB'94 (1994) pp. 214–225.

  11. M. Gerla and J.T.C. Tsai, Multicluster, mobile, multimedia radio network, Wireless Networks 1(3) (1995) 255–265.

    Google Scholar 

  12. V. Grassi, Prefetching policies for energy saving and latency reduction in a wireless broadcast data delivery system, in: Proceedings of ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (ACM MSWIS 2000) (2000) pp. 77–84.

  13. T. Hara, Effective replica allocation in ad hoc networks for improving data accessibility, in: Proceedings of IEEE INFOCOM 2001 (2001) pp. 1568–1576.

  14. T. Hara, Replica allocation in ad hoc networks with periodic data update, in: Proceedings of International Conference on Mobile Data Management (MDM 2002) (2002) pp. 79–86.

  15. T. Hara, K. Harumoto, M. Tsukamoto and S. Nishio, Dynamic replica allocation using database migration in broadband networks, in: Proceedings of IEEE ICDCS 2000 (2000) pp. 376–384.

  16. Y.C. Hu and D.B. Johnson, Caching strategies in on-demand routing protocols for wireless ad hoc networks, in: Proceedings of MobiCom 2000 (2000) pp. 231–244.

  17. Y. Huang, P. Sistla and O. Wolfson, Data replication for mobile computer, in: Proceedings of ACM SIGMOD'94 (1994) pp. 13–24.

  18. J. Jing, A. Elmagarmid, A. Helal and R. Alonso, Bit-sequences: An adaptive cache invalidation method in mobile client/server environments, Mobile Networks and Applications 2(2) (1997) 115–127.

    Google Scholar 

  19. D.B. Johnson, Routing in ad hoc networks of mobile hosts, in: Proceedings of IEEEWorkshop on Mobile Computing Systems and Applications (1994) pp. 158–163.

  20. A. Nasipuri, R. Castañeda and S.R. Das, Performance of multipath routing for on-demand protocols in mobile ad hoc networks, Mobile Networks and Applications 6(4) (2001) 339–349.

    Google Scholar 

  21. V. Park and S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proceedings of IEEE INFOCOM'97 (1997) pp. 1405–1413.

  22. M.R. Pearlman and Z.J. Haas, Determining the optimal configuration for the zone routing protocol, IEEE Journal on Selected Areas in Communications 17(8) (1999) 1395–1414.

    Google Scholar 

  23. G. Pei and M. Gerla, Mobility management for hierarchical wireless networks, Mobile Networks and Applications 6(4) (2001) 331–337.

    Google Scholar 

  24. C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, in: Proceedings of ACM SIGCOMM'94 (1994) pp. 234–244.

  25. C.E. Perkins and E.M. Royer, Ad hoc on demand distance vector routing, in: Proceedings of IEEE Workshop on Mobile Computing Systems and Applications (1999) pp. 90–100.

  26. E. Pitoura and B. Bhargava, Maintaining consistency of data in mobile distributed environments, in: Proceedings of IEEE ICDCS'95 (1995) pp. 404–413.

  27. K. Scott and N. Bambos, The self-organizing wireless network (SWAN) protocol for communication among mobile users, in: Proceedings of IEEE Globcom'95 (1995) pp. 355–359.

  28. M. Stonebraker, Concurrency control and consistency in multiple copies of data in distributed INGRES, IEEE Transactions on Software Engineering 3(3) (1979) 188–194.

    Google Scholar 

  29. C.J. Su and L. Tassiulas, Joint broadcast scheduling and user's cache management for efficient information delivery, in: Proceedings of MobiCom'98 (1998) pp. 33–42.

  30. R.H. Thomas, A majority consensus approach to concurrency control for multiple copy databases, ACM Transactions on Database Systems 4(2) (1979) 180–209.

    Google Scholar 

  31. O. Wolfson and A. Milo, The multicast policy and its relationship to replicated data placement, ACM Transactions on Database Systems 16(1) (1991) 181–205.

    Google Scholar 

  32. K.L. Wu, P.S. Yu and M.S. Chen, Energy-efficient caching for wireless mobile computing, in: Proceedings of IEEE ICDE'96 (1996) pp. 336–343.

Download references

Author information

Authors and Affiliations

  1. Department of Multimedia Engineering, Graduate School of Information Science and Technology, Osaka University, 2-1 Yamadaoka, Suita, Osaka, 565-0871, Japan

    Takahiro Hara

Authors
  1. Takahiro Hara
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hara, T. Replica Allocation Methods in Ad Hoc Networks with Data Update. Mobile Networks and Applications 8, 343–354 (2003). https://doi.org/10.1023/A:1024523411884

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024523411884

Search

Navigation