Dynamic Service Policy-Based Clustered Wireless Sensor Networks

Energy is one of the main obstacles to deploying wireless sensor networks (WSNs) because tiny sensor nodes cannot accommodate sufficient energy for achieving the desired level of usage. The clustering protocols of wireless sensor network attain the acme popularity among researchers because of effective usage clustering concepts based on locality and the election of a cluster head for each of them. We derive motivation from energy saving clustering schemes and propose an enhancement by saving energy and prolonging the lifetime of a sensor network significantly. The Low Energy Adaptive Clustering Hierarchy (LEACH) achieves popularity for its simplicity and applicability in WSNs. A large number of works exist that modify LEACH to strengthen the applicability of this scheme in practice, but only limited to the cluster set-up phase. In this paper, we observe a major problem that exists in all of the clustering protocols based on LEACH. That is, LEACH and its variants encounter premature death of cluster heads because data transmission time of each cycle of communication is fixed. Our proposed dynamic service policy-based scheme decreases the premature death of cluster heads and packet loss significantly.