Multicluster, mobile, multimedia radio network
Wireless Networks
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A Dynamic Adaptive Replica Allocation Algorithm in Mobile Ad Hoc Networks
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
CBRM --- cluster based replica management in mobile adhoc networks
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Hi-index | 0.00 |
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.