Energy Efficient Cluster Head Selection Research Articles

Retraction notice: Hybrid artificial bee colony and glow worm algorithm for energy efficient cluster head selection in wireless sensor networks

Retraction notice: Hybrid artificial bee colony and glow worm algorithm for energy efficient cluster head selection in wireless sensor networks

Energy-efficient cluster head selection in wireless sensor networks-based internet of things (IoT) using fuzzy-based Harris hawks optimization

Energy-efficient cluster head selection in wireless sensor networks-based internet of things (IoT) using fuzzy-based Harris hawks optimization

Optimizing energy-efficient cluster head selection in wireless sensor networks using a binarized spiking neural network and honey badger algorithm

Wireless Sensor Networks (WSNs) play a vitalparton some applications, like environmental monitoring, healthcare, industrial automation. Optimizing the performance of WSN is essential to ensure efficient data delivery while conserving energy resources. This manuscript addresses the challenges of Multi-Objective Cluster Head Selection and Energy-Aware Routing in WSNs through the development of the Binarized Spiking Neural Network optimized with the Honey Badger Algorithm (EACHS-BzSpNNHBA-WSN). The appropriate cluster heads selection is vital for the overall presentation of WSNs, influencing data aggregation, routing, and energy consumption. Conventional approaches often struggle to balance the conflicting objectives of maximizing network lifetime, minimizing energy consumption, and ensuring timely data delivery. Therefore, there is a pressing need for innovative solutions capable of addressing these multi-objective optimization challenges. In this study, the EACHS-BzSpNNHBA-WSN framework is proposed, leveraging the computational power of Binarized Spiking Neural Networks and the optimization capabilities of the Honey Badger Algorithm to identify optimal cluster heads in WSNs. By formulating the cluster head selection as a multi-objective optimization problem, the aim is to achieve robust data delivery while minimizing energy consumption and extending the network lifetime. The proposed framework is implemented in MATLAB platform. The performance assessment is conducted using various metrics, including the number of active nodes, packet drop rate, energy consumption, network lifetime, delay, throughput, packet delivery ratio. Comparative analysis with existing models demonstrates the effectiveness of the EACHS-BzSpNNHBA-WSN approach.

Taylor-Spotted Cat Optimization (Taylor-SCO): An Energy-Efficient Cluster Head Selection Algorithm with Improved Trust Factor for Data Routing in WSN

Wireless Sensor Network (WSN) has inexpensive, small, and less energy sensor nodes, which are allocated in random ways in particular areas for measuring the phenomenon or events in that field. In recent days, WSN has played a vital role in various applications, like industrial monitoring, medical treatments, agricultural monitoring, and military operations. However, the security challenges and network lifetime are the main issues in the existing methods. In order to overcome these issues, the Taylor-Spotted Cat Optimization (Taylor-SCO) approach is devised in this paper. Here, the Cluster Heads (CHs) are selected based on the developed optimization method, named Taylor CSO. Moreover, the delay, distance, and energy parameters are considered for effective Cluster Head Selection (CHS). Here, route maintenance is also done for increasing network lifetime and reducing complexities. In addition, the Modified K-Vertex Disjoint Paths Routing (KVDPR) model is established for routing. The modification of KVDPR is carried out using several factors, such as link reliability, throughput, and various trust factors. Moreover, the developed Taylor-SCO algorithm is developed by combining the Spotted Hyena Optimizer (SHO), Cat Swarm Optimization (CSO) algorithm, and Taylor series. The Taylor-SCO achieved better performance with energy consumption, trust, and throughput of 0.00037 J, 0.51, and 793160 kbps.

A Novel Approach for Gender Prediction through Fingerprint Analysis using Fuzzy C-Means Algorithm and Artificial Neural Network

