Implementation and comparative analysis of evolutionary algorithms for energy optimization in wireless sensor networks

Energy optimization and coverage area optimization of wireless sensor networks (WSN) are two major challenges to accomplish reliability optimization in the field of WSN. Reliability optimization in the field of WSN is directly connected to the performance and efficiency and consistency of the network. In this paper, the authors describe how these challenges can be resolved by designing an efficient WSN with the help of meta-heuristic algorithms. They have configured an optimized route/path using ant colony optimization (ACO) algorithm and deployed static WSN nodes. After configuring an efficient network, if we can maximize the coverage area, then we can ensure that the network is a reliable network. For coverage area optimization, they used a hybrid differential evolution-quantum behaved particle swarm optimization (DE-QPSO) algorithm. The result has been compared with existing literature, and the authors found good results applying those meta-heuristic and hybrid algorithms.

Energy efficiency is critical in Wireless Sensor Networks (WSNs), pivotal for Internet of Things (IoT) applications like environmental monitoring and smart cities. Clustering protocols like Low-Energy Adaptive Clustering Hierarchy (LEACH) extend network lifetime through Cluster Head (CH) rotation, but random CH selection often leads to suboptimal energy use. This study evaluates eight hybrid Particle Swarm Optimization-based LEACH (PSO-LEACH) variants to optimize CH selection and clustering: FA-PSO-LEACH (Firefly Algorithm), CSA-PSO-LEACH (Crow Search Algorithm), PSO-LEACH with CBTEERA, Adaptive PSO-LEACH, ABC-PSO-LEACH (Artificial Bee Colony), ACO-PSO-LEACH (Ant Colony Optimization), WOA-PSO-LEACH (Whale Optimization Algorithm), and Hybrid GA-PSO-LEACH (Genetic Algorithm). The primary research objective is to compare these variants in terms of energy efficiency, network lifetime, and clustering quality to identify the most effective strategies for prolonging WSN operation in IoT environments. Specifically, this paper addresses the research question: Which hybrid PSO-LEACH variant provides the optimal balance between early-stage stability and long-term energy conservation in a simulated WSN with 50 nodes? Each variant uses a unique metaheuristic for CH selection based on residual energy and distance, with PSO refining clustering. A Python simulation modelled a 100m × 100m WSN with 50 nodes, assessing network lifetime (First Node Died, FND; Half Nodes Died, HND; Last Node Died, LND), energy consumption, and clustering quality. Results show ABC-PSO-LEACH leading with FND at 57 rounds and LND at 462 rounds, followed by WOA-PSO-LEACH (HND 148, LND 406), surpassing others (e.g., PSO-LEACH with CBTEERA: FND 10, LND 280). WOA-PSO-LEACH’s balanced energy distribution excels in mid-to-late stages, despite computational overhead. These bio-inspired hybrids outperform traditional LEACH, with ABC-PSO-LEACH and WOA-PSO-LEACH ideal for prolonged WSN operation. Future work aims to enhance early-stage performance and explore dynamic topologies.

Towards energy balancing optimization in wireless sensor networks: A novel quantum inspired genetic algorithm based sinks deployment approach

Wireless sensor networks (WSNs) have shown to be an efficient solution for physical parameters monitoring and activity detection. WSNs are usually designed using single optimization by optimizing one objective function such as energy consumption taking some constraints into consideration. In multi-objective optimization (MOPT) multiple and often conflicting objectives need to be optimized while satisfying some constraints. This paper proposes MOPT-based routing and flow rate assignment methodologies for WSNs. The first methodology employs Karush-Kuhn-Tucker (KKT) conditions to find the optimal solution, while the second one is based on genetic algorithms (GA). A new formulation is introduced jointly minimize the energy and the delay. Performance metrics such as the average end-to-end delay and energy consumption are evaluated and compared with those of previous work, namely the hybrid geographical routing (HGR) algorithm. The proposed work helps network designers to address design procedures efficiently and increase the flexibility in the energy delay tradeoff for communications in WSNs.

