基于地理位置的HEED非均匀分簇算法  

HEED Non-uniform Clustering Algorithm Based on Geographic Location

作　　者：渠帅军 吕红芳[1] 赵静[1] 

机构地区：[1]上海电机学院电气学院,上海201306

出　　处：《上海电机学院学报》2016年第3期170-175,共6页Journal of Shanghai Dianji University

基　　金：上海市经济和信息化委员会专项资金项目资助(12AZ22)

摘　　要：HEED-M分簇算法中,簇首节点与汇聚节点采用多跳路由的方式进行通信,距汇聚节点越近的节点越容易过早地耗尽能量而失效。针对上述问题,提出基于地理位置的HEED非均匀分簇路由算法(LHEED),根据簇首节点距离汇聚节点的距离动态地调整簇半径的大小。使距汇聚节点近的簇首簇半径较小,距汇聚节点远的簇首簇半径较大,从而有效地均衡网络的能量消耗。仿真结果表明,该算法可有效延长网络的寿命。For H EED -M clustering algorithm,cluster head nodes and sink node communicate in a multi-hop routing way so that energy easily depleter prematurely near the sink node more,causing system failure. To solve the problem,this paper proposes a HEED non-uniform clusteringalgorithm based on geographic location. The algorithm dynamically adjusts size of radius of the cluster according to the distance between cluster head nodes and sink node. Cluster of the head ndes near the sink node is small,and that of the head nodes far from the sink node is large.This w ay,energy consumption of the network is balanced effectively. Simulation results show that thealgorithm is effective in prolonging the network life.

关 键 词：地理位置 HEED 非均匀分簇 簇半径 

分 类 号：TP212.9[自动化与计算机技术—检测技术与自动化装置]