Wireless Sensor Networks (WSN) is a group of Sensor Nodes (SNs) which are performed to intellect a normal singularity from an environment. The minimum resources and computational power of WSN creates vulnerable to number of security attacks. To addresses this problem, this paper proposes a Multi-objective Trust-aware Dynamic Weight Pelican Optimization Algorithm (M-TDWPOA)-based secure and energy aware multi-hop routing in WSN with the Base Station (BS). The proposed method comprises of two significant steps: Initially, dynamic energy-efficient Cluster Head (CH) selection by utilizing the multi-objective functions such as Distance between neighbor nodes, Distance between BS to CH, Energy, Centrality and Trust Threshold. Then, dynamic secure multi-hop routing is selected by the multi-objective functions such as Distance between BS to CH, Energy, Trust Threshold which is dynamically reducing the network overhead. Furthermore, a security aware multi-hop routing is employed through the different trust classes like direct, indirect, recent and authentication. The proposed M-TDWPOA approach is estimated with various performance metrics like alive nodes, dead nodes, energy consumption, Throughput and so on. The proposed M-TDWPOA achieves the minimum energy consumption of 0.4927J, 0.4851J, 0.4771J, 0.4693J and 0.4617J when compared to the existing methods like Fractional Artificial Lion (FAL).

Multi-objective Trust-aware Dynamic Weight Pelican Optimization Algorithm for Secure Cluster Head and Routing Selection in WSN

Wireless Sensor Networks (WSN) is a group of Sensor Nodes (SNs) which are performed to intellect a normal singularity from an environment. The minimum resources and computational power of WSN creates vulnerable to number of security attacks. To addresses this problem, this paper proposes a Multi-objective Trust-aware Dynamic Weight Pelican Optimization Algorithm (M-TDWPOA)-based secure and energy aware multi-hop routing in WSN with the Base Station (BS). The proposed method comprises of two significant steps: Initially, dynamic energy-efficient Cluster Head (CH) selection by utilizing the multi-objective functions such as Distance between neighbor nodes, Distance between BS to CH, Energy, Centrality and Trust Threshold. Then, dynamic secure multi-hop routing is selected by the multi-objective functions such as Distance between BS to CH, Energy, Trust Threshold which is dynamically reducing the network overhead. Furthermore, a security aware multi-hop routing is employed through the different trust classes like direct, indirect, recent and authentication. The proposed M-TDWPOA approach is estimated with various performance metrics like alive nodes, dead nodes, energy consumption, Throughput and so on. The proposed M-TDWPOA achieves the minimum energy consumption of 0.4927J, 0.4851J, 0.4771J, 0.4693J and 0.4617J when compared to the existing methods like Fractional Artificial Lion (FAL).

An Energy-Efficient Cluster Head Selection and Secure Data Transmission in WSN using Spider Monkey Optimized Algorithm and Hybrid Cryptographic with Security

To conserve energy in wireless sensor networks, clustering is the well-known strategies. However, choosing a cluster head that is energy efficient is crucial for the best clustering. Because data packets must be transmitted between cluster members and the sink node, improper cluster head selection (CHs) uses more energy than other sensor nodes. As a result, it lowers the network's performance and lifespan. Due to the requirement that this network implement appropriate security measures to guarantee secure communication. This paper provides a novel cluster head selection technique that addresses issues of networks’ lives and energy usages using Spider Monkey Optimised Fuzzy C-Means Algorithm (SMOFCM). The CH is chosen using the Spider Monkey Optimisation method in the proposed SMOFCM approach, which builds on the Fuzzy C-means clustering framework. The hybrid cryptographic technique is appropriate for WSN for safe data transmission because it can address sensor challenges such processing power, storage capability, and energy. The Rivest-Shamir-Adleman (RSA), advanced encryption standards (AES), and the suggested algorithm are all used at various stages. Because asymmetric key cryptography makes key management simpler but symmetric key cryptography offers a high level of security. The AES algorithm has been created for phase 1. Phase 2 employed RSA, and all phases were carried out concurrently. According to the simulation results, it reduces energy use, lengthens the network's lifespan, and offers faster encryption, decryption, and execution times for secure data transmission

SWARAM: Osprey Optimization Algorithm-Based Energy-Efficient Cluster Head Selection for Wireless Sensor Network-Based Internet of Things.

