无线传感器网络中异步成簇算法的研究  

Research on Asynchronous Clustering Algorithm in Wireless Sensor Network

作　　者：杨永雷[1] 朱军[1] 

机构地区：[1]安徽大学电子科学与技术学院,安徽合肥230039

出　　处：《计算机技术与发展》2010年第2期145-147,151,共4页Computer Technology and Development

基　　金：国家自然科学基金资助项目(60772123);安徽大学人才队伍建设经费资助项目(02203105)

摘　　要：在无线传感器网络的一些成簇算法中,所有的簇头都要严格按照全局时间同步进行周期性的改选,即使传感数据较少的簇也要进行改选。因此,文中在LEACH(Low Energy Adaptive Clustering Hierarchy)算法基础上提出了异步成簇算法,即在成簇之后不再按照全局同步进行簇头改选,而是根据各个簇内传感数据的多少实时地进行簇头改选。它可以节省传感数据较少的簇内节点进行改选所需要的能量,从而达到有效地延长了网络的生命周期的目的。结果表明,异步成簇算法比LEACH算法能更有效地利用节点上的能量资源。In some algorithms of wireless sensor network, all cluster heads are re-elected in strict accordance with global synchronization, even if some cluster heads sending few packets have to re - elected when the time of a round is over. Based on the LEACH algorithm, asynchronous clustering algorithm is proposed. The algorithm means that after the first time of clustering re - elections of cluster heads are not in accordance with global synchronization, but in accordance with thenumber of packets within the cluster for real- time. In this way, the algorithm can reduce the energy of duster head re - electing for the duster with few packets and so as to extend the life cycle of the network effectively. The result shows that our algorithm can make use of the engery in nodes effectivelly than LEACH.

关 键 词：无线传感器 成簇算法 异步 LEACH 能耗 

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