论文部分内容阅读
在最小群变化(LeastClusterChanged,LCC)分群算法的基础上提出一种非确定-确定混合(Uncer tainy CertainyMixed,UC CM)分群算法。该算法利用非确定性分群的竞争特性,提高了网络的初始收敛速度,并保持了LCC算法的稳定性,同时利用优先级参数,提高了组网的灵活性。设计了UC CM算法的有限状态机模型,并基于模型对算法进行了模拟仿真,验证了算法的有效性。
Based on the LeastClusterChanged (LCC) clustering algorithm, a non-deterministic-deterministic hybrid (UCM) clustering algorithm is proposed. This algorithm uses the competitive characteristics of nondeterministic grouping to improve the initial convergence speed of the network and to maintain the stability of LCC algorithm. At the same time, the priority parameter is used to improve the networking flexibility. The finite state machine model of UC CM algorithm is designed, and the algorithm is simulated based on the model to verify the effectiveness of the algorithm.