Cluster Head Selection Algorithm Research Articles

Chronological wild geese optimization algorithm for cluster head selection and routing in wireless sensor network

Chronological wild geese optimization algorithm for cluster head selection and routing in wireless sensor network

Optimizing cluster head selection for energy efficiency in wireless sensor networks: A hybrid algorithm combining grey wolf and enhanced sunflower optimization

AbstractIn this letter, we introduce a novel cluster head selection algorithm namely mixed grey wolf and improved sunflower optimization algorithm (MGWISFO). This algorithm leverages both energy requirements and inter‐node distances to select cluster heads (CH). Within this algorithm, the Grey Wolf Optimizer facilitates exploration, offering a broader search, while the improved Sunflower Optimization focuses on exploitation, delivering a narrower search. This balance between exploration and exploitation leads to the identification of the optimal CH node, thereby enhancing network performance. To validate its effectiveness, the proposed algorithm is benchmarked against existing strategies such as particle swarm optimization (PSO), genetic algorithm (GA), grey wolf optimization (GWO), and sunflower optimization (SFO) across various performance parameters including throughput, the number of live and dead nodes, and residual energy. Simulation results unequivocally establish the unparalleled performance of our proposed algorithm, surpassing the capabilities of existing algorithms.

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

Two-Level Clustering Algorithm for Cluster Head Selection in Randomly Deployed Wireless Sensor Networks

Two-Level Clustering Algorithm for Cluster Head Selection in Randomly Deployed Wireless Sensor Networks

IoT based sensor network clustering for intelligent transportation system using meta‐heuristic algorithm

SummaryInternet of Things (IoT) based sensor networks have been established as a pillar in intelligent communication systems for efficiently handling roadside congestion and accidents. These IoT networks sense, collect, and process data on a real‐time basis. However, IoT based sensor network clustering has various energy constraints such as inefficient routing due to long‐haul transmission, hot spot problem, network overhead, and unstable network whenever deployed along with the roadside that affect their architecture. In such networks, clustering techniques play a crucial role in extending the lifespan and optimizing the routes by integrating sensor devices through clusters. Therefore, a meta‐heuristic algorithm for clustering in IoT sensor networks for an intelligent transportation system is proposed. In this work, the seagull optimization algorithm is applied for clustering by considering residual and average energy, node spacing, and distance fitness parameters. Moreover, this work also considers the dynamic communication range of the cluster heads for increasing the stability period and lifetime of the proposed networks. The experiment results demonstrate that the proposed Seagull optimization algorithm for clustering in IoT networks (SOAC‐IoTNs) and Seagull optimization algorithm for clustering in IoT networks with dynamic communication range (SOAC‐IoTNs‐DR) achieve a significant increase in the stability period and network lifetime, with percentage increments of 55.68% and 71.47%, and 10.03% and 88.66% respectively, compared to the existing optimized genetic algorithm for cluster head selection with single static sink (OptiGACHS‐StSS).

Deep-Reinforcement-Learning-Based Joint Energy Replenishment and Data Collection Scheme for WRSN.

With the emergence of wireless rechargeable sensor networks (WRSNs), the possibility of wirelessly recharging nodes using mobile charging vehicles (MCVs) has become a reality. However, existing approaches overlook the effective integration of node energy replenishment and mobile data collection processes. In this paper, we propose a joint energy replenishment and data collection scheme (D-JERDG) for WRSNs based on deep reinforcement learning. By capitalizing on the high mobility of unmanned aerial vehicles (UAVs), D-JERDG enables continuous visits to the cluster head nodes in each cluster, facilitating data collection and range-based charging. First, D-JERDG utilizes the K-means algorithm to partition the network into multiple clusters, and a cluster head selection algorithm is proposed based on an improved dynamic routing protocol, which elects cluster head nodes based on the remaining energy and geographical location of the cluster member nodes. Afterward, the simulated annealing (SA) algorithm determines the shortest flight path. Subsequently, the DRL model multiobjective deep deterministic policy gradient (MODDPG) is employed to control and optimize the UAV instantaneous heading and speed, effectively planning UAV hover points. By redesigning the reward function, joint optimization of multiple objectives such as node death rate, UAV throughput, and average flight energy consumption is achieved. Extensive simulation results show that the proposed D-JERDG achieves joint optimization of multiple objectives and exhibits significant advantages over the baseline in terms of throughput, time utilization, and charging cost, among other indicators.

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.

An Energy-Aware Cluster Head Selection and Optimal Route Selection Algorithm for Maximizing Network Lifetime in MANETs

An Energy-Aware Cluster Head Selection and Optimal Route Selection Algorithm for Maximizing Network Lifetime in MANETs

