无线传感器网络中一种基于花型的分簇算法

摘要

A flowers clustering algorithm is proposed, aiming at the problem of the limited energy in wireless sensor networks. Algorithm combines the optimal number of clusters with the idea of using regular hexagon grid to achieve seamless coverage network,in clustering process,selects the largest remained energy node in flower core as cluster head by labeling method. The simulation result shows that the algorithm reduces the energy consumption of the network and extends the network lifetime to some extent, clustering performance is good.%针对无线传感器网络能量约束问题,提出了一种基于花型的分簇算法.算法结合最优簇数目计算与用正六边形网格实现无缝覆盖的思想,分簇过程中通过标号方法从花芯区域中选取剩余能量最大的节点当选为簇头.仿真实验结果表明:该算法在一定程度上减少了网络的能量消耗、延长了网络的寿命,分簇性能良好.