The Internet of Things (IoT) has transformed various aspects of human life nowadays. In the IoT transformative paradigm, sensor nodes are enabled to connect multiple physical devices and systems over the network to collect data from remote places, namely, precision agriculture, wildlife conservation, intelligent forestry, and so on. The battery life of sensor nodes is limited, affecting the network's lifetime, and requires continuous maintenance. Energy conservation has become a severe problem of IoT. Clustering is essential in IoT to optimize energy efficiency and network longevity. In recent years, many clustering protocols have been proposed to improve network lifetime by conserving energy. However, the network experiences an energy-hole issue due to picking an inappropriate Cluster Head (CH). CH node is designated to manage and coordinate communication among nodes in a particular cluster. The redundant data transmission is avoided to conserve energy by collecting and aggregating from other nodes in clusters. CH plays a pivotal role in achieving efficient energy optimization and network performance. To address this problem, we have proposed an osprey optimization algorithm based on energy-efficient cluster head selection (SWARAM) in a wireless sensor network-based Internet of Things to pick the best CH in the cluster. The proposed SWARAM approach consists of two phases, namely, cluster formation and CH selection. The nodes are clustered using Euclidean distance before the CH node is selected using the SWARAM technique. Simulation of the proposed SWARAM algorithm is carried out in the MATLAB2019a tool. The performance of the SWARAM algorithm compared with existing EECHS-ARO, HSWO, and EECHIGWO CH selection algorithms. The suggested SWARAM improves packet delivery ratio and network lifetime by 10% and 10%, respectively. Consequently, the overall performance of the network is improved.

An Energy Efficient Cluster Head Selection in WSN Based on Enhanced Chicken Swarm Optimization

Clustering of data are ab effective energy saving method for wireless sensor networks (WSN). However, they incur additional costs in data collections from sensor nodes and sending them to base station (BS) after aggregations. Cluster heads (CHs) in hierarchical cluster-based WSNs use more energy. Therefore, choosing a suitable CHs is essential to conserve energy for sensor nodes and prolong the life of the WSN. Provide energy-saving cluster head selection techniques in this work. where enhanced fuzzy means clustering is used to perform the first cluster construction. Enhanced Chick Swarm optimization (ECSO) selects CHs which is evaluated strictly for varying WSN scenarios and counts of CHs and nodes for values of remaining energies of sensor nodes, sink distances, and distances within clusters. To demonstrate that the proposed technique is superior, the results are compared with those of several other currently used algorithms.

Energy Efficient Cluster Head Selection and Routing Algorithm using Hybrid Firefly Glow-Worm Swarm Optimization in WSN

Energy Efficient Cluster Head Selection and Routing Algorithm using Hybrid Firefly Glow-Worm Swarm Optimization in WSN

Optimization of Energy-Efficient Cluster Head Selection Algorithm for Internet of Things in Wireless Sensor Networks

The Internet of Things (IoT) now uses the Wireless Sensor Network (WSN) as a platform to sense and communicate data. The increase in the number of embedded and interconnected devices on the Internet has resulted in a need for software solutions to manage them proficiently in an elegant and scalable manner. Also, these devices can generate massive amounts of data, resulting in a classic Big Data problem that must be stored and processed. Large volumes of information have to be produced by using IoT applications, thus raising two major issues in big data analytics. To ensure an efficient form of mining of both spatial and temporal data, a sensed sample has to be collected. So for this work, a new strategy to remove redundancy has been proposed. This classifies all forms of collected data to be either relevant or irrelevant in choosing suitable information even before they are forwarded to the base station or the cluster head. A Low-Energy Adaptive Clustering Hierarchy (LEACH) is a cluster-based routing protocol that uses cluster formation. The LEACH chooses one head from the network sensor nodes, such as the Cluster Head (CH), to rotate the role to a new distributed energy load. The CHs were chosen randomly with the possibility of all CHs being concentrated in one locality. The primary idea behind such dynamic clustering was them resulted in more overheads due to changes in the CH and advertisements. Therefore, the LEACH was not suitable for large networks. Here, Particle Swarm Optimization (PSO) and River Formation Dynamics are used to optimize the CH selection (RFD). The results proved that the proposed method to have performed better compared to other methods.

Improving Smart Irrigation Systems through Energy Efficient Cluster-Head Selection in Heterogeneous WSNs

