基于静态分簇的LEACH算法改进研究  

Improvement of LEACH algorithm based on static clustering

作　　者：韩涛[1] 李训铭[1] 

机构地区：[1]河海大学能源与电气学院,江苏南京210000

出　　处：《电子设计工程》2014年第6期109-112,共4页Electronic Design Engineering

摘　　要：LEACH算法是为满足高效节能需要而提出的一种典型的分簇协议。在此基础上,提出了一种改进算法:主要体现在在网络开始工作时使用静态分簇,以簇为单位进行簇内节点轮换当选为簇首,簇间以及簇与基站间的通讯采用单跳与多跳结合的方式。最后使用NS2对LEACH算法和改进的算法进行仿真对比,证实了改进后的算法在与LEACH算法相比性能有了很大的提高。LEACH algorithm is a typical clustering protocol proposed to meet the needs of energy-efficient.This paper proposed a static clustering algorithm on the basis of it：mainly reflected in the use of static clustering in networks when they start working,node in the cluster nuit elected as the cluster head node in turn,using a combination of single-hop and multi-hop communication between the cluster-cluster and cluster-BS（base station）.Finally,using NS2 simulation comparison of LEACH algorithm and improved algorithm,confirming the improved algorithm compared with LEACH algorithm performance has been greatly improved.

关 键 词：LEACH路由协议 静态分簇 轮换 多跳 

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