MHST-LEACH—基于LEACH-EE高效聚类路由算法  

Multi Hop Spanning Tree clustering routing algorithm based on LEACH-EE

作　　者：陈培培[1] 张华忠[1] 

机构地区：[1]山东大学计算机科学与技术学院,济南250101

出　　处：《计算机工程与应用》2011年第1期120-122,共3页Computer Engineering and Applications

摘　　要：针对LEACH-EE协议中所有簇首通过一条多跳链向基站传输数据可能产生迂回传输的问题,提出了MHST-LEACH。该算法通过簇首收集数据,然后建立一棵以基站为根,簇首为节点的倒置多跳生成树,最后数据经过融合沿着这棵多跳生成树传送到基站。采用MHST优化了数据传输路径,从而减少了能量消耗,延长了网络的生存周期。通过仿真证明此方法行之有效。In view of the fact that all the cluster heads in LEACH-EE protocol transmitting data to the base station along a multi hop chain,may have the problem of circuitous transmission,this paper presents MHST-LEACH.This algorithm collects the data through the cluster head,and then an inverted Multi Hop Spanning Tree is established,which selects the base station as the root and the cluster heads as the nodes.Finally the data after integrated is sent to the base along this tree.MHST optimizes the data transmission path,reduces the energy consumption and prolongs the network life cycle.The simulation proves that this method works well.

关 键 词：无线传感器网络 低功耗自适应集簇分层型(LEACH)协议 能量模型 多跳链 多跳生成树 

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