Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combin...Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combination of single copy scheme and multi-copy scheme and the combination of hop-by-hop and multi-hop mechanism ACHR,which has the advantages in simplicity,availability and well-expansibility.The result shows that it can take advantage of the random communication opportunities and local network connectivity,and achieves 1.6 times delivery ratio and 60% overhead compared with its counterpart.展开更多
This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors pr...This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors propose a consensus-based algorithm in distributed case, that is, the double- clock consensus-based K-means algorithm （DCKA）. With mild connectivity conditions, the authors show convergence of DCKA to guarantee a distributed solution to the clustering problem, even though the network topology is time-varying. Moreover, the authors provide experimental results on vari- ous clustering datasets to illustrate the effectiveness of the fully distributed algorithm DCKA, whose performance may be better than that of the centralized K-means algorithm.展开更多
基金Project(531107040202) supported by the Fundamental Research Funds for the Central Universities of China
文摘Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combination of single copy scheme and multi-copy scheme and the combination of hop-by-hop and multi-hop mechanism ACHR,which has the advantages in simplicity,availability and well-expansibility.The result shows that it can take advantage of the random communication opportunities and local network connectivity,and achieves 1.6 times delivery ratio and 60% overhead compared with its counterpart.
基金supported by the National Key Research and Development Program of China under Grant No.2016YFB0901902the National Natural Science Foundation of China under Grant Nos.61573344,61333001,61733018,and 61374168
文摘This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors propose a consensus-based algorithm in distributed case, that is, the double- clock consensus-based K-means algorithm （DCKA）. With mild connectivity conditions, the authors show convergence of DCKA to guarantee a distributed solution to the clustering problem, even though the network topology is time-varying. Moreover, the authors provide experimental results on vari- ous clustering datasets to illustrate the effectiveness of the fully distributed algorithm DCKA, whose performance may be better than that of the centralized K-means algorithm.
