Cluster Head Selection Research Articles

An intelligent clustering scheme based on whale optimization algorithm in flying ad hoc networks

Due to the progress of unmanned aerial vehicles (UAVs), this new technology is widely applied in military and civilian areas. Multi-UAV networks are often known as flying ad hoc networks (FANETs). Due to these applications, FANET must ensure communication stability and have high scalability. These goals are achieved by presenting clustering techniques in FANETs. However, the characteristics of these networks, like high-mobility nodes, limited energy, and dynamic topology, have created great challenges in two important processes of clustering protocols, namely cluster construction and the selection of cluster heads. In this paper, an intelligent clustering scheme based on the whale optimization algorithm called ICW is suggested in flying ad hoc networks. Firstly, each UAV specifies its hello interval based on the lifespan of adjacent links to guarantee the adaptability of ICW to FANET. Then, a centralized clustering process is done using a whale optimization algorithm (WOA) to find the best cluster centers on the network. To determine the membership of each UAV in a cluster, ICW employs a new criterion, i.e. closeness ratio, so that each UAV joins a cluster with the best closeness ratio. In addition, the evaluation of each whale is carried out based on a fitness function, consisting of three components, namely the number of isolated clusters, the ratio of inter-cluster distance to intra-cluster distance, and cluster size. Then, a cluster head is selected for each cluster based on a score value. This score is dependent on the weighted sum of four metrics, namely remaining energy, the average link lifespan between each UAV and its neighbors, neighbor degree, and the average distance between each UAV and its neighbors. In the last step, two routing processes, namely intra-cluster routing and inter-cluster routing, are introduced in FANET. Then, the evaluation and implementation of ICW is performed through the NS2 simulator. After completing the simulation process, ICW is compared to MWCRSF, DCM, and GWO, and the evaluation results are presented in two scenarios, namely network evaluation in the clustering process and network evaluation in the routing process. Accordingly, in the first scenario, ICW has low clustering time and a high cluster lifetime. In the second scenario, ICW optimizes energy consumption, network longevity, packet delivery rate, routing overhead, and delay compared to other approaches. However, throughput in ICW is about 3.9% lower than that in MWCRSF.

Combined localization and clustering approach for reduced energy presumption in heterogeneous IoT

The field of H-IoT is emerging with enormous potential to empower various technologies. Smart cities and advanced manufacturing are a few of the fields where H-IoT is currently used. The issue with H-IoT is its heavy energy consumption while transmitting data, which makes scaling difficult. To overcome such issues, a hybrid approach of Crayfish Optimization (CFO) with FCM and Restricted Boltzmann Machine (RBM) with Soft Sign Activation (SSA) has been proposed. Initially, Node initialization lays the foundation by configuring individual sensor nodes for network participation. After initialization, Fuzzy C Means clustering optimizes data aggregation by categorizing nodes into clusters based on similarity. Gathering Neighbor Node Traffic Data (NNTD) provides insights into communication patterns. Based on the threshold of NNTD, node localization is performed that enhances network accuracy by pinpointing sensor node locations. Integration of CFO into clustering, along with localization further improves cluster head selection for optimal data routing. Classification through the RBM with SSA function enhances anomaly detection, combining data analysis for optimizing energy utilization in heterogeneous IoT environments. The ‘combined CFO-FCM and SSA-RBM’ has been implemented in MATLAB and achieved an accuracy of 94.50%. As a result, the overall performance of the system is improved.

Energy‐efficient clustering algorithm using distributed fuzzy‐logic to prolong the survivability of wireless sensor networks

AbstractEnergy efficiency is critical for prolonging the survivability of wireless sensor networks (WSNs), and clustering algorithms play a significant role in achieving this goal. An application‐specific wireless sensor network requires adapted methods and techniques to meet its requirements. A vast amount of research has been done on optimizing energy consumption and enhancing network lifetime of sensor nodes. To increase the lifetime of WSNs, we present and evaluate an energy‐efficient clustering algorithm based on distributed fuzzy logic (EECADFL). High reliability, low error rates during clustering, and its ability to perform well in large‐scale networks with many nodes are some of the main benefits of this method. In wireless sensor networks, simulation results showed that the scheme provided better lifetime performance while limiting dead nodes and improving cluster head selection.

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).

