无线传感器网络中基于网关的多级簇树维护更新算法  

Maintenance and Update Algorithm of Hierarchical Clustering with Gateway for Wireless Sensor Network

作　　者：阎新芳[1] 张永琦[1] 王志龙[1] 李锡刚[1] 

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

出　　处：《传感技术学报》2010年第2期260-264,共5页Chinese Journal of Sensors and Actuators

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

摘　　要：由于无线传感器网络节点的能量具有不可再生性,为了减小和均衡网络中各节点的能量损耗,要求把能效高放在首位,以尽可能的延长网络生存期。文中介绍一种利用图论中极大独立集和极小支配集的概念设计的基于能量的有网关的多级簇树EAMCT-G(Energy-Aware Multilevel Clustering Tree with Gateway)算法,并提出该算法的局部维护和更新算法,使得EAMCT-G算法具有可扩展性好和自恢复能力,最后通过仿真验证算法的有效性。As the wireless sensor network nodes with a non-renewable energy,and in order to reduce and balance the energy losses of every node,it demands that the priority to energy-efficient should be paid to try to extent the whole network lifetime.Based on the concept of maximal independent set and minimum dominating set by Graph theory,it introduces a new EAMCT-G（Energy-Aware Multilevel Clustering Tree with Gateway） algorithm and then proposes its maintenance and updating algorithm.The simulation results demonstrated are effective.

关 键 词：无线传感器网络 极大独立集 极小支配集 EAMCT-G算法 

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