无线传感网络中能量和距离改良的LEACH分簇算法

Improved LEACH clustering algorithm by the energy and distance in wireless sensor network

LEACH算法作为经典分簇算法在无线传感器网络中有着广泛应用,但由于没有考虑簇头数量及监测区域等因素,使得网络消耗巨大,大大缩减了网络的生命周期。针对这一缺陷,在Warneke的最优覆盖定理的基础上,提出CDE-LEACH算法,通过在基站中预构建"数据表"存储最优覆盖理想簇头位置坐标,结合保证网络能量消耗最小这一目标来选取最优的簇头,改善LEACH算法随机选择簇头的弊端。在Matlab 7.0实验仿真平台下对提出的CDE-LEACH算法进行仿真,与LEACH算法结果对比发现,网络能量消耗大大减少,并且延长了网络生命周期。

LEACH algorithm as a classic clustering algorithm is widely used in wireless sensor networks. But for the number of cluster head, monitoring areas and other factors are not taken into consideration, the network greatly consumes, and its life is hugely reduced. To overcome these defects, the author proposed a kind of CDE-LEACH algorithm on the basis of the optimal covering theorem presented by Warneke. In the suggested algorithm, it pre-buih ＂data table＂ to storage optimal coverage location coordinates of the ideal cluster head in the base station and combined with the goal of guaranteeing minimum network energy consumption to select the optimal cluster head, and to overcome the drawbacks of the cluster head randomly selected by the LEACH algorithm. The simulations of CED-LEACH algorithm and LEACH algorithm were carried out on the experimental simulation platform, Matlab 7.0, and their results were compared. The results show the suggested algorithm greatly reduced the network energy consumption, and extend the network life cycle.