Abstract
Wireless sensor networks (WSNs) are used in many different fields. One of the most recent and rapidly expanding applications is the Internet of Things (IoT), which enables the connectivity of numerous objects or devices over the Internet. However, WSNs have a bigger concern about battery power than mobile ad hoc networks, which shortens the network's lifetime. As a result, extensive research has been done on lowering WSNs' energy usage. Designing a hierarchical clustering algorithm is one of many methods for lowering the energy consumption of WSNs. Given the restricted hardware capabilities of the sensor nodes, modeling and building energy-efficient routing solutions to enhance the overall network lifetime has emerged as one of the most crucial approaches in wireless sensor networks. Cluster-based heterogeneous routing protocols, a typical feature of routing technology, have demonstrated efficacy in managing topology, energy consumption, data collection or fusion, dependability, or stability in distributed sensor networks. The existing Distributed Energy-Efficient Clustering (DEEC) clustering protocol is changed in this study by switching the power level between the nodes and adding a threshold limit for cluster head selection. The number of packets sent to a base station increases by 843% when comparing the proposed improved DEEC protocol to the existing DEEC protocol, increasing the number of living nodes to more than 10,000 rounds, or over 30,000 rounds, which can be used to extend the WSN lifetime. The suggested algorithm outperforms alternative energy-efficient protocols in terms of stability period and network lifetime under various scenarios of area, energy, and node density.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.