An innovative approach for cluster head selection and Energy Optimization in wireless sensor networks using Zebra Fish and Sea Horse Optimization techniques

In recent times, Wireless Sensor Networks (WSNs) have become an indispensable technology across various industries, offering diverse applications and services. Among the crucial performance metrics for WSNs, optimal cluster head (CH) selection and energy efficiency are paramount for cost-effective network operations. This paper proposes a novel approach for WSNs that tackles both challenges using Zebra Fish Optimization (ZFO) and Sea Horse Optimization (SHO) algorithms. The proposed approach focuses on dynamic cluster formation and CH selection. The ZFO algorithm, enhanced with a new multi-level threading technique, dynamically selects the most suitable CH based on a fitness function. Subsequently, the SHO algorithm, equipped with an innovative adaptive parameter tuning mechanism, optimizes energy consumption within the network. This two-phased approach ensures balanced performance. Performance evaluation is validated using key metrics like packet delivery ratio (PDR), throughput, network lifetime, and residual energy. Experimental results and statistical analysis demonstrate that the proposed hybrid scheme outperforms existing popular algorithms in all these metrics. The improvements range from 1.8 % to 6.9 % for PDR, 6.7 % to 24 % for throughput, 1.86 % to 7.40 % for network lifetime, and 9.65 % to 37.95 % for residual energy. These advancements are attributed to the innovative modifications introduced in both ZFO and SHO algorithms, ultimately contributing to the enhanced performance of the entire system.

Enhancing wireless sensor network security with optimized cluster head selection and hybrid public-key encryption

This paper introduces an integrated methodology that enhances both the efficiency and security of wireless sensor networks (WSNs) against various active attacks. A two-fold strategy is proposed that incorporates an advanced cluster head (CH) selection and a customized, lightweight encryption protocol. The CH selection process is optimized through a multi-phase approach using fuzzy logic, local and global network qualifiers, and a trust index to ensure the election of CHs that are not only energy-efficient but also reliable. To complement the robust CH selection, the study introduces a hybrid yet lightweight encryption scheme customized Rivest-Shamir-Adleman (c-RSA) and customized advanced encryption standard (c-AES) algorithms. This scheme is customized for WSNs with limited computational resources, maintaining strong encryption standards while significantly reducing energy consumption and computational overhead. Experimental results demonstrate that the proposed system substantially enhances network performance, exhibiting a 34.15% improvement in energy efficiency and a 30.95% increase in reliability over existing methods such as LEACH and its modified versions. This comprehensive approach underscores the potential for a synergistic design in WSNs that does not compromise on security while optimizing operational efficiency.

OPTIMIZING NETWORK LIFETIME IN WIRELESS SENSOR NETWORKS FOR EFFICIENT CLUSTER HEAD SECTION

Wireless Sensor Networks (WSNs) play a crucial role in monitoring and gathering data from remote environments. Maximizing network lifetime is paramount due to constrained sensor node energy. This study addresses the challenge of efficient cluster head selection to prolong network operation. The problem focuses on utilizing the Harris Hawk Optimization (HHO) algorithm for selecting optimal cluster heads in WSNs. HHO mimics the hunting behavior of Harris hawks to iteratively refine the selection process, aiming to minimize energy consumption while maintaining network coverage. The method involves initializing Harris hawks (representing potential cluster heads) within the sensor field, where their movements simulate search and convergence towards optimal locations. Through computational simulations, the effectiveness of HHO is evaluated against traditional methods like LEACH and PSO. Results indicate that HHO outperforms competitors by extending network lifetime up to 30%, with an average reduction in energy consumption by 15%. Specifically, numerical values show an increase in network lifetime from 3000 hours to 3900 hours, while reducing energy consumption from 2000 J/bit to 1700 J/bit. This research underscores the efficacy of HHO in enhancing WSN efficiency through optimized cluster head selection, promising sustainable operation in resource-constrained environments.

