DACHE: A Data Aggregation-Based Effective and Optimized Cluster Head Election Routing Protocol for HWSNs

Most of the wireless sensor networks (WSNs) are having intrinsic resource limitations such as energy, link, and computational resources since energy is consumed by all the resources. Thus, there is a dare need to develop energy-efficient protocols that escalate the longevity of the network for collecting data over a long time. In this work, we propose a data aggregation-based effective and optimized CHs election routing protocol for heterogeneous WSNs. These networks consist of three levels of heterogeneity. In this method, a threshold-based formula is used which helps in optimized cluster heads (CHs) election. A new chain-based data aggregation process is also discussed in this paper which helps in the effective data gathering process. This threshold formula considered three criteria namely node and sink distance, node remaining energy, and total networks energy which decreases the energy depletion in both inter and intra communication between the sensor, CHs, and sink. This efficient data gathering process also removes the duplicate at the time of data collection from the deployed nodes and reduced the energy depletion and network overheads. The number of alive and dead, the sum of energy depletion, and a number of the message transferred to the control node matrices are considered to investigate the enactment of the proposed scheme by using the MATLAB. After a comprehensive analysis, it has been evident that the proposed method accomplishes healthier than that of the existing methods.