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

The Deployment in the Wireless Sensor Networks: Methodologies, Recent Works and Applications

International audienceThe wireless sensor networks (WSN) is a research area in continuous evolution with a variety of application contexts. Wireless sensor networks pose many optimization problems, particularly because sensors have limited capacity in terms of energy, processing and memory. The deployment of sensor nodes is a critical phase that significantly affects the functioning and performance of the network. Often, the sensors constituting the network cannot be accurately positioned, and are scattered erratically. To compensate the randomness character of their placement, a large number of sensors is typically deployed, which also helps to increase the fault tolerance of the network. In this paper, we are interested in studying the positioning and placement of sensor nodes in a WSN. First, we introduce the problem of deployment and then we present the latest research works about the different proposed methods to solve this problem. Finally, we mention some similar issues related to the deployment and some of its interesting applications

Spread Spectrum based QoS aware Energy Efficient Clustering Algorithm for Wireless Sensor Networks

Wireless sensor networks (WSNs) are composed of small, resource-constrained sensor nodes that form self-organizing, infrastructure-less, and ad-hoc networks. Many energy-efficient protocols have been developed in the network layer to extend the lifetime and scalability of these networks, but they often do not consider the Quality of Service (QoS) requirements of the data flow, such as delay, data rate, reliability, and throughput. In clustering, the probabilistic and randomized approach for cluster head selection can lead to varying numbers of cluster heads in different rounds of data gathering. This paper presents a new algorithm called "Spread Spectrum based QoS aware Energy Efficient Clustering for Wireless sensor Networks" that uses spread spectrum to limit the formation of clusters and optimize the number of cluster heads in WSNs, improving energy efficiency and QoS for diverse data flows. Simulation results show that the proposed algorithm outperforms classical algorithms in terms of energy efficiency and QoS

Energy efficient data collection with multiple mobile sink using artificial bee colony algorithm in large-scale WSN

In most wireless sensor networks (WSN), multi-hop routing algorithm is used to transmit the data collected by sensors to user. Multi-hop forwarding leads to energy hole problem and high transmission overhead in large scale WSN. In order to address these problems, this paper proposes multiple mobile sink based data collection algorithm, which introduces energy balanced clustering and Artificial Bee Colony based data collection. The cluster head election is based on the residual energy of the node. In this study, we focused on a large-scale and intensive WSN which allows a certain amount of data latency by investigating mobile Sink balance from three aspects: data collection maximization, mobile path length minimization, and network reliability optimization. Simulation results show that, in comparison with other algorithms such Random walk and Ant Colony Optimization, the proposed algorithm can effectively reduce data transmission, save energy, improve network data collection efficiency and reliability, and extend the network lifetime

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

Extending the Lifetime of Wireless Sensor Networks Based on an Improved Multi-objective Artificial Bees Colony Algorithm

Reducing the sensors\u27 energy expenditure to prolong the network lifespan as long as possible remains a fundamental problem in the field of wireless networks. Particularly in applications with inaccessible environments, which impose crucial constraints on sensor replacement. It is, therefore, necessary to design adaptive routing protocols, taking into account the environmental constraints and the limited energy of sensors. To have an energy-efficient routing protocol, a new cluster heads’ (CHs) selection strategy using a modified multi-objective artificial bees colony (MOABC) optimization is defined. The modified MOABC is based on the roulette wheel selection over non-dominated solutions of the repository (hyper-cubes) in which a rank is assigned to each hypercube based on its density in dominated solutions of the current iteration and then a random food source is elected by roulette from the densest hypercube. The proposed work aims to find the optimal set of CHs based on their residual energies to ensure an optimal balance between the nodes\u27 energy consumption. The achieved results proved that the proposed MOABC-based protocol considerably outperforms recent studies and well-known energy-efficient protocols, namely: LEACH, C-LEACH, SEP, TSEP, DEEC, DDEEC, and EDEEC in terms of energy efficiency, stability, and network lifespan extension

Energy Efficient Multi-hop routing scheme using Taylor based Gravitational Search Algorithm in Wireless Sensor Networks

A group of small sensors can participate in the wireless network infrastructure and make appropriate transmission and communication sensor networks. There are numerous uses for drones, including military, medical, agricultural, and atmospheric monitoring. The power sources available to nodes in WSNs are restricted. Furthermore, because of this, a diverse method of energy availability is required, primarily for communication over a vast distance, for which Multi-Hop (MH) systems are used. Obtaining the optimum routing path between nodes is still a significant problem, even when multi-hop systems reduce the cost of energy needed by every node along the way. As a result, the number of transmissions must be kept to a minimum to provide effective routing and extend the system\u27s lifetime. To solve the energy problem in WSN, Taylor based Gravitational Search Algorithm (TBGSA) is proposed, which combines the Taylor series with a Gravitational search algorithm to discover the best hops for multi-hop routing. Initially, the sensor nodes are categorised as groups or clusters and the maximum capable node can access the cluster head the next action is switching between multiple nodes via a multi-hop manner. Initially, the best (CH) Cluster Head is chosen using the Artificial Bee Colony (ABC) algorithm, and then the data is transmitted utilizing multi-hop routing. The comparison result shows out the extension of networks longevity of the proposed method with the existing EBMRS, MOGA, and DMEERP methods. The network lifetime of the proposed method increased by 13.2%, 21.9% and 29.2% better than DMEERP, MOGA, and EBMRS respectively

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)