Wireless sensor networks contains small sensor node and processor which have several issues and challenges with regards to Limited Computational Capacity, Energy Efficiency, Path Planning Overhead and many more. Entire lifetime of network depends on efficient energy consumption in sensor network so it is a challenging task to design an Energy Efficient Routing Protocol for wireless sensor networks. Wireless sensor nodes dynamically self-organize themselves without utilizing preexisting infrastructure. Problem becomes more complex if some sensor node having mobility for some particular instance. In this paper we proposed an energy efficient routing protocol for WSN motivated by swarm intelligence of rummage behavior of ant and also covered mobility behavior of node. Furthermore we have combined the fuzzy logic with behavior of ant to take a better decision to find optimal path with less energy consumption. Our proposed algorithm utilize the principle of Fuzzy logic in addition of Ant Colony Optimization to develop energy efficient routing. The performance of our proposed work is evaluated on QualNet 7.4 Network Simulator. The simulation result shows that the proposed technique optimize the energy consumption, decrease RREQ packet and increase the lifetime of network as compare to existing routing protocol.

A coverage optimization method is suggested to improved node coverage in wireless sensor networks (WSNs), decrease node redundancy, and lengthen network lifetime, this method is based on the adaptive grey wolf arithmetic optimization algorithm The exploitation and exploration are first balanced using a cosine acceleration function. Then, to boost the method's performance, the grey wolf optimizer and arithmetic optimization algorithm are combined. In comparison to the conventional coverage optimization algorithm, our simulation results could improve arithmetic optimization algorithm has higher convergence efficiency and coverage rate, decreases network loss, and significantly lengthens the network life cycle.

Wireless sensor network (WSN) contains a huge number of spatially distributed sensor nodes that are connected by wireless to monitor and record information from the environment. The WSN nodes are battery-powered, thus reducing energy after a certain period which affects the network lifetime. To overcome this issue, this research proposed a spiral exploration mechanism with honey badger optimization (SEM-HBO) for cluster head (CH) and route path selection in WSN. The objective of this research is to reduce energy consumption and enhance network lifespan in WSN. The distance, communication cost, residual energy and cluster density are considered as fitness functions for selecting CH and route path in WSN. Through the SEM-HBO search behavior, it explores different routes and recognizes best one for reducing energy consumption and delays thereby enhancing network lifetime. The SEM-HBO performance is calculated based on packet delivery ratio (PDR), delay, energy consumption (EC), network lifetime (NL), and throughput for 100-500 nodes. The SEM-HBO performance is efficient and it achieves 99.62% and 99.59% of PDR for 100 and 200 nodes when compared to harmony search algorithm and competitive swarm optimization (HSA-CSO).

Wireless sensor networks (WSNs) are densely deployed for monitoring of environments and physical conditions in an extensive range of applications. Network lifetime and energy consumption are the primary performance evaluation metrics for WSNs. In this paper, an adaptive soft thresholding-based energy efficient sensor network (ASTEEN) protocol is proposed to increase the network lifetime by reducing the number of transmissions of non-critical data. It consequently reduces the consumption of communication energy. The performance of the proposed protocol is investigated with correlated and uncorrelated sensed data, and it is compared with the other related and conventional protocols. Simulation results show that the performance of the proposed ASTEEN routing protocol in terms of network lifetime and energy consumption significantly outperforms those of the other protocols, especially with correlated sensed values.

The development of various applications of wireless sensor networks has aroused great interest in using these types of networks in various fields. These networks, without infrastructure and self‐organization, are easily deployed in most environments and collect information about environmental phenomena for analysis and proper response to accidents and send them to the basic centers. They do. Wireless sensor networks are made up of some sensor nodes that both act as sensors and act as relay nodes concerning to each other. On the other hand, the lack of infrastructure in these networks has limited resources so that the nodes of the battery are fed with limited energy. Due to the location of networks in difficult and impassable areas, it is not possible to recharge or replace the node battery. Therefore, saving energy consumption in this type of network is one of the most important challenges. Since the rate of energy consumption when sensing information and receiving data packets from another node is a fixed value, so sensor nodes have the highest energy consumption when sending data. Therefore, routing methods try to reduce energy consumption based on systematic approaches. One of the most promising solutions to reduce energy consumption in wireless sensor networks is to cluster the nodes and select the threaded node based on the data transfer parameters so that the average energy consumption in the nodes is reduced and the network lifetime is increased. Therefore, in this research, a new optimization approach using multiobjective genetic algorithm and cuckoo algorithm for clustering wireless sensor networks is presented. In this study, in order to select clustered nodes from a multiobjective genetic algorithms based on reducing intracluster distances and reducing energy consumption in cluster member nodes and near‐optimal routing based on cuckoo optimization algorithm to transfer information between nodes have been used in the direction of the cavity. The implementation results show that considering the evolutionary capabilities of the multiobjective genetic algorithm and the cuckoo optimization algorithm, the proposed method in terms of energy consumption, efficiency, delivery rate, and packet transmission latency, compared to previous methods, has improved.

