基于粒子群聚类优化的分簇路由算法  

Clustering routing algorithm based on particle swarm clustering optimization

作　　者：梁青[1] 鲁剑[1] 

机构地区：[1]西安邮电大学电子工程学院,陕西西安710121

出　　处：《西安邮电大学学报》2017年第4期15-20,共6页Journal of Xi’an University of Posts and Telecommunications

基　　金：国家自然科学基金资助项目(61202490);陕西省自然科学基础研究计划资助项目(2014JM2-6117);陕西省教育厅科学研究计划资助项目(15JK1654)

摘　　要：为延长无线传感器网络的生命周期,给出一种基于粒子群聚类优化的分簇路由算法。根据网络内存活节点的数目确定最优簇首数,将能量均方误差引入粒子群聚类算法的适应度函数中,以此改进粒子群聚类算法,并利用改进后的粒子群聚类算法对整个网络进行能量均衡化分簇。基于节点的剩余能量、节点与基站的距离以及簇首节点到簇内其他成员节点的平均距离等因素,评选簇内最优簇头。在100m×100m区域内撒播100个传感器节点进行仿真实验,结果表明,与低功耗自适应集簇分层协议算法相比,改进算法的首个节点死亡时间可延长34.04%,有效节点死亡时间可延长12.12%。In order to prolong the lifet ime of wireless sensor network , a clustering routing algorithm based on particle swarm clustering optimization is proposed. The optimal number of clusters is determined by the number of nodes that can work , and the energy mean square error is introduced into the fitness function to improve the particle swarm clustering a lgorithm , which is later used to perform energy equalization clustering for network nodes. The best cluster head is selected based on the residual energy of nodes, the distance between nodes and base s tation , and the average distance between cluster head nodes and other member nodes in the cluster. 100 sensor nodes are sown in a 100 m × 100 m region fo r simulation experiments, and the results show that, compared with the low energy adaptive clustering hierarchy a lgorithm , the given one can make the death time of the f irs t node be prolonged by 34. 04%, and the death time of the effective node be prolonged by 12. 12%.

关 键 词：无线传感器网络 最优簇首数 粒子群聚类算法 能量均方误差 最优簇头 

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