Distributed Clustering-Task Scheduling for Wireless Sensor Networks Using Dynamic Hyper Round Policy - 2017

PROJECT TITLE :

Distributed Clustering-Task Scheduling for Wireless Sensor Networks Using Dynamic Hyper Round Policy - 2017

ABSTRACT:

Prolonging the network life cycle is an important requirement for several sorts of Wireless Sensor Network (WSN) applications. Dynamic clustering of sensors into groups could be a common strategy to maximize the network lifetime and increase scalability. In this strategy, to realize the sensor nodes’ load balancing, with the aim of prolonging lifetime, network operations are split into rounds, i.e. fastened time intervals. Clusters are configured for the present spherical and reconfigured for the subsequent round therefore that the costly role of the cluster head is rotated among the network nodes, i.e. Spherical-Primarily based Policy (RBP). This load balancing approach probably extends the network lifetime. However, the imposed overhead, because of the clustering in every spherical, wastes network energy resources. This paper proposes a distributed energy-efficient theme to cluster a WSN, i.e. Dynamic Hyper Spherical Policy (DHRP), that schedules clustering-task to increase the network lifetime and reduce energy consumption. Although DHRP is applicable to any information gathering protocols that price energy potency, a Easy Energyefficient Knowledge Collecting (SEDC) protocol is additionally presented to guage the usefulness of DHRP and calculate the tip-to-finish energy consumption. Experimental results demonstrate that SEDC with DHRP is more effective than two well-known clustering protocols, HEED and M-LEACH, for prolonging the network lifetime and achieving energy conservation.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here