ENERGY-BALANCED ON DEMAND CLUSTERINGALGORITHM BASED ON LEACH-C

摘要

As the use of Wireless Sensor Networks (WSNs) has grown enormously, the need for energy-efficientmanagement has also risen. With advances in ubiquitous computing environment, WSNs have been broadlystudied and many energy-efficient routing protocols had been proposed. LEACH (Low Energy AdaptiveClustering Hierarchy) is a popular cluster-based protocol, which provides distributed adaptive clusteringand periodic cluster head (CH) selection rotation. As extension to LEACH, LEACH-C (LEACHCentralized) was proposed, in which the energy is utilized to select CH. However, both can’t guaranteecluster head distribution, in addition to considerable periodic clustering overhead. Furthermore, networktopology change is a critical characteristic that has influence on communication path and load distributionamong nodes. To resolve such problems, Energy-Balance on Demand Clustering Algorithm Based onLEACH-C is proposed. The algorithm adopts centralized cluster formation and distributed CH selectionmethods. Minimum energy clustering is used to divide the network into clusters, while energy and totalcommunication distance are considered as secondary criteria to select optimal CH. From simulationresults the proposed algorithm outperforms LEACH-C in life time, stability period and performanceefficiency.