A clustering-based data replication algorithm in mobile ad hoc networks for improving data availability

19Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In Mobile Ad Hoc Networks (MANET), network partitioning occurs when nodes move freely and cause disconnections frequently. Network partitioning is a wide-scale topology change that can cause sudden and severe disruptions to ongoing data access, and consequently data availability is decreased. A new distributed clustering algorithm is presented in this paper for dynamically organizing mobile nodes into clusters in which the probability of path availability can be bounded. Based on this clustering algorithm, a data replication policy is proposed to improve data availability during network partitioning. Through theoretic analysis our algorithm has proper complexity. Simulation results show that the clusters created by our clustering algorithm have desirable properties and our algorithms improve the data availability effectively in MANET environment. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Zheng, J., Su, J., & Lu, X. (2004). A clustering-based data replication algorithm in mobile ad hoc networks for improving data availability. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3358, 399–409. https://doi.org/10.1007/978-3-540-30566-8_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free