An Incremental Dynamic Community Discovery Algorithm Based on Node Relatedness
摘要
Time-Sensitive Networking (TSN) has the problem of reduced clock synchronization accuracy when the network size is large, and one of the solutions is to divide the network into multiple subnets for clock synchronization, while most of the existing network divisions are based on community division, and there are fewer algorithms for the division of TSN networks. Therefore, this paper investigates the network division problem of TSN, based on IncNSA algorithm, and proposes IDCDA-NR algorithm for the problems of high redistribution rate of old nodes in the community division results of the original algorithm and small community size. And on the basis of the analysis in this paper, simulation experiments are conducted to verify the comparison, and the experimental results show that compared with the original algorithm, the IDCDA-NR algorithm proposed in this paper reduces the redistribution rate of the old community and the average number of times of community division under the premise of losing the finite modularity, and improves the comprehensive effect of division.