摘要
LEACH算法作为经典分簇算法在无线传感器网络中有着广泛应用,但由于没有考虑簇头数量及监测区域等因素,使得网络消耗巨大,大大缩减了网络的生命周期。针对这一缺陷,本文在Wang的最优覆盖定理的基础上,提出CDE-LEACH算法,通过在基站中预构建"数据表"存储最优覆盖理想簇头位置坐标,结合保证网络能量消耗最小的这一目标来选取最优的簇头,推导出了新的簇头与簇内成员选择算法。在Matalab7.0实验仿真平台下,通过对提出的CDE-LEACH算法进行仿真,与LEACH算法结果对比发现,网络能量消耗大大减少,并且延长了网络生命周期。
LEACH algorithm as a classic clustering algorithm is widely used in wireless sensor networks, but not consider the number of cluster head,monitoring areas and other factors, the network greatly consumes huge reduce the life cycle of the network.To this defects, on the basis of the optimal covering theorem in Wang,propose a kind of CDE-LEACH algorithm, it is in the base station to pre-built"data table"to storage optimal coverage location coordinates of the ideal cluster head, and to combine with the guarantee of minimum network energy consumption goal to select the optimal cluster head, and algorithm of produing cluster head and producing cluster members is worked out.On experimental simulation platform of the Matalab7.0,the CED-of LEACH algorithm simulation, compared with LEACH algorithm results, the network energy consumption is greatly reduced, and extend the network life cycle.
出处
《电子测试》
2013年第4S期285-288,共4页
Electronic Test