Developments in last decade in the field of electronics & communication, computer science and information technology field have resulted in the new technology paradigm, Wireless Sensor Networks. WSN is becoming increasingly popular due to their wide range of applications. For successful adaption of WSN in real field applications, there are certain issues which need to be addressed particularly the issue of energy consumption associated with sensor nodes. This limitation combined with node deployment has added many challenges to design and management of wireless sensor networks. The WSNs are involved in applications such as remote environment monitoring, event tracking in areas where providing electrical energy is very difficult. Moreover, the battery fed sensor nodes have very small energy associated with them, so preserving that energy and maximizing the usage of that energy is most critical issue in WSNs. Here, we present a survey of various energy optimization and lifetime enhancement techniques in wireless sensor networks and makes the reader aware about various energy saving techniques in WSN. They are analyzed from various points of view: Device hardware, Transmission, MAC protocols and Routing protocols.

In wireless sensor networks (WSNs), node’s locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In this paper, we propose an adaptive mobile anchor localization algorithm based on ant colony optimization, firstly, some virtual anchor nodes are distributed in the area, second, ant colony was used which has the maximum of transition probabilities to obtain the optimal path, last, the centroid-weighted localization algorithm was proposed to locate the position of unknown nodes. Simulation results show that the localization accuracy of the proposed algorithm is better than the traditional centroid algorithm, the more number of anchor nodes, namely, the density is bigger, the position errors is smaller. Under the same anchor nodes, the more number of unknown nodes, the position errors is smaller and the overall trend is downward.

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.

Wireless sensor networks (WSNs) are becoming more prevalent in a wide range of uses, including tracking the environment, medical care, and military monitoring. Yet, security, energy efficiency, and overall efficiency are important concerns for these networks. Ensuring the security of data transmission while maintaining energy efficiency is critical for the longevity and reliability of WSNs. This paper proposes a novel method to enhance both security and efficiency in WSNs done the integration of metaheuristic optimization algorithms. The proposed method leverages advanced optimization techniques such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO), and Ant Colony Optimization (ACO) to dynamically optimize key parameters, including node deployment, routing protocols, and encryption schemes. By optimizing the network topology, routing paths, and energy consumption strategies, the algorithm significantly improves data security, minimizes energy usage, and enhances network lifespan. The simulation results show that the suggested methodology beats standard methods in terms of throughput, security resilience and energy efficiency. The findings highlight the potential of metaheuristic optimization algorithms as a robust tool for improving WSN security and operational efficiency in real-world applications

SummaryAnt colony optimization (ACO) and unequal clustering algorithms in wireless sensor networks (WSNs) prove their efficiency in protracting the network lifetime. However, the existing ACO and unequal clustering algorithms, respectively, do not consider jointly energy efficiency and reliability and focus only on some normal parameters to adjust the cluster radius, then neglecting the cluster head (CH) neighborhood information as it is wise to reduce the cluster radius when there are more neighbor CHs in order to balance the load and energy consumption. To resolve these problems, we propose a fault‐tolerant distributed ACO‐based routing (DACOR) protocol for mitigating the hot spot problem in fog‐enabled WSN architecture. To improve the performance of the network, we propose a multiple fog nodes (FNs) and unequal clustering‐based network model. The proposed model is energy efficient as it avoids repetitive clustering and affects CHs to FNs based on distance. Also, unlike the existing works which use either single FN/sink‐based unequal clustering or multiple FNs/sinks to mitigate hot spot problem, we propose to distribute unequal clustering to multiple FNs (partitions). Additionally, we formulate a different rule to calculate the cluster radius based on significant parameters ensuring energy efficiency and balancing. To route data from source to destination, we devise a new probabilistic formula which considers not only energy efficiency but also reliability. The performance of the proposed DACOR protocol has been investigated under different scenarios through simulations. The results show that the proposed DACOR protocol outperforms the existing protocols in terms of various main metrics.

Inverse transient radiation analysis in one-dimensional participating slab using improved Ant Colony Optimization algorithms