一种基于LEACH的改进WSN路由算法

第25卷第5期2008年5月机 电 工 程MECHAN I CAL &E LECTR I CAL E NGI N EER I N GMAG AZI N EVol .25No .5M ay 2008收稿日期:2007-10-15作者简介:房晓菲(1981-),女,安徽桐城人,主要从事无线传感网络方面的研究。

一种基于L EACH 的新型W SN 路由算法房晓菲,沈永增,姚俊杰(浙江工业大学信息工程学院,浙江杭州310032)摘　要:LE ACH 是针对无线传感器网络设计的低功耗自适应分簇聚类路由算法,与一般的平面多跳路由算法相比,LEACH 算法可以将网络生命周期延长15%。

但是,LEACH 算法存在簇首开销较大、重复性成簇过多地浪费系统资源以及簇规模分布不合理等等不足。

针对LE ACH 算法的不足,从簇的形态、成簇方式和簇首选择依据等方面对其进行了改进。

改进后的算法采用固定分簇的方式;形成的簇是不均匀簇,即靠近Sink 节点的簇的半径较大,而远离Sink 节点的簇的半径较小;簇首选择的依据是节点的剩余能量。

仿真实验证明,改进后的算法具有更高的能量使用效率。

关键词:无线传感网络;路由算法;LE ACH 中图分类号:TP39 文献标识码:A 文章编号:1001-4551(2008)05-0100-04A new L EACH 2ba sed routi n g a lgor ith m for w i reless sen sor networksF ANG Xiao 2fei,SHEN Yong 2zeng,Y AO Jun 2jie(College of Infor m ation Engineering,Zhejiang U niversity of Technology,Hangzhou 310032,China )Abstract:LE ACH is a l ow energy adap tive clustering hierarchy algorith m f or wireless sens or net w orks,it can p r ol ong the lifeti m e of the net w orks by fifteen percent .But,the clusters are built after cluster 2heads are selected in LE ACH algorith m,s o cluster 2heads s pend more energy;the peri odic establish of clusters and selecti on of cluster 2heads need cost the extra expenses;the distri 2buti on of the clusters is unreas onable because of the random choice of cluster 2heads .The i m p r oved algorith m used the stati onary cluster;the of the cluster was unequal,the radius of the cluster that was far a way fr om the sink node was s maller than the radius of the cluster that was cl ose t o the sink node;the cluster 2heads were selected according t o the p resent energy of the nodes .The ne w algorith m can utilize the energy of the sens or nodes and p r ol ong the lifeti m e of the whole net w ork in theory .Si m ulati on results show that,the i m p r oved alg orith m has a higher efficiency of energy utilizati on .Key words:wireless sens or net w ork (W S N );r outing algorith m;LE ACH0　前　言无线传感网络是由大量部署在监测区域内的微型传感器节点组成,通过无线通信的方式形成一个多跳的自组织的网络系统。

一种基于ＬＥＡＣＨ的改进型无线传感器网络路由算法摘要：路由算法是无线传感器网络研究的核心技术之一。

在LEACH算法的基础上，提出了一种基于距离和能量考虑选择第二层簇头的两层LEACH算法DE-LEACH，有效避免了低能量且离基站较远的节点与基站直接通信，提高了网络生存时间和数据采集能力。

利用事件驱动的方法，减少了发送数据量，进一步延长了网络生存期。

关键词：路由算法；第二层簇头选择；网络生存时间；数据采集能力；数据融合；事件驱动中图分类号：TN915文献标识码：B文章编号：1004-373X(2009)03-036-05Improved Wireless Sensor Network Routing Algorithm Based on LEACHYAN Renqiang,TIAN Hua(Institute of Communication and Engineering,PLA University of Science & Technology,Nanjing,210007,China) Abstract：Routing algorithm is one of the key technologies of wireless sensor network.Based on the LEACH algorithm.A two-layer algorithm called DE-LEACH is proposed,it takes the cluster-head′s residual energy and distance to BS intoaccount,and then chooses a senior cluster-head.The new algorithm avoids direct communication between BS and the cluster-head which has low energy and far away from BS,thus prolongs lifetime of the network,enhances the ability of data collection.Technique of event-driven can cut down the data transmission,further extend the lifetime of network.Keywords：routing algorithm;selection of seniorcluster-head;lifetime of network;ability of data collection;data fusion;event-driven0 引言微电子技术、计算机技术和无线通信等技术的不断发展，使设计低功耗多功能的无线传感器成为可能。