Lifespan Enhancement of WSN for IoT - Modified Fuzzy Grey Wolf Optimizer (MFGWO) Approach

Wireless Sensor Networks (WSNs) are gaining prominence for diverse applications, including environmental monitoring and industrial automation. Yet, their energy constraint poses a significant challenge. Clustering, a prevalent technique, optimizes energy utilization by grouping nodes into clusters and appointing a cluster head (CH) to aggregate data and communicate with the base station (BS). This paper presents a novel clustering and CH selection algorithm for a energy varied WSNs, leveraging modified fuzzy c-means (FCM) clustering and Grey Wolf Optimization (GWO). Modified FCM partitions nodes based on their similarity, while GWO identifies CHs in each cluster, considering energy levels, centrality, distance from the BS, and dynamic node distribution. Simulation results demonstrate the superior energy efficiency and network lifetime of our proposed approach compared to existing algorithms. Key Word: Wireless Sensor Networks, Modified Fuzzy C Means algorithm (MFCM), Grey Wolf Optimizer (GWO)

HOEEACR: Hybrid Optimized Energy-Efficient Adaptive Clustered Routing for WSN

Wireless Sensor Networks have been used for sensing and gathering data about an environment from a remote location for many years in a variety of engineering applications. In WSN, nodes must overcome energy consumption to function efficiently. To resolve these issues and extend the usefulness of the network, clustering and routing algorithms are promising. One of the main issues with WSNs is that they lack restricted energy sources. To overcome this issue, a Hybrid Optimized Energy-Efficient Adaptive Clustered Routing approach (HOEEACR) has been proposed for WSNs. This paper presents the Genetic Bee Colony (GBC) Algorithm for Cluster Head Selection by considering distances to neighbors, residual energy, node degrees, and node centralities. Furthermore, an optimal routing path for the cluster heads is found by utilizing the Aquila with African Vulture Optimization (AAVO) algorithm. The AAVO optimizes network performance using residual energy, node degree, and distance. The proposed HOEEACR method has been extensively tested to ensure network lifetime and energy efficiency. According to experimental results, the proposed HOEEACR method consistently outperforms existing techniques on a variety of performance metrics.

Energy Efficient Spiking Deep Residual Network and Binary Horse Herd Optimization Espoused clustering Protocol for Wireless Sensor Networks

Nowadays, Wireless Sensor Networks (WSNs) plays several important application fields, specially monitoring events without any human interference. The sensor nodes (SNs) have lesser life time in wireless sensor network owing to its continual sensing with battery drains very rapidly. As a result of the heavy traffic, sensors nearby quickly expire and energy hole issues start to appear. To overcome these issues, an Energy Efficient Spiking Deep Residual Network and Binary Horse Herd Optimization Espoused Clustering Protocol for Wireless Sensor Networks (EE-SDRN-BHHO-CP-WSN) is proposed in this manuscript for sustaining the energy efficiency in the wireless sensor network. One of the main issues in wireless sensor network assisted applications is making use of the available energy. An optimum path selection is a key process of saving energy from sensor nodes to the sink. Spiking Deep Residual Network (SDRN) and Binary Horse Herd Optimization (BHHO) optimize energy efficiency in WSN. The cluster head (CH) is designated by effectual fitness function generated by multi-objectives. It benefits in low power consuming and decreases a count of idle sensor nodes. After CH selection, Binary horse herd optimization algorithm is considered for optimal route selection and data transmission by sink node. The EE-SDRN-BHHO-CP-WSN method is implemented in MATLAB and the efficiency of the proposed method is analyzed with different metrics, like network lifetime, number of alive nodes, number of dead nodes, throughput, energy consumption, packet delivery ratio (PDR). The proposed EE-SDRN-BHHO-CP-WSN method attains 32.35 %, 42.34 %, 49.27 % higher network lifetime, 26.34 %, 31.94 % and 39.35 % higher number of alive nodes and 46.26 %, 38.64 % and 27.83 % lower number of dead nodes compared with other existing models, such as Multi-objective CH based Energy-aware Optimized Routing Algorithm in WSN (MCH-EOR-WSN), Energy efficient CH selection utilizing improved Sparrow Search Algorithm in WSN (EECH-ISSA-WSN), and New Energy Aware CH Selection Algorithm for WSN (NEA-CHSA-WSN respectively).

Mathematical Modeling and Analysis of Energy Aware Probabilistic Distribution Based Cluster Head Selection Algorithm for Wireless Sensor Networks

