Distributed Clustering based Energy Efficient Routing Algorithm for Heterogeneous Wireless Sensor Networks

Abstract

In wireless sensor networks, clustering is the dominantly used technique for energy efficient routing protocols. Clustering increases the scalability and lifetime of WSN. Many clustering based energy efficient algorithms were proposed like LEACH, M-LEACH, BLEACH, etc. These algorithms need additional energy to process cluster head changes and cluster heads are not uniformly distributed. Hence a distributed energy efficient protocol is proposed which selects cluster-heads based on probability ratio between initial energy of each node and average energy of the network. In the proposed method, the chance of becoming cluster head is based on having highest initial and residual energy. Experimental results show that the proposed method increases the life time of the network than traditional method in heterogeneous wireless sensor environments.