基于正六边形网格划分的改进非均匀分簇算法

An Improved Uneven Clustering Algorithm Based on Hexagonal Grid

针对非均匀分簇路由算法中频繁簇头选举带来的簇内和簇间能耗、网络部署密集易造成数据冗余等问题,提出一种基于正六边形网格划分的改进非均匀分簇算法(HGUC)。首先,将网络正六边形网格划分,遍历选举每个网格能量最大的节点作为备选簇头;其次,考虑最优簇头数、剩余能量和节点密度确定最终簇头和修改竞争半径,从而减少能耗,降低数据冗余。仿真结果表明,HGUC算法与LEACH算法、非均匀成簇EEUC算法对比,网络生存寿命分别延长了58.84%、51.68%.

Due to inter cluster network energy consumption caused by frequent cluster head election and data redundancy caused by dense sensor nodes in uneven clustering algorithm, a better uneven clustering algorithm based on regular hexagonal grids(HGUC) is proposed. Firstly, the hexagonal grids of the network is divided and the largest energy node is chosen as an candidate cluster head in each grid through traversing. Secondly, the final cluster heads are determined and the competitive radius are modified by considering the best number of cluster heads, the residual energy and the node density to reduce energy consumption and data redundancy. Simulation results demonstrate that the network lifetime of HGUC algorithm is improved by 58.84% and 51.68% compared with LEACH and EEUC respectively.