From a mathematical perspective, Wireless Sensor Networks (WSNs) are increasingly recognized for their utility across multiple sectors such as environmental oversight, healthcare monitoring, and process automation within industries. A paramount obstacle within WSNs is the management of energy efficiency, given that the sensor nodes are typically powered by batteries with finite energy reserves. The criticality of developing efficient routing protocols cannot be overstated, as they are instrumental in extending the operational lifespan of the network and guaranteeing dependable data communication. This study is centered around the mathematical modelling and performance evaluation of an innovative routing methodology that integrates machine learning algorithms to augment energy efficiency within WSNs. The novel routing strategy dynamically adjusts its operations in response to the immediate environmental and network states, aiming to minimize energy expenditure and elevate the network's overall efficiency. Through comprehensive numerical simulations, this research scrutinizes the efficacy of the machine learning-enhanced routing protocol against conventional routing methodologies, accentuating its advantages in energy savings and reliability in data transmission. The simulation framework encompasses a variety of network configurations, traffic distributions, and environmental contexts, employing metrics such as energy utilization, network longevity, packet delivery ratio, and latency to offer an in-depth examination of the machine learning-based routing approach's performance. Findings from the simulations affirm the algorithm's enhanced energy efficiency, which contributes to prolonged operation of sensor nodes and steadfast data communication across dynamically changing network landscapes. The implications of this study highlight the transformative potential of machine learning in redefining routing protocol design and optimization within energy-restricted WSNs. By elevating both energy efficiency and network functionality, this research marks a significant stride towards realizing sustainable and dependable WSNs, paving the way for their broader application in essential services.

Retracted: A Weighted Cluster Head Selection Algorithm for Energy Efficient Wireless Sensor Networks

Retracted: A Weighted Cluster Head Selection Algorithm for Energy Efficient Wireless Sensor Networks

Mathematical Modeling and Statistical Analysis of Leach Algorithm Based Cluster Head Selection Approach for Wireless Sensor Networks

In this paper, we present a comprehensive design and analysis of our proposed improved fuzzy logic-based algorithm. The algorithm utilizes a fuzzy logic system to assess node attributes such as residual energy, distance to the base station, and connectivity. By considering these parameters, the algorithm dynamically evaluates the most suitable candidates for cluster head roles, effectively distributing the energy load and promoting equitable cluster formation. An extensive performance evaluation of proposed algorithm has been conducted through simulations and comparisons with the original LEACH protocol. Our results reveal that the improved fuzzy logic-based algorithm outperforms the conventional LEACH in terms of network lifetime, energy consumption, and overall network stability. In this study, we delve into the mathematical modeling and statistical analysis of the proposed algorithm, focusing on its impact on energy efficiency, network stability, and data routing in WSNs. The Improved Fuzzy Logic-Based Cluster Head Selection Algorithm employs fuzzy logic to intelligently select cluster heads, considering parameters like residual energy, distance to the base station, and historical data. We develop mathematical models to describe the algorithm's behavior and analyze its performance through extensive simulations and statistical evaluations. The algorithm demonstrates enhanced adaptability to varying network conditions and node heterogeneity, showcasing its potential to significantly extend the operational duration of WSNs in diverse deployment scenarios. In conclusion, this paper contributes a novel perspective to the domain of WSNs by introducing an advanced fuzzy logic-based cluster head selection algorithm. The algorithm enhances the foundation of the LEACH protocol, effectively addressing energy optimization concerns and promoting prolonged network lifetime. The presented design and analysis substantiate the algorithm's superiority, offering valuable insights for researchers and practitioners working on energy-efficient routing protocols and wireless sensor network management.

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.

Accelerated Particle Swarm Optimization Algorithm for Efficient Cluster Head Selection in WSN

Accelerated Particle Swarm Optimization Algorithm for Efficient Cluster Head Selection in WSN

Routing in Mobile ad Hoc Networks Using Machine Learning Techniques

The significance of Mobile Ad Hoc Networks (MANETs) has increased in the current period due to the proliferation of mobile devices and the emergence of Internet of Things (IoT) applications. The function of routing in decentralized wireless networks is of paramount importance in facilitating efficient data transfer. Conventional routing techniques need help in effectively adjusting to the dynamic changes in network topology and the constraints imposed by restricted network resources. To tackle these concerns, a Machine Learning-Based Optimized Routing Algorithm (ML-ORA) is proposed in this research. ML-ORA has been developed to offer adaptable and intelligent routing solutions, especially in MANET. This is achieved via the integration of parameter settings, the use of a Hybrid Particle Swarm Optimization (HPSO) algorithm for Cluster Head (CH) selection, the inclusion of a clustering stage, and the incorporation of a k-Nearest Neighbors (k-NN)-based intrusion detection system. The performance of ML-ORA is assessed by conducting simulations using Network Simulator 3 (NS-3), demonstrating its efficacy in dynamic network settings. The findings exhibit a latency of 15 milliseconds, a packet delivery ratio of 95%, a network throughput of 4Mbps, and an energy efficiency of 85%. ML-ORA presents a potentially advantageous resolution for tackling the obstacles encountered in MANET routing, thereby creating opportunities for enhanced efficacy and security in the transmission of data inside dynamic wireless networks.

