Indian Journal of Science and Technology
DOI: 10.17485/ijst/2016/v9i3/80493
Year: 2016, Volume: 9, Issue: 3, Pages: 1-6
Original Article
G. V. Thiriveni1* and M. Ramakrishnan2
1Department of Computer Science, Bharathiyar University, Coimbatore – 641046, Tamil Nadu, India; [email protected] 2Department of Computer Science, Madurai Kamaraj University, Madurai – 625002, Tamil Nadu, India; [email protected]
*Author For Correspondence
G. V. Thiriveni
Department of Computer Science, Bharathiyar University, Coimbatore – 641046, Tamil Nadu, India; [email protected]
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.
Keywords: Clustering Schemes, Energy Efficient Protocols, Heterogeneous WSN, LEACH, Lifetime of WSN, WSN
Subscribe now for latest articles and news.
