论文部分内容阅读
由于无线传感网络中传感器节点能量受限,提出基于能量效率的无线传感网络快速分簇算法(EECA),在系统初始化阶段把部署区域快速分成多个簇,随后以权衡节点自身能量消耗比和度作为选择簇头节点的依据,这时候的重新选举簇头节点变成了一种局部触发的行为,由于重新选举簇头节点只在簇内进行,这大大减少了重新选举簇头节点的复杂性和计算负载.理论分析表明EECA簇形成算法的消息和时间复杂度均为O(1),说明算法的开销较小,与网络的规模n无关.仿真实验结果表明EECA具有良好的负载平衡性能和较小的协议开销,与LEACH协议相比,能够减少能量消耗,延长网络生存期.
Due to the limited energy of sensor nodes in wireless sensor networks, an energy efficient wireless sensor network fast clustering algorithm (EECA) is proposed. In the initial stage of the system, the deployment area is rapidly divided into multiple clusters, and then the node’s own energy consumption ratio As the basis of choosing cluster head nodes, the degree of harmony is changed to a kind of partial triggering behavior. Since the re-election of cluster head nodes is only carried out within the cluster, the re-election of cluster head nodes Complexity and computational load.The theoretical analysis shows that the message and time complexity of EECA cluster formation algorithm are all O (1), which shows that the algorithm has a lower cost and has nothing to do with the network size.Experimental results show that EECA has a good load balance Performance and lower protocol overhead, compared with the LEACH protocol, can reduce energy consumption and extend the network lifetime.