Abstract

Wireless sensor networks (WSNs) are typically made up of small, low-power sensor nodes (SNs) equipped with capability for wireless communication, processing, and sensing. These nodes collaborate with each other to form a self-organizing network. They can collect data from their surrounding environment, such as temperature, humidity, light intensity, or motion, and transmit it to a central base station (BS) or gateway for additional processing and analysis. LEACH and TSEP are examples of cluster-based protocols developed for WSNs. These protocols require careful design and optimization of CH selection algorithms, considering factors such as energy consumption, network scalability, data aggregation, load balancing, fault tolerance, and adaptability to dynamic network conditions. Various research efforts have been made to develop efficient CH selection algorithms in WSNs, considering these challenges and trade-offs. In this paper, the Grey Wolf Optimization (GWO) algorithm is employed to address the problem of selecting CHs (CHs) in WSNs. The proposed approach takes into account two parameters: Residual Energy (RE) and the distance of node (DS)s from the BS. By visualizing and analyzing the GWO algorithm under variable parameters in WSNs, this research identifies the most appropriate node from all normal nodes for CH selection. The experimental results demonstrate that the proposed model, utilizing GWO, outperforms other approaches in terms of performance.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call