无线传感器网络中一种分级簇的优化算法  

The Optimization of a Cluster Tree Algorithm for Wireless Sensor Networks

作　　者：阎新芳[1] 朱玉芳[1] 安娜[1] 段磊[1] 

机构地区：[1]郑州大学信息工程学院,郑州450052

出　　处：《传感技术学报》2009年第3期401-406,共6页Chinese Journal of Sensors and Actuators

基　　金：河南省基础与前沿技术研究基金项目资助(72300410430)

摘　　要：无线传感器网络的路由将高能效放在首位,设计分级簇作为路由基础是一种能有效节能,延长网络寿命的好方法。在基于能量的分级簇(EAHC)算法的基础上,按照簇头级数和能量排队,从叶子节点开始逐级进行优化,提出一种减少簇头和降低簇树级数的优化算法(EAHC-O),能进一步地延长全网寿命,并通过仿真验证算法的有效性。Energy-efficient routing design is important requirement in wireless sensor network. Designing a high-efficient cluster tree backbone network for the basic of routing is an effective way for prolonging network lifetime. Based on the EAHC （Energy-Aware Hierarchical Clustering）algorithm, we propose EAHCO, the optimization method. This optimization algorithm reduces the level of the cluster tree and the number of cluster heads, thereby reducing the unnecessary energy dissipation in data transmitting, achieving the purpose of optimization. The simulation results demonstrate that the optimization algorithm can improve the network lifetime effectively.

关 键 词：无线传感器网络 分级簇 EAHC算法 优化 

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