DFPC: Dynamic Fuzzy-based Primary User Aware clustering for Cognitive Radio Wireless Sensor Networks

Clustering-based routing solutions have proven to be efficient for wireless networks such as Wireless Sensor Networks (WSNs), Vehicular Ad Hoc Networks (VANETs), etc. Cognitive Radio WSN (CR-WSN) is a class of WSNs that consists of several resource-constrained Secondary Users (SUs), sink, and Primary Users (PUs). Compared to WSNs, there are several challenges in designing the clustering technique for CR-WSNs. As a result, one cannot directly apply the WSN clustering protocols to CR-WSNs. Developing a clustering protocol for CR-WSNs must address challenges such as ensuring PU protection, and SU connectivity, selecting the optimal Cluster Head (CH), and discovering the optimal cluster size. Present CR-WSN clustering solutions failed to resolve the trade-off among all essential clustering objectives. To address these challenges, this study presents a novel approach called Dynamic Fuzzy-based PU aware Clustering (DFPC) for CR-WSNs. DFPC uses a dynamic approach to discover the number of clusters, a fuzzy-based algorithm for optimal CH selection, and reliable multi-hop data transmission to ensure PU protection. To enhance the performance of CR-WSNs, an effective strategy was designed to define the optimal number of clusters using the network radius and live node. Fuzzy logic rules were formulated to assess the four CR-specific parameters for optimal CH selection. Finally, reliable intra- and intercluster data transmission routes are discovered to protect the PUs from malicious activities. The simulation results showed that the DFPC protocol achieved an improved average throughput of 48.04 and 46.49, a PDR of 93.36 and 84.37, and a reduced delay of 0.0271 and 0.0276 in static and dynamic topologies, respectively, which were better than those of ABCC, ATEEN, and LEACH protocols.

Virtual Reality Opera Space: Energy-Efficient Clustering Protocol Based on Cluster Centers for Wireless Sensor Networks

Energy efficiency presents a notable challenge in wireless sensor networks (WSNs) as the sensor nodes, which are responsible for collecting and transmitting data, operate under limited energy capacity. The sensor nodes must generate as much power as possible to make the network last longer. Generally, every sensor node in a WSN has batteries with limited capacities. It can be challenging to replace this little battery at times due to its vast number and numerous environmental issues. Therefore, it is believed that energy-efficient communication is essential for prolonging the lifespan of a sensor node. This work suggests a brand-new routing protocol clustering method that is energy efficient. Initially, the bamboo growth optimizer novel metaheuristic method was built on differential equations of bamboo growth and the Gaussian mixture model (BFGO). Secondly, a Cluster Centered Cluster Head Selection Algorithm (C3HA) of a routing protocol (BFGO-C3HA) is presented, with the encoding method and fitness function being revised. This algorithm is based on the BFGO technique. It can reduce transmission distance and increase energy efficiency. The results of simulations show that applying BFGO-C3HA can efficiently lessen the sensor network's energy consumption while increasing the amount of information transmitted to extend the network's lifetime.

Kinetic Gas Molecule Optimization based Cluster Head Selection Algorithm for minimizing the Energy Consumption in WSN

As the amount of low-cost and low-power sensor nodes increases, so does the size of a wireless sensor network (WSN). Using self-organization, the sensor nodes all connect to one another to form a wireless network. Sensor gadgets are thought to be extremely difficult to recharge in unfavourable conditions. Moreover, network longevity, coverage area, scheduling, and data aggregation are the major issues of WSNs. Furthermore, the ability to extend the life of the network, as well as the dependability and scalability of sensor nodes' data transmissions, demonstrate the success of data aggregation. As a result, clustering methods are thought to be ideal for making the most efficient use of resources while also requiring less energy. All sensor nodes in a cluster communicate with each other via a cluster head (CH) node. Any clustering algorithm's primary responsibility in these situations is to select the ideal CH for solving the variety of limitations, such as minimising energy consumption and delay. Kinetic Gas Molecule Optimization (KGMO) is used in this paper to create a new model for selecting CH to improve network lifetime and energy. Gas molecule agents move through a search space in pursuit of an optimal solution while considering characteristics like energy, distance, and delay as objective functions. On average, the KGMO algorithm results in a 20% increase in network life expectancy and a 19.84% increase in energy stability compared to the traditional technique Bacterial Foraging Optimization Algorithm (BFO).