【摘要】 节点成簇算法被普遍认为是一种理想的技术,它能够增强网络的扩展性和节能性,因而被许多研究人员所引用。当前大多数的成簇协议是以概率为基础,即在簇头选择阶段使用了概率的方法。而本文提出了一种新的成簇算法,该算法基于节点的剩余能量,即在一定区域内具有最大剩余能量的节点成为簇头。仿真结果表明该算法具有很好的性能,并有效地避免了盲节点现象的过早发生。更多还原

【Abstract】 Node clustering algorithm that can increase network scalability and efficiency is commonly considered as one of the most promising techniques,and as such has been referred to by many researchers. Most of existed clustering-based protocols are based on probability,that means employing probability method in the Cluster head election phrase.A new clustering-based protocol is proposed , based on left energy .the node which will becomes cluster head has the most left energy in certain field. Simulation results show the algorithm proposed owns good performance and efficiently delay the occurrence time of dead nodes.更多还原