Introduction— Smart irrigation systems require reliable and energy-efficient communication between the sensors in a Wireless Sensor Network (WSN) and the control system. Objective— To address this challenge, this paper presents several cluster-based selection protocols, based on the Stable Election Protocol (SEP) and Distributed Energy-Efficient Clustering (DEEC). Methodology— The presented protocols divide the agriculture field into sub-fields to reduce energy consumption between far sensors and the Base Station (BS). Results— Comparison with traditional protocols using evaluation metrics such as network throughput, stability, instability period, and lifetime, shows that the presented protocols outperform in terms of all metrics. Conclusions— The results indicate the effectiveness of the proposed protocols in prolonging the network’s lifetime and improving energy efficiency in heterogeneous WSNs, thus supporting the performance of smart irrigation systems. Numerically, using the proposed protocols, the network lifetime increased by 23% compared to conventional SEP.

Energy-Efficient Cluster Head Selection in Wireless Sensor Networks Using an Improved Grey Wolf Optimization Algorithm

The internet of things (IoT) and industrial IoT (IIoT) play a major role in today’s world of intelligent networks, and they essentially use a wireless sensor network (WSN) as a perception layer to collect the intended data. This data is processed as information and send to cloud servers through a base station, the challenge here is the consumption of minimum energy for processing and communication. The dynamic formation of cluster heads and energy aware clustering schemes help in improving the lifetime of WSNs. In recent years, grey wolf optimization (GWO) became the most popular feature selection optimizing, swarm intelligent, and robust metaheuristics algorithm that gives competitive results with impressive characteristics. In spite of several studies in the literature to enhance the performance of the GWO algorithm, there is a need for further improvements in terms of feature selection, accuracy, and execution time. In this paper, we have proposed an energy-efficient cluster head selection using an improved version of the GWO (EECHIGWO) algorithm to alleviate the imbalance between exploitation and exploration, lack of population diversity, and premature convergence of the basic GWO algorithm. The primary goal of this paper is to enhance the energy efficiency, average throughput, network stability, and the network lifetime in WSNs with an optimal selection of cluster heads using the EECHIGWO algorithm. It considers sink distance, residual energy, cluster head balancing factor, and average intra-cluster distance as the parameters in selecting the cluster head. The proposed EECHIGWO-based clustering protocol has been tested in terms of the number of dead nodes, energy consumption, number of operating rounds, and the average throughput. The simulation results have confirmed the optimal selection of cluster heads with minimum energy consumption, resolved premature convergence, and enhanced the network lifetime by using minimum energy levels in WSNs. Using the proposed algorithm, there is an improvement in network stability of 169.29%, 19.03%, 253.73%, 307.89%, and 333.51% compared to the SSMOECHS, FGWSTERP, LEACH-PRO, HMGWO, and FIGWO protocols, respectively.

CL‐HPWSR: Cross‐layer‐based energy efficient cluster head selection using hybrid particle swarm wild horse optimizer and stable routing in IoT‐enabled smart farming applications

AbstractIn the recent days, the Internet of Things (IoT) has assumed a significant role in automized farming applications. The farmers can receive frequent information corresponding to the soil moisture, water used, humidity, temperature, moisture, etc., by utilizing actuators and sensor nodes. Various clustering techniques used in wireless sensor network (WSN) applications have achieved energy‐efficient results. However, IoT‐enabled smart farming (SF) applications require scalable networks and long‐distance communication. The existing clustering techniques cannot provide SF solutions, and work related to communication overhead, end‐to‐end delay, latency etc., has not been taken up exhaustively. Therefore, in this article, a cross‐layer‐based hybrid particle Swarm wild horse optimizer (PSWHO) and stable routing technique (CL‐HPWSR) is designed to minimize energy consumption, communication delay, latency etc. in SF applications. Initially, the network is designed to be Bi‐concentric Hexagons. The cross‐layer‐based optimal cluster head (CH) selection mechanism is designed using the hybrid optimization algorithm‐named PSWHO to mitigate excess energy consumption problems in WSN. While clustering, cross‐layer parameters from different layers such as physical, medium access control, and network are used to compute the probability of each sensor node. Moreover, the deep learning‐based routing algorithm extended deep golden eagle neural network (EDGENN) is introduced to explore the optimal route for transmitting the data. The performance of CL‐HPWSR is implemented in Matlab by focusing energy‐efficiency, computational‐efficiency and QoS‐efficiency factors. Finally, in comparison with state‐of‐the‐art‐based SF approaches such as CL‐IoT, FEEC‐IIR, BiHCLR, PSO‐ECHS, and PSO‐C, the CL‐HPWSR has performed better in terms of energy‐efficiency, QoS‐efficiency and computational‐efficiency.

