一种基于低能量的双簇首WSN路由算法  

A Routing Algorithm Based on Low-energy And Double Cluster-head in Wireless Sensor Network

作　　者：李辉[1] 李腊元[1] 李方云[1] 

机构地区：[1]武汉理工大学计算机科学与技术学院,武汉430063

出　　处：《武汉理工大学学报（交通科学与工程版）》2009年第3期450-453,共4页Journal of Wuhan University of Technology（Transportation Science & Engineering）

基　　金：国家自然科学基金项目(批准号:60672137;60773211);教育部高等学校博士基金项目(批准号:20060497015);新世纪优秀人才支持计划项目(批准号:NCET-08-0806)资助

摘　　要：通过对无线传感器网络经典路由分簇算法LEACH、PEGASIS的研究,提出了基于低能量的双簇首路由分簇算法BLEDCH,该算法使能量最小的K个节点尽可能的接近主簇首,使簇内节点趋近于同时消亡,当发送数据时在簇内选择能量较大且距离基站较近的节点作为Data簇首,并通过各个簇的Data簇首建立一条连接基站的关键路径,使各个簇融合后的数据能够以多跳的方式传送给基站,从而减轻了主簇首的负担,仿真结果表明,该算法延迟了第一个死亡节点出现的时间,延长了网络的生存时间,减少了能量消耗,优于LEACH和PEGASIS算法.By research on the classical clustering algorithms such as LEACH and PEGASIS,a routing algorithm based on low-energy and double cluster-head in wireless sensor network （BLEDCH） is proposed. This algorithm enables the K nodes with the lowest energy to approach to primary cluster-head and all the nodes in the clusters die at the same time, and then chooses the nodes which close to BS with the highest energy as the Data cluster-head when send data, and establishs a pivotal path by all the Data cluster-head, so the data can be sent to the BS with many hops and release the burden of primary cluster-head. Simulation results show that this algorithm has enough ability to postpone the emergency of the first node death so as to prolong the existing time of the whole network, the BLEDCH is better than LEACH and PEGASIS.

关 键 词：无线传感器网络 分簇算法 BLEDCH 关键路径 主簇首 生存时间 

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