Adaptive Balanced Clustering For Wireless Sensor Network Energy Optimization

摘要

Many researches in wireless sensors network clustering aim to optimize the power and to balance the cluster with respect to cluster head and cluster nodes. The optimization of cluster and node in balanced way, will balance the processing overhead - and thus power consumption - over the clusters and nodes, so, the network nodes death will be balanced. In order to balance the clustering of the network in terms of equi-sizes clusters or equi-potential clusters, in some networks, far nodes will be very far from any clusters, and those nodes couldn't be included in any balanced clusters. This paper finds a solution for the far nodes. The solution that is contributed in this paper is based on balanced clustering of the network ignoring all far nodes temporary or initially, then, building virtual clustering technique. The fart nodes will be clustered independently in virtual clusters. Those clusters don't have heads of clusters that communicates directly with the base station, but instead it implies virtual cluster head that communicates directly with non-cluster head node in the nearest real cluster. The contributed algorithm of this paper where implemented and simulation results were recorded indicating that, it’s efficient power consumption algorithm, and the balance of clusters will not be so affected. The comparison with LEACH, LEACH-M, and LEACH-L is demonstrated, in addition to the EECA algorithm.