Energy efficient clustering and sink mobility protocol using Improved Dingo and Boosted Beluga Whale Optimization Algorithm for extending network lifetime in WSNs

In Wireless Sensor Networks (WSNs), the potential design challenge of energy efficiency is determined to be handled through the strategies of clustering and routing. The approaches of clustering and routing in WSNs pertain to the problems of Non-deterministic Polynomial (NP)-hard optimization. In this context, swarm intelligence-based algorithms are identified to be suitable and ideal for determining near-optimal and optimal solutions in the search space. On the other hand, APTEEN routing protocol possesses the issues that are related to unnecessary energy drain, ineffective overall network coverage and premature death of certain nodes. To address these issues, an attempt to optimize the APTEEN routing protocol using Dingo Optimization Algorithm (DOA) and Beluga Whale Optimization Algorithm (BWOA) is made in this proposed clustering protocol. With this motivation, Improved Dingo and Boosted Beluga Whale Optimization Algorithm (IDBBWOA) is proposed for determining the optimal cluster head and perform energy-efficient routing to minimized the energy consumption and maximize the lifetime of the network. It specifically used Improved Dingo Optimization Algorithm (IDOA) for attaining cluster head (CH) selection and energy efficient routing through the adoption fitness parameters of Residual Energy, Distance within and between Clusters, Network coverage, Node Degree for maximizing the rate of reliable data dissemination. It also incorporated Boosted Beluga Whale Optimization Algorithm (BBWOA) for determining the optimal points over the sink node can be moved to prevent multi-hop between CHs and the sink nodes, since it is essential for addressing the issue of hot-spot and extends the network lifetime. The simulation results of the proposed IDBBWOA approach revealed its efficacy in improving the mean throughput by 18.92 %, sustaining alive nodes by 34.28 %, and maintaining residual energy by 29.34 %, compared to the benchmarked approaches used for evaluation.

Hybrid grasshopper and Harris hawk optimization algorithm‐based energy efficient routing protocol for extending network lifetime in wireless sensor networks

SummaryIn wireless sensor networks (WSNs), routing based on cluster construction is highly preferred as it greatly supports reliable data communication, load balancing, and fault tolerance with extended network lifetime. In specific, metaheuristic approach‐based dynamic cluster heads (CHs) selection has the possibility of enhancing the lifespan of network and at the same time is capable in reducing the energy consumption. In this paper, hybrid grasshopper and Harris hawk optimization algorithm‐based energy efficient routing protocol (HGHHOA) is propounded for optimal CH selection. This proposed HGHHOA approach adopted a fitness function that incorporated the factors of residual energy, distance between CH and cluster members, distance between selected CHs and the sink, node centrality, and node degree into account. The fitness function values of optimality facilitate a potential CH selection with significant cost‐effective routing. It is proposed with primary objective of improving the network lifespan through optimized selection of CHs that balances the available energy in a predominant way. It is proposed with significance of handling premature convergence with minimized energy consumption and network lifetime through the possibility of establishing an ideal balance between number of alive and dead nodes. The results of this proposed HGHHOA approach with varying rounds of implementation exhibited better results in throughput and residual energy which is 23.98% and 29.21%, better than the bassline CH selection mechanisms.

A Review on Energy and Latency Efficient Routing Protocol Design for Wireless Sensor Networks

Wireless sensor networks (WSNs) have been utilized by various industries, such as disaster management, the chemical and heavy industries, marine research, and space exploration. One of the primary challenges faced by wireless sensor networks is their limited network lifetime. Several techniques have been devised to extend the duration of network operation. This proposed method introduces a threshold-based algorithm to minimize the amount of data that needs to be transferred. In this approach, the selection of cluster heads and their sizes is not fixed. Instead, they are dynamically determined at the beginning of each iteration. The design of routing algorithms for wireless sensor networks faces three main challenges: lowering the rate at which the average node energy declines, minimizing the number of dead nodes, and eventually prolonging the network's lifetime. This paper provides a thorough examination of efficient routing protocols for wireless sensor networks with the goal of improving network longevity. Keywords: Efficient Routing, WSN Clustering, Network Latency, Network Lifetime.

