论文部分内容阅读
在低功耗自适应集中分层协议(LEACH-C)基础上,提出了基于LEACH-C的能量均衡路由算法(LEACH-EB),该算法采用1轮全局分簇和κ轮局部簇头更新的方式,以达到进一步延长网络生命周期的目的.鉴于采用固定的κ值时传感器网络难以获得最佳性能,分析了不同κ值下的网络性能,提出一种基于LEACH-C的动态κ值簇头选择方法 LEACH-CK.其核心思想是每次全局分簇后,结合当前分簇情况和节点剩余能量计算出一个较优的κ值.OMNeT++(面向对象的离散事件网络模拟器)仿真结果显示:LEACHCK可以有效推迟网络中第一个节点死亡的时间,同时网络具有较好的稳定性.
Based on LEACH-C, a LEACH-C based energy-balanced routing algorithm (LEACH-EB) is proposed. This algorithm uses one round of global clustering and a k-round local cluster head updating , In order to achieve the goal of further prolonging the life cycle of the network.In view of the difficulty in obtaining the best performance of the sensor network with a fixed κ value and analyzing the network performance under different κ values, a dynamic κ-value cluster based on LEACH-C The main idea of LEACH-CK is to select a preferred method of LEACH-CK after each global clustering, and to calculate a better kappa value based on the current clustering conditions and the residual energy of the nodes.OMNeT ++ (Object-Oriented Discrete Event Network Simulator) simulation results show : LEACHCK can effectively delay the dead time of the first node in the network, meanwhile, the network has better stability.