基于改进近邻传播算法的无线传感网分簇与节能

摘要

无线传感器网络WSN中一个巨大的挑战是网络能耗.利用聚类算法对网络进行分簇和信息整合,避免了冗余数据的大量传输,延长了网络寿命.在近邻传播聚类算法的基础上提出EAPCP(enhanced affinity propa-gation clustering based on p-changed)算法,对分簇方法进行优化,提高能量利用率.综合考虑网络整体的能耗、节点的剩余能量、节点的分布情况和最优簇头数的大小,对参考度进行修改,并计算分簇完成后网络稳定运行轮数.性能分析表明,EAPCP算法在节能和分簇结果上比HEED算法好得多.%One of the biggest challenges in wireless sensor networks(WSN)is network energy consumption.Using clustering algorithm to cluster and integrate the network, it avoids the massive transmission of redundant data and prolongs the network lifetime.In this paper,we proposed an enhanced affinity propagation clustering based on p-changed (EAPCP)algorithm based on affinity propagation clustering algorithm to optimize the clustering method and improve the energy utilization rate.Considering the energy consumption of the network as a whole, the remaining energy of nodes, the distribution of nodes and the size of the optimal cluster head,the reference degree was modified and the number of rounds of network operation after cluster completion was calculated.Performance analysis shows that EAPCP algorithm is much better than HEED algorithm in energy saving and clustering results.