Data Replication for Improving Data Accessibility in Ad Hoc Networks

IEEE Transactions on Mobile Computing

Volumn 5, Issue 11, 2006, Pages 1515-1532

  Hara, T ^a   Madria, S K ^b  

^a OSAKA UNIVERSITY   (Japan)

^b Architectural and Environmental Engineering   (United States)

Author keywords

Ad hoc networks; data accessibility; data update; replication scheme

Indexed keywords

EID: 85008556094     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2006.165     Document Type: Article

References (32)

1. D.J. Baker, J. Wieselthier, and A. Ephremides, “A Distributed Algorithm for Scheduling the Activation of Links in a Self-Organizing, Mobile, Radio Network,” Proc. IEEE Int'l Conf. Comm. (ICC '82), pp. 2F6.1-2F6.5, 1982.
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974
3. D. Barbara and T. Imielinski, “Sleepers and Workholics: Caching Strategies in Mobile Environments,” Proc. ACM SIGMOD '94, pp. 1–12, 1994.
4. K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky, “Bimodal Multicast,” ACM Trans. Computer Systems, vol. 17, no. 2, pp. 41–88, 1999.
5. J. Broch, D.A. Maltz, D.B. Johnson, Y.C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. MobiCom '98, pp. 159–164, 1998.
6. M.J. Carey and M. Livny, “Distributed Concurrency Control Performance: A Study of Algorithm, Distribution, and Replication,” Proc. 14th Very Large Data Bases Conf, pp. 13–25, 1988.
7. L.D. Fife and L. Gruenwald, “Research Issues for Data Communication in Mobile Ad-Hoc Network pp. Database Systems,” ACM SIGMOD Record, vol. 32, no. 2, 42–47, 2003.
8. T. Hara, “Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility,” Proc. IEEE INFOCOM 2001, pp. 1568–1576, 2001.
9. T. Hara, “Replica Allocation Methods in Ad Hoc Networks with Data Update,” ACM-Kluwer J. Mobile Networks and Applications, vol. 8, no. 4, pp. 343–354, 2003.
10. T. Hara and S.K. Madria, “Dynamic Data Replication Schemes for Mobile Ad-Hoc Network Based on Aperiodic Updates,” Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA '04), pp. 869–881, 2004.
11. T. Hara, N. Murakami, and S. Nishio, “Replica Allocation for Correlated Data Items in Ad-Hoc Sensor Networks,” ACM SIGMOD Record, vol. 33, no. 1, pp. 38–43, 2004.
12. T. Hara and S.K. Madria, “Consistency Management Among Replicas in Peer-to-Peer Mobile Ad Hoc Networks,” Proc. Int'l Symp. Reliable Distributed Systems (SRDS '05), pp. 3–12, 2005.
13. H. Hayashi, T. Hara, and S. Nishio, “Cache Invalidation for Updated Data in Ad Hoc Networks,” Proc. Int'l Conf. Cooperative Information Systems (CoopIS '03), pp. 516–535, 2003.
14. Y. Huang, P. Sistla, and O. Wolfson, “Data Replication for Mobile Computer,” Proc. ACM SIGMOD '94, pp. 13–24, 1994.
15. J. Jing, A. Elmagarmid, A. Helal, and R. Alonso, “Bit-Sequences: An Adaptive Cache Invalidation Method in Mobile Client/Server Environments,” ACM/Baltzer Mobile Networks and Applications, vol. 2, no. 2, pp. 115–127, 1997.
16. D.B. Johnson, “Routing in Ad Hoc Networks of Mobile Hosts,” Proc. IEEE Workshop Mobile Computing Systems and Applications, pp. 158–163, 1994.
17. G. Karumanchi, S. Muralidharan, and R. Prakash, “Information Dissemination in Partitionable Mobile Ad Hoc Networks,” Proc. Int'l Symp. Reliable Distributed Systems (SRDS '99), pp. 4–13, 1999.
18. R. Ladin, B. Liskov, L. Shrira, and S. Ghemawat, “Providing High Availability Using Lazy Replication,” ACM Trans. Computer Systems, vol. 10, no. 4, pp. 360–391, 1992.
19. S.K. Madria, “Timestamps to Detect R-W Conflicts in Mobile Computing,” Proc. Int'l Workshop Mobile Data Access (MDA '98), pp. 242–253, Nov. 1998.
20. M.R. Pearlman and Z.J. Haas, “Determining the Optimal Configuration for the Zone Routing Protocol,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1395–1414, 1999.
21. C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM '94, pp. 234–244, 1994.
22. C.E. Perkins and E.M. Royer, “Ad Hoc on Demand Distance Vector Routing,” Proc. IEEE Workshop Mobile Computing Systems and Applications, pp. 90–100, 1999.
23. E. Pitoura and B. Bhargava, Maintaining Consistency of Data in Mobile Distributed Environments, Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '95), pp. 404-413, 1995.
24. K. Rothermel, C. Becker, and J. Hahner, Consistent Update Diffusion in Mobile Ad Hoc Networks, Technical Report 2002/04, Computer Science Dept., Univ. of Stuttgart, 2002.
25. F. Sailhan and V. Issarny, Cooperative Caching in Ad HocNetworks, Proc. Int'l Conf. Mobile Data Management (MDM '03), pp. 13-28, 2003
26. M. Stonebraker, Concurrency Control and Consistency in Multiple Copies of Data in Distributed INGRES, IEEE Trans. Software Eng., vol. 3, no. 3, pp. 188-194, 1979
27. R.H. Thomas, A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases, ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, 1979
28. 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
29. O. Wolfson and A. Milo, “The Multicast Policy and Its Relationship to Replicated Data Placement,” ACM Trans. Database Systems, vol. 16, no. 1, pp. 181–205, 1991
30. K.L. Wu, P.S. Yu, and M.S. Chen, Energy-Efficient Caching for Wireless Mobile Computing, Proc. IEEE Int'l Conf. Data Eng. (ICDE '96), pp. 336-343, 1996.
31. S.-Y. Wu and Y.-T. Chang, An Active Replication Scheme for Mobile Data Management, Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA '99), pp. 143-150, 1999.
32. J. Xu, Q. Hu, D.L. Lee, and W.-C. Lee, SAIU: An Efficient Cache Replacement Policy for Wireless On-Demand Broadcast, Proc. ACM Int'l Conf. Information and Knowledge Management (ACM CIKM '02), pp. 46-53, 2000.