Clustering Based on the Node Health Status in Wireless Sensor Networks

Abstract

One of the applications of wireless sensor network is the forest fire monitoring which has different characteristics from others. In this application, the connectivity of nodes should not be destroyed just because of nodes lose their energy or burnt in the fire. Since the wide area of monitoring, the clustering method is considered as the efficient routing to increase its scalability as well as reduce energy consumed of nodes. Many clustering methods which are mostly based on Leach protocol are proposed without considering the node’s failure. Here, we proposed the node health status as a parameter to select a Cluster Head and compared its performance with Leach, MTE and the direct algorithm. Results show that the number of packets received and the alive nodes of the proposed method are higher than others. Identically, it has the lowest average end to end delay which is suitable for forest fire application.