In this paper,a low-energy-node clustering algorithm is proposed.Comprehensively considering the residual energy and load balance of neighboring node of low-energy node,the best cluster-head in low-energy nodes' area is figured out.Then,the best cluster-head in the other areas is chosen through iteration until all areas in entire network are traversed.The simulation results show that,in comparative analysis with low-energy adaptive clustering hierarchy(LEACH) and geographical adaptive fidelity (GAF),the algorithm realizes the balance of network energy consumption and the extension of network lifetime.%提出了一种关注弱节点的分簇算法.综合考虑弱节点邻居节点的剩余能量和负载均衡度,计算出弱节点所在区域的最优簇头,并通过迭代选出剩余区域弱节点的最优簇头,直至整个网络所有区域均选出最优簇头.与低功耗自适应分簇(LEACH)算法和地域自适应保真(GAF)算法的仿真结果对比分析表明:该算法可以实现网络能耗均衡,最大限度延长网络寿命.
展开▼