Partitioned uneven cluster routing algorithm based on gray wolf optimization in WSNs

WSNs have various uses across numerous industries and are one of the essential technologies of modern life. Energy consumption is the issue that has drawn the greatest attention and still has to be resolved because the nodes that comprise WSNs have a limited amount of energy. Numerous factors influence energy consumption, and our algorithm design considerations are centered on extending the network lifetime and energy efficiency through the resolution of imbalance and hotspot issues related to WSNs clustering. Because of this, we suggest a partitioned uneven cluster routing algorithm based on gray wolf optimization. To find the ideal cluster head, we first divide the network into areas with distinct important influence factors, then we improve the final cluster head election function and the candidate cluster head competition radius. Subsequently, to reduce the energy consumption resulting from multiple rounds of clustering, similarity determination is introduced. Finally, the optimal transmission path in the multi-hop process is obtained by combining the Gray Wolf optimization algorithm with the relay node selection function. Simulation results show that the network lifetime of the proposed algorithm is extended by 54.6 %, 46.2 %, 58.6 %, and 18.5 % compared to LEACH, DEBUC, LEACH-EDP, and LEACH-IM, respectively. The energy efficiency of the proposed algorithm is extended by 40.8 %, 7.1 %, 22.7 %, and 34.0 %, respectively. The proposed algorithm significantly extends the network lifetime and improves the energy efficiency of the network.

Design and performance assessment of improved evolutionary computing based LEACH protocol for energy efficient and lifetime extension of wireless sensor network

The strengths of a Memetic Algorithm and an enhanced Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol are combined in this research study to propose a revolutionary method for improving the energy efficiency and longevity of Wireless Sensor Networks (WSNs). WSNs are widely used for a variety of applications, including industrial automation, healthcare, and environmental monitoring, where extending network lifetime and energy conservation are crucial. Although successful, conventional clustering algorithms like LEACH feature subpar cluster formation and premature cluster head failures. To get over these restrictions, a memetic algorithm is used to maximize cluster formation and reduce energy usage. This algorithm was influenced by natural evolution and cultural learning processes. The Memetic Algorithm iteratively improves the LEACH protocol in the proposed technique by enhancing dynamic clustering, energy-aware routing, and cluster head selection. These methods work together to increase energy efficiency and lengthen the life of the network. In comparison to conventional LEACH-based WSNs and other cutting-edge algorithms, the paper’s study of the simulation results shows how successful the suggested technique is. In light of network longevity, energy use, and data transmission efficiency, the results obtained demonstrate notable improvements.

Energy-Optimization Route and Cluster Head Selection Using M-PSO and GA in Wireless Sensor Networks

Energy-Optimization Route and Cluster Head Selection Using M-PSO and GA in Wireless Sensor Networks

Energy efficient data dissemination in wireless sensor network enabled IoT using domain‐adaptive message passing graph neural network

