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

PROJECT TITLE :

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

ABSTRACT:

Prolonging the network life cycle is a vital requirement for many types of Wireless Sensor Network (WSN) applications. Dynamic clustering of sensors into groups could be a popular strategy to maximize the network lifetime and increase scalability. During this strategy, to achieve the sensor nodes' load balancing, with the aim of prolonging lifetime, network operations are split into rounds, i.e., mounted time intervals. Clusters are configured for the present round and reconfigured for the next spherical thus that the expensive 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 each spherical, wastes network energy resources. This Project proposes a distributed energy-efficient scheme to cluster a WSN, i.e., Dynamic Hyper Round Policy (DHRP), which schedules clustering-task to increase the network lifetime and scale back energy consumption. Although DHRP is applicable to any knowledge gathering protocols that price energy potency, a Easy Energy-economical Knowledge Collecting (SEDC) protocol is also presented to guage the usefulness of DHRP and calculate the top-to-end energy consumption. Experimental results demonstrate that SEDC with DHRP is more effective than 2 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