Abstract
Data replication is suitable to improve the response time, the global traffic, and the sharing of data since even in the case of disconnection of a server. The nodes can continue to have access to replicas of data. On an Ad hoc mobile network, the frequent partition of the network and the lack of fixed infrastructures complicate the data access and the sharing task.
In this paper, we propose a method of data replication in a mobile ad hoc network. The method is composed of two main phases. The first phase aims at creating replicas from new data in the network and at realizing the first distribution of these replicas. The second phase is devoted to the redistribution of replicas in order to overcome the impact of dynamic changes of topology and to satisfy the evolution of users’ needs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barbara, D., Imielinski, T.: Sleepers and workholics: Caching strategies in mobile environments. In: Proc. ACM SIGMOD 1994, pp. 1–12 (1994)
Bagrodia, R., Zeng, X., Gerla, M.: GloMoSim - A Library for Parallel Simulation of Large-scale Wireless Networks. Computer Science Dep., Univ. of California at Los Angles (1999)
Crowder, S.V.: A Simple Method for Studying Run-length Distributions of Exponentially Weighted Moving Average Charts. Technometrics 29, 401–408 (1987)
Crowder, S.V.: Average Run Lengths of Exponentially Weighted Moving Average Charts. Journal of Quality Technology 19, 161–164 (1987b)
Fu, A.W., Cheung, D.W.L.: A transaction replication scheme for a replicated database with node autonomy. In: Proc. 20th VLDB Conference, pp. 214–225 (1994)
Hara, T., Harumoto, K., Tsukamoto, M., Nishio, S.: Dynamic replica allocation using database migration in broadband networks. In: Proc. IEEE ICDCS 2000, pp. 376–384 (2000)
Hara, T.: Effective replica allocation in ad hoc networks for improving data Accessibility. In: Proc. of IEEE Infocom, Anchorage, Alaska, U.S.A., vol. 3, pp. 1568-1576 (April 2001)
Hara, T.: Replica Allocation in Ad Hoc Networks with Periodic Data Update. In: Proc. of the Third International Conf. on Mobile Data Management. IEEE, Los Alamitos (2002)
Hara, T.: Replica allocation methods in ad hoc networks with data update. ACM-Kluwer Journal on Mobile Networks and Applications 8(4), 343–354 (2003)
Hara, T., Madria, S.K.: Dynamic Data Replication Using Aperiodic Updates in Mobile Adhoc Networks. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 869–881. Springer, Heidelberg (2004)
Huang, Y., Sistla, P., Wolfson, O.: Data replication for mobile computer. In: Proc. ACM SIGMOD 1994, pp. 13–24 (1994)
Hara, T., Loh, Y.L., Nishio, S.: Data Replication Methods Based on the Stability of Radio Links in Ad Hoc Networks. In: Proceedings of the 14th International Workshop on Database and Expert Systems Applications (DEXA 2003). IEEE, Los Alamitos (2003); 1529-4188/03
Krishnakumar, N., Bernstein, A.J.: High performance escrow algorithms for replicated databases. In: Proc. 18th VLDB Conference, pp. 175–186 (1992)
Yin, L., Cao, G.: Supporting Cooperative Caching in Ad Hoc Networks. In: IEEE Infocom 2004 (2004)
Wang, K., Li., B.: Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks. In: Proceedings of IEEE INFOCOM (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moussaoui, S., Guerroumi, M., Badache, N. (2006). Data Replication in Mobile Ad Hoc Networks. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2006. Lecture Notes in Computer Science, vol 4325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11943952_58
Download citation
DOI: https://doi.org/10.1007/11943952_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49932-9
Online ISBN: 978-3-540-49933-6
eBook Packages: Computer ScienceComputer Science (R0)