Activity-aware clustering algorithm for wireless sensor networks

In a Wireless Sensor Network (WSN) environment, there are many application cases that make use of unequally importance of the nature of distributed sensors. This paper proposes a clustering algorithm for these kinds of environments: prioritising the prolonging of active sensors by way of monitoring the important regions in a network environment. The results of our extensive study for this type of environment shows a considerable increase in the number of sensed events on average by 104.28%, 73.14%, and 50.97%, compared with those of Low Energy Adaptive Clustering Hierarchy (LEACH), Hybrid Energy-Efficient Distributed (HEED), and Avoid Near Cluster Head (ANCH) algorithms, respectively.