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.
This research was supported by the National Natural Science Foundation of China (No. 69933030).
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
Baker, D., Ephremides, A., Flyynn, J.A.: The Design and Simulation of a Mobile Radio Network with Distributed Control. IEEE Journal on Selected Area in Communications SAC-2(1), 226–237 (1984)
Gerla, M., Tsai, J.T.: Multicluster, Mobile, Multimedia Radio Network. Wireless Networks 1, 255–265 (1995)
Chen, Y.P., Liestman, A.L.: Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks. In: MOBIHOC 2002, EPFL Lausanne, Switzerland, June 9-11, pp. 165–172 (2002)
Rieck, M.Q., Pai, S., Dhar, S.: Distributed Routing Algorithm for Wireless Ad Hoc Networks Using d-Hop Connected d-Hop Dominating Sets. In: Proceedings of the 6th International Conference on High Performance Computing: Asia-Pacific (HPC Asia 2002), vol. 2, pp. 443–450. Tata McGraw Hill, New York (2002)
Wu, J., Li, H.: A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks. Special issue on wireless networks in the Telecommunication Systems Journal 3, 63–84 (2001)
Wang, K., Li, B.: Efficient and Guaranteed Service Coverage in Partitionable Mobile Ad-hoc Networks. In: INFOCOM 2002, New York, June 2002, pp. 1089–1098 (2002)
Hare, T.: Effective Replica Allocation in Ad hoc Networks for Improving Data accessibility. In: IEEE Infocom 2001, pp. 1568–1576 (2001)
McDonal, A.B., Znati, T.: A Mobility Based Framework fo Adaptive Clustering in Wireless Ad-Hoc Networks. IEEE Journal on Selected Areas in Communication 17(8), 1466–1487 (1999)
Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The Maximum Clique Problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 4. Kluwer Academic Publishers, Boston (1999)
Zheng, J., et al.: A Dynamic Adaptive Replica Allocation Algorithm in Mobile Ad Hoc Networks. In: Proceeding of IEEE International Conference on Pervasive Computing and Communications (PerCom 2004), Orlando, March 2004, pp. 65–70 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, J., Su, J., Lu, X. (2004). A Clustering-Based Data Replication Algorithm in Mobile Ad Hoc Networks for Improving Data Availability. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-30566-8_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24128-7
Online ISBN: 978-3-540-30566-8
eBook Packages: Computer ScienceComputer Science (R0)