Abstract :
LEACH algorithm as a classic clustering algorithm is widely used in wireless sensor networks, but not considers the number of cluster head, monitoring areas and other factors, and the network greatly huge consumption reduces the life cycle of the network. To this defects, on the basis of the optimal coverage theorem in Wang, a kind of CDE-LEACH algorithm is proposed, which pre-built data table to storage optimal coverage location coordinates of the ideal cluster head in the base station, and to combine with the guarantee of minimum network energy consumption goal to select the optimal cluster head, and to improve drawbacks of randomly selected cluster head of the LEACH algorithm. Experimental simulation platform of the Matalab7.0 is set up, the CED-of LEACH algorithm simulation is compared with LEACH algorithm results. The network energy consumption is greatly reduced, and the network life cycle is prolonged.
Keywords :
energy consumption; routing protocols; wireless sensor networks; CDE-LEACH algorithm; CED-of LEACH algorithm simulation; Matalab7.0; base station; clustering algorithm; network energy consumption; network life cycle; optimal cluster head; optimal coverage theorem; optimized LEACH algorithm; wireless sensor network; Algorithm design and analysis; Base stations; Clustering algorithms; Computers; Energy consumption; Wireless communication; Wireless sensor networks; LEACH; energy consumption; life cycle; wireless sensor network;
