无线传感器网络中改进的HEED分簇算法  

An improved HEED clustering algorithm for Wireless Sensor Network

作　　者：杨梦宁[1] 杨丹[1] 黄超[1] 

机构地区：[1]重庆大学软件学院,重庆400044

出　　处：《重庆大学学报（自然科学版）》2012年第8期101-106,共6页Journal of Chongqing University

基　　金：国家自然科学基金资助项目(60972105);重庆市自然科学基金资助项目(CSTC2009Bb2364)

摘　　要：在无线传感器网络中,基于分簇的路由协议在能量消耗、拓扑控制以及数据融合等方面具有优势。采用完全分布式产生簇头的HEED协议具有分簇速度快、簇头均匀等优点。但是HEED协议没有考虑网络中节点的移动性,当邻居节点距离发生变化时,通过簇内最小平均功率(AMRP)决定节点属于哪个簇会导致簇头能量开销过大,网络生命周期减小等问题。针对HEED分簇算法存在的问题,提出了一种基于稳定性的S-HEED分簇算法。S-HEED协议以稳定性作为参数来决定节点的所属簇,解决了因为移动性带来的簇内节点和簇头能量消耗过高问题。仿真实验证明,S-HEED算法有效的减少了簇头节点的能耗,延长了网络寿命。In wireless sensor network, routing protocols which based on clustering have the advantages of energy consumption, topology management and data fusion. The HEED protocol, which generates cluster heads based on distributed algorithm, drives up the rate of clustering and creates well-distributed cluster heads. However, it does not consider the mobility of nodes in the network. When the distance between neighbor nodes has changed, the AMRP method which decides the node belongs to different cluster heads would cause problems such as high energy consumption, short lifetime of network and so on. Responding to these problems, the paper proposes the S-HEED, a clustering algorithm based on stability, which chooses the stability as a parameter of nodes when choosing a cluster head. With S-HEED algorithm, the high energy consumption problem among cluster nodes and cluster heads caused by the mobility is tackled. The simulation experiment demonstrates that the S-HEED algorithm lower the energy consumption of cluster heads and prolongs the network lifetime.

关 键 词：分簇算法 无线传感器网络 S-HEED 稳定性 网络寿命 

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