SummaryIn the past few years, restricted wireless sensor networks (WSNs) enabled the Internet of Things (IoT) have attracted significant attention and expansion to enhance service delivery and resource efficiency. Dissemination is a service offered by WSN that uses radio transmission and over‐the‐air programming for updating the deployed sensor nodes through online. The centralized data dissemination methods are replaced by the distributed approaches because they affect the drawbacks of a single point of failure, no scalability, and insecurity. Therefore, an Energy Efficient Protocol for Data Dissemination in Wireless Sensor network‐enabled IoT using Domain‐Adaptive Message Passing Graph Neural Network (EEP‐WSN‐IoT‐DMPGNN) is proposed in this paper. The nodes are formed as clusters utilizing the Deep Fuzzy Curriculum Clustering (DFCC) technique that rewards nodes belonging to a given cluster. By using the Crayfish Optimization Algorithm (COA), the Cluster Head (CH) selection optimally chose the ideal CH and satisfies the multiple objective functions, such as energy, delay, traffic density, and distance. Afterward, domain‐adaptive Message Passing Graph Neural Network (DMPGNN) based routing protocol is developed, the input given to the routing protocol includes a sink, action history, future node, and maximum‐distance node, which attains enhanced data transfer in the chosen path. The proposed technique attains a lower no. of dead nodes, lower energy consumption, and higher Network Lifetime while analyzed with existing techniques, such as routing technique depending on deep learning for effectual data transmission in 5G WSN communication (DL‐RPDT‐WSN), Reinforcement‐Learning base energy effectual optimized routing protocol in WSN (RL‐EERP‐WSN), and Energy‐efficient intellectual routing method for IoT‐enabled WSN (EIR‐IoT‐WSN), respectively.

Enhanced centroid-based energy-efficient clustering routing protocol for serverless based wireless sensor networks

Serverless computing is a new concept as cloud computing, which dynamically manages the networks and is applied in Serverless Wireless Sensor Networks (SWSN) to help the networks. These networks are becoming famous for monitoring various physical and environmental factors. Serverless computing also facilitates the networks by offering an extensive range of applications. Different applications have been designed for monitoring purposes where the sensor nodes sense the data and transmit it to the base station through single or multi-hop routing. However, existing routing protocols cannot manage the sensor nodes’ energy issues because of the complex routing processes and depleted their power before their time. Because of these limitations, the nodes close to BS continuously rely on the network for data forwarding. As a result, these nodes cause energy consumption and lead to a useless state. This paper proposes a serverless architecture and designs an Enhanced Centroid-based Energy Efficient Clustering (ECEEC) protocol for SWSN networks. The proposed serverless architecture provides automated scalability, cost-effective services, and stateless execution. In addition, the proposed protocol offers the cluster head selection and its rotation to maximize the energy efficiency in the network. Furthermore, gateway nodes are chosen in every cluster to overcome the load on the cluster head. Simulation results indicated the excellent performance of the proposed protocol as compared to the existing routing protocols concerning network lifetime and energy consumption. The proposed protocol shows better reliability with nodes failing at 650 rounds compared to 600 rounds, especially with 5 % and 10 % Cluster Heads. The proposed protocol exhibits superior energy efficiency consumption of SNs under varying CH percentages, indicating the protocol’s consistent performance across different scenarios.

Machine Learning-assisted Distance Based Residual Energy Aware Clustering Algorithm for Energy Efficient Information Dissemination in Urban VANETs

A Vehicular Ad-hoc Network (VANET) is an essential component of intelligent transportation systems in the building of smart cities. A VANET is a self-configure high mobile and dynamic potential wireless ad-hoc network that joins all vehicle nodes in a smart city to provide in-vehicle infotainment services to city administrators and residents. In the smart city, the On-board Unit (OBU) of each vehicle has multiple onboard sensors that are used for data collection from the surrounding environment. One of the main issues in VANET is energy efficiency and balance because the small onboard sensors can’t be quickly recharged once installed on On-board Units (OBUs). Moreover, conserving energy stands out as a crucial challenge in VANET which is primarily contingent on the selection of Cluster Heads (CH) and the adopted packet routing strategy. To address this issue, this paper proposes distance and energy-aware clustering algorithms named SOMNNDP, which use a Self-Organizing Map Neural Network (SOMNN) machine learning technique to perform faster multi-hop data dissemination. Individual Euclidean distances and residual node energy are considered as mobility parameters throughout the cluster routing process to improve and balance the energy consumption among the participating vehicle nodes. This maximizes the lifetime of VANET by ensuring that all intermediate vehicle nodes use energy at approximately the same rate. Simulation findings demonstrate that SOMNNDP improves Quality of Service (QoS) better and consumes 17% and 14% less energy during cluster routing than distance and energy-aware variation of K-Means (KM) and Fuzzy C-Means (FCM) called KMDP and FCMDP respectively.

