一种基于模拟退火算法的无线传感器网络最优簇类求解方案

摘要

通过对现有分簇算法的深入研究，从典型的组合优化问题着手，利用模拟退火算法的思想，提出了一种基于模拟退火算法的无线传感器网络最优簇类求解方案，首先将簇头节点集合抽象为参考模型，通过一定的扰动因子不断迭代更新最终得到目标簇头集，然后将模拟退火算法的整个思想充分结合到最佳簇数的选择过程中，详细介绍了整个过程的实现，并通过数学建模分析和仿真实验相结合的方法对所给出方案中的最佳簇数、每轮持续时间、算法迭代次数等相关参数进行了研究和分析。%Through the thorough study of existing clustering algorithms, with the problem of typical combinatorial optimization and the idea of simulated annealing algorithm, a best clustering scheme of the wireless sensor network was proposed based on simulated annealing algorithm. The assembled cluster head nodes were assembied and abstracted to a referenced model,objective cluster head collection was obtained through certain perturbation factors from continuous iteration. The idea of simulated annealing algorithm was used to the choosing process of the best number of clusters. This paper introduces the realization of the whole process in detail. The best number of clusters,persistent time,iterative times are studied and analyzed through established mathematics model and simulated experiments.