
Summary: In Mobile Ad Hoc Networks (MANET), network partitioning can cause sudden and severe disruptions to ongoing data accesses, 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 algorithm is proposed to improve data availability. Theoretic analysis indicates that the algorithm has a proper complexity. Simulation results show that the clusters created by the clustering algorithm have desirable properties and the data availability is improved effectively by the clustering-based data replication algorithm.
Network design and communication in computer systems, Distributed algorithms, distributed clustering algorithm
Network design and communication in computer systems, Distributed algorithms, distributed clustering algorithm
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
