Wireless Sensor Networks for Energy And Distance-Based LEACH Clustering Algorithm

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 to improve the LEACH algorithm randomly selected the drawbacks of the cluster head. 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.