无线传感网高斯分簇路由算法的研究及实现

Gauss Clustering Routing Algorithm for Wireless Sensor Networks

针对无线传感器网络路由成簇过程中的两个关键因素:距离和剩余能量,提出一种高斯分簇路由算法(GCRA)。该算法根据簇头节点之间的最优距离确定均值,根据目标节点组成的概率带的宽度确定标准差,并且结合节点的剩余能量与概率带中目标节点的平均能量确立概率阈值函数。簇头选取过程中目标节点以与已知簇头的距离作为参数生成概率阈值,在簇形成阶段节点选取距离最近的簇头为最终簇头。仿真实验表明,与传统的LEACH算法以及CMCRP算法相比,该算法在延长网路生存周期和提高接收的数据量上均具有显著的效果。

This paper is concerned with the problem of routing for mobile wireless sensor networks.Two key factors are analyzed in this routing algorithm：distance and residual energy.A Gauss clustering routing algorithm（GCRA）is proposed.In GCRA,the optimum distance between cluster heads is set as the mean,the standard deviation is determined by target nodes.Residual energy and average energy of target nodes are also concerned in GCRA.And the node to be a cluster head is defined by the distance to the known cluster heads.In the phase of clustering,the nearest cluster head to the node is selected as its final cluster node.Comparing with LEACH and CMCRP in the wireless sensor network,the simulation illustrates that the GCRA prolongs the network lifetime highly and enhances the quantity of the received data heavily.