基于能量和距离的无线传感器网络分簇算法  

Clustering algorithm based on energy and distance for wireless sensor networks

作　　者：陈浩[1] 刘广钟[1] 

机构地区：[1]上海海事大学信息工程学院,上海200135

出　　处：《信息化纵横》2009年第11期31-33,37,共4页

基　　金：上海市教委支出预算项目(2008072)

摘　　要：无线传感器网络由大量能量有限的传感器节点组成,这些节点一般都是靠电池供电。如何在这种情况下,尽量延长网络的生存周期是研究的热点问题。基于分簇的无线传感器网络路由算法不论是在网路生存周期方面,还是在数据融合方面都比自组织算法表现出了很大的优势。文中提出了一种基于能量和距离的ED-LEACH(Energy and Distance-LEACH)改进算法,在簇头的选举和簇的生成两个阶段都综合考虑了能量和距离这两个因素。仿真表明该算法较LEACH算法显著地延长了网络的生存期。A wireless sensor network consists of a large number of small sensors with limited battery power. How to prolong the life time of the sonsor network is a major challenge in desinging a wireless sensor network. Clustering routing algorithm is superior to self-organizing routing algorithm in the aspect of the life time of the network and data aggregation. This paper proposes an improved ED-LEACH algorithm （Energy and Distance-LEACH）, which takes the energy and the distance into account both in cluster head selecting phase and in cluster forming phase. Simulation result indicates that the improved algorithm outperforms the LEACH algorithm and prolongs the life time of the network dramatically.

关 键 词：无线传感器网络 ED—LEACH 分簇 能量 距离 

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