基于离散粒子群的WSN分簇路由算法  

DPSO-Based Clustering Routing Approach for WSN

作　　者：邹学玉[1] 曹阳[1] 刘徐迅[1] 高洵[1] 

机构地区：[1]武汉大学电子信息学院,湖北武汉430072

出　　处：《武汉大学学报（理学版）》2008年第1期99-103,共5页Journal of Wuhan University:Natural Science Edition

基　　金：国家自然科学基金(60132030);教育部博士点基金(20040486049)资助项目

摘　　要：在定义了包含邻居节点信息的粒子适应度函数的基础上,提出了一种基于离散粒子群(DPSO)的单跳路由分簇协议(DPSOCA).该协议应用DPSO优化簇首选择过程,采用无竞争开销的方式选举一组最佳节点担任簇首.研究结果表明,与LEACH算法相比,DPSOCA能有效地均衡网络节点的能量消耗和显著地延长网络寿命;采用k-收敛准则和增加惯性权重的随机性有利于提高网络寿命与收敛代数的性价比.The particle fitness is defined as its neighbor＇s information function including location and residual energy, a novel distributed clustering approach using discrete particle swarm optimization （DPSO） to optimize the clustering process for single-hop routing protocol is developed, named as DPSOCA. A set of ~timal cluster heads is dynamically created using elected method that DPSOCA has minimum energy dissipation, decreases the randomicity of node being cluster head. The results show that DPSOCA outper- forms LEACH with significantly prolonging the networks lifetime and efficiently balancing the networks energy-dissipation, and that a greater randomicity of inertia weight and k-convergence criterion achieve a higher cost of performance of network lifetime to convergence iterations.

关 键 词：离散粒子群 无线传感器网络 分簇 路由协议 网络寿命 

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