Metaheuristics Techniques for Cluster Head Selection in WSN: A Survey

In recent years, Wireless sensor communication is growing expeditiously on the capability to gather information, communicate and transmit data effectively. Clustering is the main objective of improving the network lifespan in Wireless sensor network. It includes selecting the cluster head for each cluster in addition to grouping the nodes into clusters. The cluster head gathers data from the normal nodes in the cluster, and the gathered information is then transmitted to the base station. However, there are many reasons in effect opposing unsteady cluster head selection and dead nodes. The technique for selecting a cluster head takes into factors to consider including residual energy, neighbors’ nodes, and the distance between the base station to the regular nodes. In this study, we thoroughly investigated by number of methods of selecting a cluster head and constructing a cluster. Additionally, a quick performance assessment of the techniques' performance is given together with the methods' criteria, advantages, and future directions

A Review of Wireless Sensor Networks with Cognitive Radio Techniques and Applications

The advent of Wireless Sensor Networks (WSNs) has inspired various sciences and telecommunication with its applications, there is a growing demand for robust methodologies that can ensure extended lifetime. Sensor nodes are small equipment which may hold less electrical energy and preserve it until they reach the destination of the network. The main concern is supposed to carry out sensor routing process along with transferring information. Choosing the best route for transmission in a sensor node is necessary to reach the destination and conserve energy. Clustering in the network is considered to be an effective method for gathering of data and routing through the nodes in wireless sensor networks. The primary requirement is to extend network lifetime by minimizing the consumption of energy. Further integrating cognitive radio technique into sensor networks, that can make smart choices based on knowledge acquisition, reasoning, and information sharing may support the network's complete purposes amid the presence of several limitations and optimal targets. This examination focuses on routing and clustering using metaheuristic techniques and machine learning because these characteristics have a detrimental impact on cognitive radio wireless sensor node lifetime

Energy efficient chaotic whale optimization technique for data gathering in wireless sensor network

A Wireless Sensor Network includes the distributed sensor nodes using limited energy, to monitor the physical environments and forward to the sink node. Energy is the major resource in WSN for increasing the network lifetime. Several works have been done in this field but the energy efficient data gathering is still not improved. In order to amend the data gathering with minimal energy consumption, an efficient technique called chaotic whale metaheuristic energy optimized data gathering (CWMEODG) is introduced. The mathematical model called Chaotic tent map is applied to the parameters used in the CWMEODG technique for finding the global optimum solution and fast convergence rate. Simulation of the proposed CWMEODG technique is performed with different parameters such as energy consumption, data packet delivery ratio, data packet loss ratio and delay with deference to dedicated quantity of sensor nodes and number of packets. The consequences discussion shows that the CWMEODG technique progresses the data gathering and network lifetime with minimum delay as well as packet loss than the state-of-the-art methods

Trust And Energy-Aware Routing Protocol for Wireless Sensor Networks Based on Secure Routing

Wireless Sensor Network (WSN) is a network area that includes a large number of nodes and the ability of wireless transmission. WSNs are frequently employed for vital applications in which security and dependability are of utmost concern. The main objective of the proposed method is to design a WSN to maximize network longevity while minimizing power usage. In a WSN, trust management is employed to encourage node collaboration, which is crucial for achieving dependable transmission. In this research, a novel Trust and Energy Aware Routing Protocol (TEARP) in wireless sensors networks is proposed, which use blockchain technology to maintain the identity of the Sensor Nodes (SNs) and Aggregator Nodes (ANs). The proposed TEARP technique provides a thorough trust value for nodes based on their direct trust values and the filtering mechanisms generate the indirect trust values. Further, an enhanced threshold technique is employed to identify the most appropriate clustering heads based on dynamic changes in the extensive trust values and residual energy of the networks. Lastly, cluster heads should be routed in a secure manner using a Sand Cat Swarm Optimization Algorithm (SCSOA). The proposed method has been evaluated using specific parameters such as Network Lifetime, Residual Energy, Throughpu,t Packet Delivery Ratio, and Detection Accuracy respectively. The proposed TEARP method improves the network lifetime by 39.64%, 33.05%, and 27.16%, compared with Energy-efficient and Secure Routing (ESR), Multi-Objective nature-inspired algorithm based on Shuffled frog-leaping algorithm and Firefly Algorithm (MOSFA) , and Optimal Support Vector Machine (OSVM)

