Based on the energy efficient, weight-clustering (EWC) algorithm, a novel algorithm called EWC-N (New EWC) is proposed. After calculating weight according to its neighbors and residual energy, the EWC-N algorithm selects the cluster-head whose weight is biggest among the neighbor nodes and dynamically adjust the distances among the cluster-heads in cluster-head selection proce ss. The algorithm decreases the energy consumption rate in the process of clustering and makes the distributions of cluster-heads more reasonable. Simulation shows that, compared with EWC, the new algorithm has a 9% increase in the energy efficiency and prolongs the network's lifetime for about 12%.%在能量有效加权分簇(EWC)算法的基础上,提出一种簇首选择算法EWC-N(new EWC).该算法根据节点的邻节点数量与剩余能量计算出权值,选出权值大的节点为簇首,在选择簇首的过程中,动态调整簇首之间的距离.该算法减少了分簇过程中能量的消耗,簇首的分布更加合理.仿真实验结果表明,该算法相对于EWC提高了能量有效利用率近9%,延长了约12%的网络生存时间.
展开▼