EECHS-ARO: Energy-efficient cluster head selection mechanism for livestock industry using artificial rabbits optimization and wireless sensor networks

<abstract> <p>In the livestock industry, wireless sensor networks (WSNs) play a significant role in monitoring many fauna health statuses and behaviors. Energy preservation in WSNs is considered one of the critical, complicated tasks since the sensors are coupled to constrained resources. Therefore, the clustering approach has proved its efficacy in preserving energy in WSNs. In recent studies, various clustering approaches have been introduced that use optimization techniques to improve the network lifespan by decreasing energy depletion. Yet, they take longer to converge and choose the optimal cluster heads in the network. In addition, the energy is exhausted quickly in the network. This paper introduces a novel optimization technique, i.e., an artificial rabbits optimization algorithm-based energy efficient cluster formation (EECHS-ARO) approach in a WSN, to extend the network lifetime by minimizing the energy consumption rate. The EECHS-ARO technique balances the search process in terms of enriched exploration and exploitation while selecting the optimal cluster heads. The experimentation was carried out on a MATLAB 2021a platform with varying sensor nodes. The obtained results of EECHS-ARO are contrasted with other existing approaches via teaching–learning based optimization algorithm (TLBO), ant lion optimizer (ALO) and quasi oppositional butterfly optimization algorithm (QOBOA). The proposed EECHS-ARO enriches the network lifespan by ~15% and improves the packet delivery ratio by ~5%.</p> </abstract>

AEECA for Reliable Communication to Enhance the Network Life Time for WSN

Nowadays, wireless sensor networks play a vital role in our day to day life. Wireless communication is preferred for many sensing applications due its convenience, flexibility and effectiveness. The sensors to sense the environmental factor are versatile and send sensed data to central station wirelessly. The cluster based protocols are provided an optimal solution for enhancing the lifetime of the sensor networks. In this paper, modified K-means ++ algorithm is used to form the cluster and cluster head in an efficient way and the Advanced Energy-Efficient Cluster head selection Algorithm (AEECA) is used to calculate the weighted factor of the transmission path and effective data collection using gateway node. The experimental results show the proposed algorithm outperforms the existing routing algorithms.

Enhanced Elman spike neural network for cluster head based energy aware routing in WSN

AbstractAn enhanced Elman spike neural network (EESNN) optimized with hybrid wild horse optimization and chameleon swarm algorithm is proposed in this manuscript for multi‐objective cluster head selection and energy aware routing in wireless sensor network (CH‐EESNN‐Hyb‐WH‐CSOA‐WSN). Initially, EESNN is used to intelligent selection of cluster head. Then, the optimal cluster head utilized the selected data transferring process with the consideration of multi‐objective fitness function based EESNN. Here, some of the multi‐objective fitness function factors are considered, like energy, delay, throughput, distance between the nodes, traffic rate and cluster density. The hybrid wild horse optimization and chameleon swarm algorithm (Hyb‐WH‐CSOA) is taken into account for the optimal route path selection with minimal delay. The proposed CH‐EESNN‐Hyb‐WH‐CSOA‐WSN method is activated in network simulator 3 (NS‐3) tool. The performance of the proposed method is examined under certain performance metrics, like count of alive nodes, drop, network lifetime, delay, throughput, energy consumption, and packet delivery ratio. Finally, the proposed method attains 98.78%, 97.21%, 99.61% lower delay, 98.78%, 99.21%, 96.78% higher delivery ratio, and 99.57%, 98.67%, 98.88% lower packet drop compared with the existing methods, like optimal secure cluster head placement through source coding techniques in wireless sensor networks (CHP‐HMC‐WSN), optimal placement of single cluster head in wireless sensor networks via clustering (CHP‐K‐Means C‐PSO‐WSN) and hybrid firefly approach along particle swarm optimization for energy efficient optimum cluster head selection in wireless sensor networks (CHP‐HFAPSO‐WSN) respectively.

