一种混合式无线传感器网络聚类路由算法  

A Mixed Clustering Routing Algorithm for Wireless Sensor Networks

作　　者：万润泽[1] 缑西梅[2] 许芷岩[1] 

机构地区：[1]湖北第二师范学院计算机学院,武汉430205 [2]中原工学院计算机科学系,郑州450007

出　　处：《计算机与数字工程》2009年第10期55-57,64,共4页Computer & Digital Engineering

基　　金：湖北省高校中青年科技创新团队项目(编号:T200904)资助

摘　　要：分析了无线传感器网络中的的聚类路由算法LEACH和LEACH-C算法,结合这两个算法的特点,设计出簇首个数不变的LEACH-M算法。该算法采用了由基站决定首轮簇首的方式,再由本轮簇首选定下一轮簇首的方法,有效解决了LEACH中簇头随机选择时不是最优位置的问题和LEACH-C中对基站的依赖问题,另外,在簇首选取上,该算法设计出了一种低复杂性的节点权值的计算方法。通过实验结果证明,该算法在有效地延长了网络的生命周期和提高了基站接收的数据量的同时,也具有较好的适应性与健壮性。This paper analyzed the LEACH and LEACH-C algorithm in wireless sensor networks. On the basis of combining the properties of the above algorithms, we designed the LEACH-M algorithm with the invariant number of cluster heads. In this algorithm, the cluster heads in the first round are selected by the base station, and they choosed the cluster heads in next round. This method has overcomed the shortcomings that random cluster heads are not optimally dis- tributed in LEACH, and selection of cluster heads is always dependent on the base station in LEACH-C. In addition, we proposed a low complexity method for calculating the weight of the node, which determined whether it could be cluster header. The simulation results have validated that the LEACH-M algorithm can efficiently prolong the network＇s lifetime and increase the data that the base station received. Meanwhile, our algorithm has better adaptability and robustness.

关 键 词：无线传感器 分簇 LEACH LEACH-C 

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