Multiple solutions based particle swarm optimization for cluster-head-selection in wireless-sensor-network

Wireless sensor network (WSN) has a significant role in wide range of scientific and industrial applications. In WSN, within the operation area of sensor nodes the nodes are randomly deployed. The constraint related to energy is considered as one of the major challenges for WSN, which may not only affect the sensor nodes efficiency but also influences the operational capabilities of the network. Therefore, numerous attempts of researches have been proposed to counter this energy problem in WSN. Hierarchical clustering approaches are popular techniques that offered the efficient consumption of the energy in WSN. In addition to this, it is understood that the optimum choice of sensor as cluster head can critically help to reduce the energy consumption of the sensor node. In recent years, metaheuristic optimization is used as a proposed technique for the optimal selection of cluster heads. Furthermore, it is noteworthy here that proposed techniques should be efficient enough to provide the optimal solution for the given problem. Therefore, in this regard, various attempts are made in the form of modified versions or new metaheuristic algorithms for optimization problems. The research in the paper offered a modified version of particle-swarm-optimization (PSO) for the optimal selection of sensor nodes as cluster heads. The performance of the suggested algorithm is experimented and compared with the renowned optimization techniques. The proposed approach produced better results in the form of residual energy, number of live nodes, sum of dead nodes, and convergence rate

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

A Novel Approach for Enhancing Routing in Wireless Sensor Networks using ACO Algorithm

Wireless Sensors Network (WSN) is an emergent technology that aims to offer innovative capacities. In the last decade, the use of these networks increased in various fields like military, science, and health due to their fast and inexpressive deployment and installation. However, the limited sensor battery lifetime poses many technical challenges and affects essential services like routing. This issue is a hot topic of search, many researchers have proposed various routing protocols aimed at reducing the energy consumption in WSNs. The focus of this work is to investigate the effectiveness of integrating ACO algorithm with routing protocols in WSNs. Moreover, it presents a novel approach inspired by ant colony optimization (ACO) to be deployed as a new routing protocol that addresses key challenges in wireless sensor networks. The proposed protocol can significantly minimize nodes energy consumption, enhance the network lifetime, reduce latency, and expect performance in various scenarios

A Hybrid Metaheuristic Algorithm for Stop Point Selection in Wireless Rechargeable Sensor Network

A wireless rechargeable sensor network (WRSN) enables charging of rechargeable sensor nodes (RSN) wirelessly through a mobile charging vehicle (MCV). Most existing works choose the MCV’s stop point (SP) at random, the cluster’s center, or the cluster head position, all without exploring the demand from RSNs. It results in a long charging delay, a low charging throughput, frequent MCV trips, and more dead nodes. To overcome these issues, this paper proposes a hybrid metaheuristic algorithm for stop point selection (HMA-SPS) that combines the techniques of the dragonfly algorithm (DA), firefly algorithm (FA), and gray wolf optimization (GWO) algorithms. Using FA and GWO techniques, DA predicts an ideal SP using the run-time metrics of RSNs, such as energy, delay, distance, and trust factors. The simulated results demonstrate faster convergence with low delay and highlight that more RSNs can be recharged with fewer MCV visits, further enhancing energy utilization, throughput, network lifetime, and trust factor

Lotus effect optimization algorithm (LEA): a lotus nature-inspired algorithm for engineering design optimization

Here we introduce a new evolutionary algorithm called the Lotus Effect Algorithm, which combines efficient operators from the dragonfly algorithm, such as the movement of dragonflies in flower pollination for exploration, with the self-cleaning feature of water on flower leaves known as the lotus effect, for extraction and local search operations. The authors compared this method to other improved versions of the dragonfly algorithm using standard benchmark functions, and it outperformed all other methods according to Fredman\u27s test on 29 benchmark functions. The article also highlights the practical application of LEA in reducing energy consumption in IoT nodes through clustering, resulting in increased packet delivery ratio and network lifetime. Additionally, the performance of the proposed method was tested on real-world problems with multiple constraints, such as the welded beam design optimization problem and the speed-reducer problem applied in a gearbox, and the results showed that LEA performs better than other methods in terms of accuracy