采用自适应退避机制的无线传感网分簇算法  

A clustering algorithm based on adaptive abdication strategy for wireless sensor network

作　　者：徐吉[1] 蒋铃鸽[1] 何晨[1] 

机构地区：[1]上海交通大学电子工程系,上海200240

出　　处：《信息技术》2008年第5期23-26,共4页Information Technology

基　　金：国家自然科学基金资助项目(60372076);上海市科委重大科技攻关项目(05dz15004)

摘　　要：传统的LEACH算法因为簇首选举的随机性而导致节点能量分布不均,从而影响网络寿命和系统吞吐量,在此基础之上提出了一种基于自适应退避机制的分簇算法,通过设定一个能量门限来衡量簇首的健康度,并采用退避机制来使那些趋于衰亡的簇首能找到合适的继任者来担当簇首,保证数据传输的可靠性。仿真实验显示,该算法能够较LEACH获得更长的网络寿命,并提高了网络的吞吐量。Due to its random selection of clusters, the traditional LEACH protocol definitely results in the unbalanced state of nodes＇ energy, which shortens the whole network lifetime and decreases the system throughput. A clustering algorithm based on adaptive abdication strategywas proposed. By setting an energy threshold to evaluate the healthiness of clusters, the algorithm enables those dying dusters to pass their status to the suitable successor according to an abdication strategy, which ensures the reliability of data transfer. The simulation shows that the algorithm brings about a longer network lifetime and a larger throughput compared with LEACH.

关 键 词：无线传感网 分簇 退避机制 簇首健康度 

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