近邻传播聚类无线传感器网络分簇路由算法  

Affinity propagation clustering routing algorithm for wireless sensor network

作　　者：黄建清[1,2] 王卫星[1] 胡月明[3] 雷刚[1] 欧国成[1,4] 

机构地区：[1]华南农业大学工程学院,广东广州510642 [2]海南大学应用科技学院,海南儋州571737 [3]华南农业大学信息学院,广东广州510642 [4]罗定职业技术学院电子信息系,广东罗定527200

出　　处：《计算机工程与设计》2014年第2期406-410,共5页Computer Engineering and Design

基　　金：广东省中国科学院全面战略合作基金项目(2011B090300102);广东省重大科技专项基金项目(2010A080408012);2012省级扶持农业机械化发展专项基金项目

摘　　要：为解决传统无线传感器网络路由算法在分簇上存在不均匀分簇问题,设计了一种近邻传播聚类的分簇路由算法—APCRA。该算法根据节点的密集程度和最优簇头数,利用近邻传播聚类算法将传感器网络优化分簇,划分好的簇结构在整个网络生命周期内固定不变,以减少频繁组簇引发的能量消耗。选择簇头考虑各节点剩余能量和被选簇头节点至簇内其他节点的平均距离,目的让能量剩余多和与簇内其它节点通信代价小的节点担任簇头。仿真结果表明,APCRA算法分簇结构相比其它算法更优,网络能量消耗更少,网络生命周期更长。In conventional clustering routing algorithm for wireless sensor network, cluster head is generated randomly, which makes network distribution unevenly. A new affinity propagation clustering routing algorithm is proposed according to node dis- tribution density and optimal network cluster numbers, the principle of which is using affinity propagation algorithm to divide the network into several areas fixed in network lifetime to reduce energy consumption of formation clusters frequently. In the cluster head election phase, it always selects node with much more residual energy and closer distance to other nodes in the cluster. The simulation results show that the proposed algorithm has better performance in terms of network lifetime, network energy con- sumption, and clustering structure.

关 键 词：无线传感器网络 近邻传播 簇头 剩余能量 网络生命周期 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]