A Clustering Algorithm Based On Local Competition And Double-Weigh Communication-Energy-Consumption For Wireless Sensor Networks

Clustering techniques have emerged as a popular choice for achieving energy efficiency and scalable performance in large scale sensor networks. In order to achieve efficient use of energy networks that extend the network time, increase the amount of data transfer, this study and reference in many previous proposed clustering algorithms, this paper introduces a Clustering Algorithm based on Local Competition and Double Weigh Communication consumption for Wireless Sensor Networks. In the cluster head selection phase, uses a strategy based on energy and ID which is called local competitive, then in the cluster formation uses a strategy based on taking into account of plain nodes and cluster head node communication consumption, this above method is the introduced algorithm for clustering. Simulation results show that both the network life time and the amount of data transmission have a significant improvement compared with LEACH, etc.