Applying Quantum Search Algorithm to Select Energy-Efficient Cluster Heads in Wireless Sensor Networks

Clustering is an effective topology control approach that evenly distributes loads across sensor nodes, enhances network scalability, and increases the lifetime in wireless sensor networks. In this paper, we propose a novel energy-efficient weighted cluster head (CH) selection approach that improves the overall performance of the network and increases energy efficiency. An optimization strategy is proposed that emphasizes adjusting the transmission range with the appropriate node density, which increases energy efficiency for intra- and inter-cluster communications to 86% and 97%, respectively. In addition, the implementation of a quantum search algorithm for choosing the CH is explained. Compared to the classical method such as EECS and HEED, the proposed quantum search algorithm has a quadratic speed-up advantage. The classical search algorithm requires N steps to find a specific element in an array of N elements, but instead of using a classical algorithm, Grover’s quantum search algorithm minimizes the complexity to O (N). In this work, an energy-efficient cluster head selection approach is illustrated through a classical weighted clustering algorithm, and its implementation is also extended through a quantum weighted search algorithm which is demonstrated by the simulation results.

Energy Efficient Routing and Dynamic Cluster Head Selection Using Enhanced Optimization Algorithms for Wireless Sensor Networks

A large number of spatially dispersed nodes on the wireless network create Wireless Sensor Networks (WSNs) to collect and analyze the physical data from the environment. The issues that affected the network and had an impact on network energy consumption were cluster head random selection, working node redundancy, and cluster head transmission path construction. Consequently, this energy constraint also has an impact on the network lifetime and energy-efficient routing. Therefore, the primary goals of this research are to decrease energy consumption and lengthen the network’s lifespan. So, using improved optimization algorithms, this paper presents a dynamic cluster head-based energy-efficient routing system. The Improved Coyote Optimization Algorithm (ICOA), in this case, consists of three phases setup, transmission, and measurement phase. The Improved Jaya Optimization Algorithm with Levy Flight (IJO-LF) then determines the route between the BS and the CH. It selects the most effective course based on the distance, node degree, and remaining energy. The proposed approach is compared with traditional methods and the routing protocols Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and Threshold sensitive Energy Efficient Sensor Network protocol (TEEN) during implementation on the MATLAB platform. Performance indicators for the suggested methodology are evaluated based on data packets collected by the BS, energy usage, alive nodes, and dead nodes. The outputs of the suggested methodology performed better than the conventional plans.

IMPERIALIST COMPETITIVE ALGORITHM FOR INCREASING THE LIFETIME OF WIRELESS SENSOR NETWORK

Recent years have seen the rapid growth in the applications of wireless sensor network (WSN) which is due to the advances of sensor nodes with low cost and tiny size. Despite the various potential applications of WSN, one of the key tasks in sensor network design is to make sure that the network is functional as long as possible. This paper presents an energy-efficient cluster head selection algorithm for the clustering of heterogeneous WSN, inspired by Imperialist Competitive Algorithm (ICA). In order to reduce the network energy consumption and subsequently increases the sensor network lifetime, the clustering problem is transformed into an optimization problem and the specific cost function is used to select the cluster heads in a way that the energy utilization of the network is optimized. Extensive simulation works are done based on MATLAB to test the algorithm in various network scenarios, with different network sizes and number of nodes. Simulation results have shown that the proposed algorithm is able to extend the network lifetime compared to its comparative by up to 154 percent in terms of first node death. Furthermore, choosing the optimum set of cluster heads at every round has proved that our proposed algorithm not only could reduce the network energy consumption, but also improves the total data delivery at the base station up to 59 percent compared to the well-known algorithm.