Fuzzy logic with honey badger algorithm for cluster‐based multi‐hop routing protocol for wireless sensor networks

SummaryIn the last decades, wireless sensor networks (WSNs) have appeared as an active research area owing to their high applicability in different application areas like healthcare, automation, and the military. Several issues have been encountered in the WSNs, including energy consumption, deployment of sensor nodes, routing algorithms, energy efficiency, cluster head (CH) selection, and robustness. Cluster‐based routing is one of the energy‐efficient solutions in the WSN. At the same time, the hot spot problem remains a challenging problem, which needs to be addressed in the design of energy‐efficient solutions for WSNs. Motivated by the abovementioned discussion, c The comprehensive comparison study pointed out the betterment of the FLHBA‐CMHR technique in terms of different measures. The FLHBA‐CMHR technique obtains a maximum half‐node die (HND) of 1629 nodes, while the LEACH, FUCA, URBD, DEFL, and E‐FUCA techniques attain decreased HND of 793, 1085, 1092, 1139, and 1344 nodes correspondingly.

IDA: Improved dragonfly algorithm for load balanced cluster heads selection in wireless sensor networks

IDA: Improved dragonfly algorithm for load balanced cluster heads selection in wireless sensor networks

Fuzzy inference logic assisted rendezvous points based effective routing strategy in wireless sensor networks

SummaryIn this proposed strategy, an effective routing strategy is introduced for routing based on Rendezvous Points assisted fuzzy inference logics. First, sensor nodes in the cluster are created using the mean‐shift clustering mechanism (MS‐ClusT). A cluster head is selected for the clusters to gather aggregated data from the nodes of clusters. The cluster head selection is done using the Manta Ray optimization‐assisted modified network‐based fuzzy inference logic (MMFiL) approach. Rendezvous points are then selected for routing to minimize the delay and energy consumption for visiting all cluster heads. The rendezvous points are used to define the shortest route for routing. The shortest path from clusters to the base station by selecting rendezvous points is implemented using an integrated neural network with an Archer‐Fish optimization algorithm (InnAFo). In the end, the performance attained by the model is compared with the results of the classical strategy and returns a 0.976563 packet delivery rate and 0.029297 loss rate in 500 nodes. Furthermore, the throughput attained by the proposed model is 0.992874 Mbps, and the delay is 67.30 ms at 500 nodes. The analysis of the proposed model will result in less time needed for cluster head selection.

Optimized Multi-objective Clustering using Fuzzy Based Genetic Algorithm for Lifetime Maximization of WSN

Background: Wireless Sensor Networks (WSNs) have gained significant attention due to their diverse applications, including border area security, earthquake detection, and fire detection. WSNs utilize compact sensors to detect environmental events and transmit data to a Base Station (BS) for analysis. Energy consumption during data transmission is a critical issue, which has led to the exploration of additional energy-saving techniques, such as clustering. Objective: The primary objective is to propose an algorithm that selects optimal Cluster Heads (CHs) through a fuzzy-based genetic approach. This algorithm aims to address energy consumption concerns, enhance load balancing, and improve routing efficiency within WSNs. Methods: The proposed algorithm employs a fuzzy-based genetic approach to optimize the selection of CHs for data transmission. Four key parameters are considered: the average remaining energy of CHs, the average distance between CHs and the BS, the average distance between member nodes and CHs, and the standard deviation of the distance between member nodes and CHs. Results: The algorithm's effectiveness is demonstrated through simulation results. When compared to popular models like LEACH, MOEES, and FEEC, it demonstrates an 8-20% improvement in the lifetime of WSNs. The proposed approach achieves enhanced efficiency, lifetime extension, and improved performance in CH selection, load balancing, and routing. Conclusion: In conclusion, this study introduces a novel algorithm that utilizes fuzzy-based genetic techniques to optimize CH selection in WSNs. By considering four key parameters and addressing energy consumption challenges, the proposed algorithm offers significant improvements in efficiency, lifespan, and overall network performance, as validated through simulation results.