无线传感器网络区域内心距离的固定分簇算法

Fixed clustering algorithm considering inner point distance in region

摘要:

分布式分簇算法Low Energy Adaptive Clustering Hierarchy(LEACH)中每轮的簇头数量不稳定以及位置分布不均匀,针对此问题,为了延长无线传感网络的稳定周期,优化簇头选举机制,以及均衡网络的能量消耗,提出了一种改进的固定分簇算法。该算法采用固定分簇技术,以汇聚节点为中心将网络划分为等大小的区域。在簇头选举阶段,引入代价函数,综合考虑固定分簇内各节点剩余能量、区域的内心距离、位置布局等因素,优化簇头的数量和布局。通过MATLAB仿真实验表明,改进后的算法与原算法对比,均衡了网络能量消耗,每轮中簇头数量稳定且分布较均匀,有效延长了网络的稳定周期、半衰周期和生命周期。

Abstract:

The number of cluster heads per round is unstable and the distribution of cluster heads is uneven in the distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH). So, in order to prolong stability period of wireless sensor networks, optimize cluster head election mechanism and balance energy consumption of nodes, an improved fixed clustering algorithm was proposed. The algorithm makes use of fixed clustering technology to divide network into several even regions taking the sink node as center. In stage of cluster head election, cost function is introduced to optimize the number and layout of cluster heads, with consideration of residual energy of nodes、inner point distance in region and location layout. The simulation results of MATLAB show that, compared to the original algorithm, the improved algorithm can balance energy consumption of network with stable number of cluster heads and uniform distribution in each round, and also effectively extend stability period、half decay period and life period of network.